Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Arjun Krishnakumar

dblp:312/6584 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
2 papers
Efficient and distributed learning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search
1.122022
NAS-Bench-Suite-Zero: Accelerating Research on Zero Cost Proxies · NeurIPS 2022
NAS-Bench-Suite: NAS Evaluation is (Now) Surprisingly Easy · ICLR 2022
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search
performance prediction
0.612022
NAS-Bench-Suite-Zero: Accelerating Research on Zero Cost Proxies · NeurIPS 2022
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search
zero-cost proxy
0.612022
NAS-Bench-Suite-Zero: Accelerating Research on Zero Cost Proxies · NeurIPS 2022
Performance modeling and evaluation
benchmarking
0.612022
NAS-Bench-Suite: NAS Evaluation is (Now) Surprisingly Easy · ICLR 2022

Methods — techniques the papers use, named apart from their topics

surrogate model · 0.6information-theoretic analysis · 0.6
YearPublicationVenuePosition
2022 NAS-Bench-Suite: NAS Evaluation is (Now) Surprisingly Easy
Yash Mehta, Colin White, Arber Zela, Arjun Krishnakumar, Guri Zabergja, Shakiba Moradian, Mahmoud Safari, Kaicheng Yu, Frank Hutter
ICLR4
2022 NAS-Bench-Suite-Zero: Accelerating Research on Zero Cost Proxies
abstract
Zero-cost proxies (ZC proxies) are a recent architecture performance prediction technique aiming to significantly speed up algorithms for neural architecture search (NAS). Recent work has shown that these techniques show great promise, but certain aspects, such as evaluating and exploiting their complementary strengths, are under-studied. In this work, we create NAS-Bench-Suite: we evaluate 13 ZC proxies across 28 tasks, creating by far the largest dataset (and unified codebase) for ZC proxies, enabling orders-of-magnitude faster experiments on ZC proxies, while avoiding confounding factors stemming from different implementations. To demonstrate the usefulness of NAS-Bench-Suite, we run a large-scale analysis of ZC proxies, including a bias analysis, and the first information-theoretic analysis which concludes that ZC proxies capture substantial complementary information. Motivated by these findings, we present a procedure to improve the performance of ZC proxies by reducing biases such as cell size, and we also show that incorporating all 13 ZC proxies into the surrogate models used by NAS algorithms can improve their predictive performance by up to 42%. Our code and datasets are available at https://github.com/automl/naslib/tree/zerocost.
Arjun Krishnakumar, Colin White, Arber Zela, Renbo Tu, Mahmoud Safari, Frank Hutter
NeurIPS1