EDBT 2026 Demo / reviewers in the wild / expert
Gabriela Kadlecová
dblp:376/9031
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search › search space design
architecture encoding |
0.8 | 1 | 2024 | Surprisingly Strong Performance Prediction with Neural Graph Features · ICML 2024 |
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search |
0.8 | 1 | 2024 | Surprisingly Strong Performance Prediction with Neural Graph Features · ICML 2024 |
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search
performance prediction |
0.8 | 1 | 2024 | Surprisingly Strong Performance Prediction with Neural Graph Features · ICML 2024 |
Methods — techniques the papers use, named apart from their topics
zero-cost proxies · 0.8neural graph features · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Surprisingly Strong Performance Prediction with Neural Graph FeaturesabstractPerformance prediction has been a key part of the neural architecture search (NAS) process, allowing to speed up NAS algorithms by avoiding resource-consuming network training. Although many performance predictors correlate well with ground truth performance, they require training data in the form of trained networks. Recently, zero-cost proxies have been proposed as an efficient method to estimate network performance without any training. However, they are still poorly understood, exhibit biases with network properties, and their performance is limited. Inspired by the drawbacks of zero-cost proxies, we propose neural graph features (GRAF), simple to compute properties of architectural graphs. GRAF offers fast and interpretable performance prediction while outperforming zero-cost proxies and other common encodings. In combination with other zero-cost proxies, GRAF outperforms most existing performance predictors at a fraction of the cost. Gabriela Kadlecová, Jovita Lukasik, Martin Pilát, Petra Vidnerová, Mahmoud Safari, Roman Neruda, Frank Hutter |
ICML | 1 |