OptiProxy-NAS: Optimization Proxy based End-to-End Neural Architecture Search

Bo Lyu, Yu Cui, Tuo Shi, Ke Li
9/6/2025
cs.LGcs.AI

No official code found. Best implementation: blyucs/OptiProxy-NAS (2 stars, Apache-2.0, last commit 2025-08-31).

Abstract

Neural architecture search (NAS) is a hard computationally expensive optimization problem with a discrete, vast, and spiky search space. One of the key research efforts dedicated to this space focuses on accelerating NAS via certain proxy evaluations of neural architectures. Different from the prevalent predictor-based methods using surrogate models and differentiable architecture search via supernetworks, we propose an optimization proxy to streamline the NAS as an end-to-end optimization framework, named OptiProxy-NAS. In particular, using a proxy representation, the NAS space is reformulated to be continuous, differentiable, and smooth. Thereby, any differentiable optimization method can be applied to the gradient-based search of the relaxed architecture parameters. Our comprehensive experiments on $12$ NAS tasks of $4$ search spaces across three different domains including computer vision, natural language processing, and resource-constrained NAS fully demonstrate the superior search results and efficiency. Further experiments on low-fidelity scenarios verify the flexibility.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

OptiProxy-NAS: Optimization Proxy based End-to-End Neural Architecture Search

20Shell, PythonAug 31, 20251 years agoApache-2.0

Similar Papers

Cite this paper

@article{lyu2025optiproxynas,
  title  = {OptiProxy-NAS: Optimization Proxy based End-to-End Neural Architecture Search},
  author = {Bo Lyu and Yu Cui and Tuo Shi and Ke Li},
  year   = {2025},
  eprint = {2509.05656},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.05656v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.05656.svg)](https://codeofpaper.com/paper/2509.05656)

Discussion