Raphael T. Husistein

dblp:385/8813 · 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 · 87% Deep learning architectures and training · 13%

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
NEAR: A Training-Free Pre-Estimator of Machine Learning Model Performance · ICLR 2025
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search
zero-cost proxy
0.912025
NEAR: A Training-Free Pre-Estimator of Machine Learning Model Performance · ICLR 2025
Machine learning › Deep learning architectures and training
neural network expressivity
0.312025
NEAR: A Training-Free Pre-Estimator of Machine Learning Model Performance · ICLR 2025

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

activation rank · 0.9
YearPublicationVenuePosition
2025 NEAR: A Training-Free Pre-Estimator of Machine Learning Model Performance
abstract
Artificial neural networks have been shown to be state-of-the-art machine learning models in a wide variety of applications, including natural language processing and image recognition. However, building a performant neural network is a laborious task and requires substantial computing power. Neural Architecture Search (NAS) addresses this issue by an automatic selection of the optimal network from a set of potential candidates. While many NAS methods still require training of (some) neural networks, zero-cost proxies promise to identify the optimal network without training. In this work, we propose the zero-cost proxy Network Expressivity by Activation Rank (NEAR). It is based on the effective rank of the pre- and post-activation matrix, i.e., the values of a neural network layer before and after applying its activation function. We demonstrate the cutting-edge correlation between this network score and the model accuracy on NAS-Bench-101 and NATS-Bench-SSS/TSS. In addition, we present a simple approach to estimate the optimal layer sizes in multi-layer perceptrons. Furthermore, we show that this score can be utilized to select hyperparameters such as the activation function and the neural network weight initialization scheme.
Raphael T. Husistein, Markus Reiher, Marco Eckhoff
ICLR1