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

Mingzhuo Lin

dblp:439/1529 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—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 · 67% Optimization for machine learning · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search
0.912025
Per-Architecture Training-Free Metric Optimization for Neural Architecture Search · NeurIPS 2025
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
surrogate model
0.912025
Per-Architecture Training-Free Metric Optimization for Neural Architecture Search · NeurIPS 2025
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search
zero-cost proxy
0.912025
Per-Architecture Training-Free Metric Optimization for Neural Architecture Search · NeurIPS 2025

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

surrogate model · 0.9evolutionary algorithm · 0.9
YearPublicationVenuePosition
2025 Per-Architecture Training-Free Metric Optimization for Neural Architecture Search
abstract
Neural Architecture Search (NAS) aims to identify high-performance networks within a defined search space. Training-free metrics have been proposed to estimate network performance without actual training, reducing NAS deployment costs. However, individual training-free metrics often capture only partial architectural features, and their estimation capabilities are different in various tasks. Combining multiple training-free metrics has been explored to enhance scalability across tasks. Yet, these methods typically optimize global metric combinations over the entire search space, overlooking the varying sensitivities of different architectures to specific metrics, which may limit the final architectures' performance. To address these challenges, we propose the Per-Architecture Training-Free Metric Optimization NAS (PO-NAS) algorithm. This algorithm: (a) Integrates multiple training-free metrics as auxiliary scores, dynamically optimizing their combinations using limited real-time training data, without relying on benchmarks; (b) Individually optimizes metric combinations for each architecture; (c) Integrates an evolutionary algorithm that leverages efficient predictions from surrogate models, enhancing search efficiency in large search spaces. Notably, PO-NAS combines the efficiency of training-free search with the robust performance of training-based evaluations. Extensive experiments demonstrate the effectiveness of our approach. Our code has been made publicly available at https://github.com/LMZ-Zhuo/PO-NAS.
Mingzhuo Lin, Jianping Luo
NeurIPS1