paper-with-me

Papers

Towards Robust Training in NNGPT AutoML Pipeline: A Loss-Optimizer Pairing Selection Study

2026-06-18 · Anton Abramochkin, Radu Timofte, Dmitry Ignatov arxiv

The choice of loss function and optimizer is an important decision, that shapes further model training. Yet automated architecture search pipelines (AutoML) benefits significantly more from the optimal pairing selection and vice versa. This paper investigates whether a single recipe is sufficient for heterogeneous architecture pools, or whether the optimal pairing varies across structurally diverse models. We conduct a systematic empirical study of all $3 \times 6 = 18$ combinations of six optimizers (SGD+Momentum, Adam, AdamW, RMSprop, Adagrad, Adadelta), paired with three loss functions: Cross-Entropy (CEL), Negative Log-Likelihood (NLL), and the recently introduced genetically evolved NGL loss across the base models presented in LEMUR heterogeneous architecture pool on six image classification datasets (CelebA-Gender, CIFAR-10, CIFAR-100, ImageNette, MNIST, SVHN). The 18 loss-optimizer configurations are applied to each of the 33 compatible base architectures taken from the LEMUR pool, resulting in 594 variants that were generated fully automatically by a source-level injection pipeline and evaluated under fixed hyperparameters, ensuring that observed accuracy differences are attributable solely to the loss-optimizer pairing. Our results confirm that no single pairing is universally optimal. Cross-Entropy with Adam or AdamW is the most robust choice across architecture families and datasets. NGL is a competitive alternative to CEL on standard convolutional classifiers, but only when paired with adaptive optimizers; it degrades substantially with SGD or accumulation-based methods. Adagrad and Adadelta consistently underperform under fixed hyperparameters regardless of loss function, highlighting their sensitivity to learning rate tuning. These findings provide actionable guidance for loss-optimizer selection within NNGPT Framework.

📄 PDF Abstract BibTeX arXiv:2606.20933

Code (0)

등록된 구현이 없습니다.

Tasks

Image Classification

Similar Papers 제목 키워드 기반

NNGPT: Rethinking AutoML with Large Language Models

2025-11-25 · Roman Kochnev, Waleed Khalid, Tolgay Atinc Uzun, Xi Zhang 외 arxiv

Building self-improving AI systems remains a fundamental challenge in the AI domain. We present NNGPT, an open-source framework that turns a large language model (LLM) into a self-improving AutoML engine for neural netwo…

Hyperparameter OptimizationReinforcement Learning

Pipeline Combinators for Gradual AutoML

2021-12-01 · NeurIPS 2021 12 · Guillaume Baudart, Martin Hirzel, Kiran Kate, Parikshit Ram 외

Automated machine learning (AutoML) can make data scientists more productive. But if machine learning is totally automated, that leaves no room for data scientists to apply their intuition. Hence, data scientists often…

AutoMLBIG-bench Machine LearningTranslation

Fast Optimizer Benchmark

2024-06-26 · Simon Blauth, Tobias Bürger, Zacharias Häringer, Jörg Franke 외

In this paper, we present the Fast Optimizer Benchmark (FOB), a tool designed for evaluating deep learning optimizers during their development. The benchmark supports tasks from multiple domains such as computer vision, …

AutoMLGraph LearningHyperparameter Optimization

Deep Pipeline Embeddings for AutoML

2023-05-23 · Sebastian Pineda Arango, Josif Grabocka

Automated Machine Learning (AutoML) is a promising direction for democratizing AI by automatically deploying Machine Learning systems with minimal human expertise. The core technical challenge behind AutoML is optimizing…

Automatic Machine Learning Model SelectionAutoMLBayesian OptimizationGaussian Processes+1

Naive Automated Machine Learning

2021-11-29 · Felix Mohr, Marcel Wever

An essential task of Automated Machine Learning (AutoML) is the problem of automatically finding the pipeline with the best generalization performance on a given dataset. This problem has been addressed with sophisticate…

AutoMLBayesian OptimizationBIG-bench Machine Learning