Pith. sign in

REVIEW 1 cited by

Neural Architecture Search via Bregman Iterations

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 2106.02479 v1 pith:NUQQC5SN submitted 2021-06-04 cs.LG cs.NEmath.OC

Neural Architecture Search via Bregman Iterations

classification cs.LG cs.NEmath.OC
keywords architectureneuralsearchbregmaniterationsnetworkspaceadding
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We propose a novel strategy for Neural Architecture Search (NAS) based on Bregman iterations. Starting from a sparse neural network our gradient-based one-shot algorithm gradually adds relevant parameters in an inverse scale space manner. This allows the network to choose the best architecture in the search space which makes it well-designed for a given task, e.g., by adding neurons or skip connections. We demonstrate that using our approach one can unveil, for instance, residual autoencoders for denoising, deblurring, and classification tasks. Code is available at https://github.com/TimRoith/BregmanLearning.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. OCTANE -- Optimal Control for Tensor-based Autoencoder Network Emergence: Explicit Case

    math.OC 2025-09 conditional novelty 4.0

    Autoencoders as continuous-time optimal control problems solved with rank-adaptive tensor compression, yielding memory savings and automatic layer-width profiles on MNIST denoising and deblurring.