Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2303.13683

OFA$^2$: A Multi-Objective Perspective for the Once-for-All Neural Architecture Search

Rafael C. Ito·Fernando J. Von Zuben
View original source ↗Read source document ↗Export metadata ↓

Abstract

Once-for-All (OFA) is a Neural Architecture Search (NAS) framework designed to address the problem of searching efficient architectures for devices with different resources constraints by decoupling the training and the searching stages. The computationally expensive process of training the OFA neural network is done only once, and then it is possible to perform multiple searches for subnetworks extracted from this trained network according to each deployment scenario. In this work we aim to give one step further in the search for efficiency by explicitly conceiving the search stage as a multi-objective optimization problem. A Pareto frontier is then populated with efficient, and already trained, neural architectures exhibiting distinct trade-offs among the conflicting objectives. This could be achieved by using any multi-objective evolutionary algorithm during the search stage, such as NSGA-II and SMS-EMOA. In other words, the neural network is trained once, the searching for subnetworks considering different hardware constraints is also done one single time, and then the user can choose a suitable neural network according to each deployment scenario. The conjugation of OFA and an explicit algorithm for multi-objective optimization opens the possibility of a posteriori decision-making in NAS, after sampling efficient subnetworks which are a very good approximation of the Pareto frontier, given that those subnetworks are already trained and ready to use. The source code and the final search algorithm will be released at https://github.com/ito-rafael/once-for-all-2

Explore related subjects

cs.NEcs.AIcs.CVcs.LG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rafael C. Ito, Fernando J. Von Zuben. 2023-03-23. OFA$^2$: A Multi-Objective Perspective for the Once-for-All Neural Architecture Search. https://arxiv.org/abs/2303.13683

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Continuous Spiking Graph Neural Networks

Continuous graph neural networks (CGNNs) have garnered significant attention due to their ability to generalize existing discrete graph neural networks (GNNs) by introducing continuous dynamics. They typically draw inspiration from diffusion-based methods to introduce a novel propagation scheme, which is analyzed using ordinary differential equations (ODE). However, the implementation of CGNNs requires significant computational power, making them challenging to deploy on battery-powered devices. Inspired by recent spiking neural networks (SNNs), which emulate a biological inference process and provide an energy-efficient neural architecture, we incorporate the SNNs with CGNNs in a unified framework, named Continuous Spiking Graph Neural Networks (COS-GNN). We employ SNNs for graph node representation at each time step, which are further integrated into the ODE process along with time. To enhance information preservation and mitigate information loss in SNNs, we introduce the high-order structure of COS-GNN, which utilizes the second-order ODE for spiking representation and continuous propagation. Moreover, we provide the theoretical proof that COS-GNN effectively mitigates the issues of exploding and vanishing gradients, enabling us to capture long-range dependencies between nodes. Experimental results on graph-based learning tasks demonstrate the effectiveness of the proposed COS-GNN over competitive baselines.

cs.NE↗
arXiv2026

Emergent Intelligence: Resonant Oscillators Produce Proactive Adaptive Behavior

Most artificial neural systems are built to map given inputs to outputs. Adaptive agents face a prior problem: they must act without enough evidence, seek encounters with the world, and revise behavior when evidence appears. We propose another starting point for intelligent neural networks: proactive search without signals, curiosity at its most basic. We ask whether it can come from a minimal untrained circuit. The spiking unit studied here inverts its response to input: with no signal in its window it fires faster; once signals arrive it switches to a slower, inverted regime. Search needs three or more such oscillators in counter-phase, each reading the same input in a different time window. With no training, supervision, parameter tuning, or controller, the composite switches on its own between exploratory spiral search and exploitative tracking, finding both first-degree symmetry and second-degree groups. The switch comes from temporal disagreement between its fast and slow readings of the same signal. We view the circuit as evolutionarily trained: its abilities come from structure, not experience. Ablation over 63 configurations and 63,000 trials shows the switch needs both temporal staggering and counter-phase opposition, neither enough alone: the behavior is emergent, not programmed. The spiral persists at zero rotational diffusion, so it is structural, and degrades gently under perturbation. More oscillators improve spiral regularity but cut resource capture, so the smallest sufficient circuit wins. We propose that this principle underlies search in simple organisms, navigation and decisions in complex ones, and, being so simple and common, goes unnoticed unless you strip the logic bare. Eventually, networks of such proactive primitives may offer another foundation for AI architectures that explore our world rather than merely predict the next symbol in a sequence.

cs.NE↗
arXiv2026

A Confidence-Driven Evolutionary Algorithm for Noisy Optimization with Joint Chance Constraints

Many real-world optimization problems involve noisy objective evaluations and probabilistic constraints, particularly in the form of joint chance constraints, which are computationally expensive to evaluate. In this work, we propose CR-EA-C, a confidence-driven evolutionary algorithm for solving noisy black-box optimization problems under joint chance constraints. CR-EA-C introduces three key components: (1) analytical feasibility estimation for joint chance constraints, (2) a pairwise statistical ranking mechanism for robust comparison under noise, and (3) a modified infeasibility-driven survival strategy to accelerate convergence. These components enable statistically reliable decision-making while improving the efficiency of function evaluations. The proposed method is evaluated against four recent metaheuristic algorithms under various uncertainty distributions. Furthermore, its practical effectiveness is also assessed on two additional real-world optimization problems and compared with conventional static sampling methods. Experimental results show that CR-EA-C consistently satisfies the prescribed joint chance constraints while achieving competitive objective values overall. This demonstrates that CR-EA-C is an effective general-purpose approach for noisy optimization.

cs.NE↗