Aug 2026· IEEE Computational Intelligence Magazine· Vol 21, pp. 65-78· 1 citation· 51 references
Abstract
Neural Architecture Search (NAS) offers a promising pathway to automate the design of deep neural networks, yet it faces a significant challenge in balancing computational efficiency with search effectiveness in a huge search space. Coarse-to-fine (C2F) NAS methods mitigate this by narrowing the architecture search to promising subspaces. However, by focusing only on a single region, they risk overlooking globally optimal architectures due to the multi-modal nature of the search space. This paper highlights the limitation of existing C2F approaches and motivates the need for more sophisticated search strategies capable of efficiently exploring multiple promising regions to achieve a better performance-efficiency trade-off. To achieve this goal, we propose a multi-stage NAS (MstageNAS) framework that progressively constructs multiple high-quality subspaces and implements an efficient exploration within them. MstageNAS initiates with a coarse search to identify promising architectures within the whole search space. Subsequently, the individual subspace is constructed around each promising architecture. To ensure the quality of this subspace, an architecture explanation method is devised to identify the core sub-structure of the promising architecture and use it to form the basis of the individual subspace. Finally, a Monte Carlo-based search strategy is developed to facilitate architecture search within these subspaces, with the goal of striking a good balance between exploration and exploitation. We evaluate the proposed MstageNAS framework across search spaces of various types and tasks. Extensive experiments demonstrate that MstageNAS can outperform state-of-the-art NAS methods or achieve comparable performance but with about 2× less search cost.
Neural Architecture Search (NAS) serves as a performance engine for automated machine learning, driving intelligent advancements across various domains. However, its development has been significantly constrained by the prohibitively high computational costs involved. Training-Free Neural Architecture Search (TFNAS)...
It is demonstrated that network architecture and its coeficients can be learned together by unifying concepts of evolutionary search within a population based traditional training process.
An architecture search framework that makes the alignment between experts and the structure of the data an explicit search variable and ensures that the assignment of data clusters to experts is optimised jointly with the per-expert architectures is proposed.
Although Deep Neural Networks have become foundational in many areas of Machine Learning, high computational demands limit their application in resource-constrained environments. To address this issue, depth compression methods have been proposed to identify and linearize redundant activation functions, thereby allowin...
P. Shul'zhenko, Gabriele Spadaro, Enzo Tartaglione· 0 citations
This work proposes Retrv-MoE, a unified retrieval architecture built upon sparse Mixture-of-Experts (MoE), and theoretically and empirically demonstrates that this conditional computation mechanism provides a structural remedy to optimization interference by decoupling the learning trajectories of conflicting tasks and...
Tongxu Lin, Jiayin Xiao· Proceedings of the 32nd ACM...· 0 citations
This work develops a general bilevel optimization framework for NAS across diverse architectures, including MLPs, CNNs, RNNs, and Transformers, to identify compact architectures with strong predictive performance.