Pith. sign in

REVIEW 3 cited by

MONAS: Multi-Objective Neural Architecture Search using Reinforcement Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1806.10332 v2 pith:I4XSGWLJ submitted 2018-06-27 cs.LG cs.AIstat.ML

MONAS: Multi-Objective Neural Architecture Search using Reinforcement Learning

classification cs.LG cs.AIstat.ML
keywords neuralarchitecturesaccuracymonaspowersearcharchitecturemulti-objective
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Recent studies on neural architecture search have shown that automatically designed neural networks perform as good as expert-crafted architectures. While most existing works aim at finding architectures that optimize the prediction accuracy, these architectures may have complexity and is therefore not suitable being deployed on certain computing environment (e.g., with limited power budgets). We propose MONAS, a framework for Multi-Objective Neural Architectural Search that employs reward functions considering both prediction accuracy and other important objectives (e.g., power consumption) when searching for neural network architectures. Experimental results showed that, compared to the state-ofthe-arts, models found by MONAS achieve comparable or better classification accuracy on computer vision applications, while satisfying the additional objectives such as peak power.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Mitigating Compiler Fusion-Induced Power Bursts in Mobile NPU Inference as the Battery Depletes

    cs.AR 2026-07 conditional novelty 6.0

    Compiler fusion in a mobile NPU creates current bursts that raise the DVFS-onset voltage; measurement-guided Q-DQ barrier insertion cuts peak current from 3.12 A to 1.94 A (38%) with 3.76% latency overhead.

  2. Bilevel Optimization for Neural Architecture Search

    cs.LG 2026-06 unverdicted novelty 3.0

    Reviews NAS methods through bilevel optimization lens, categorizing them into sampling-based and theory-based, and proposes an auxiliary math programming framework for more principled architecture and weight updates.

  3. Spiking Neural Network Architecture Search: A Survey

    cs.NE 2025-10 unverdicted novelty 2.0

    A survey of Spiking Neural Network architecture search techniques viewed through a hardware/software co-design lens.