Learning Time/Memory-Efficient Deep Architectures with Budgeted Super Networks
Not on the map. Why?
Abstract (arXiv)
We propose to focus on the problem of discovering neural network architectures efficient in terms of both prediction quality and cost. For instance, our approach is able to solve the following tasks: learn a neural network able to predict well in less than 100 milliseconds or learn an efficient model that fits in a 50 Mb memory. Our contribution is a novel family of models called Budgeted Super Networks (BSN). They are learned using gradient descent techniques applied on a budgeted learning objective function which integrates a maximum authorized cost, while making no assumption on the nature of this cost. We present a set of experiments on computer vision problems and analyze the ability of our technique to deal with three different costs: the computation cost, the memory consumption cost and a distributed computation cost. We particularly show that our model can discover neural network architectures that have a better accuracy than the ResNet and Convolutional Neural Fabrics architectures on CIFAR-10 and CIFAR-100, at a lower cost.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 May 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 1.
4 papers.
- 2023Learning Computational Efficient Bots with Costly Featurescited by 2
- 2021GPNAS: A Neural Network Architecture Search Framework Based on Graphical Predictorcited by 0
- 2021BraidNet: procedural generation of neural networks for image classification problems using braid theorycited by 0
- 2022Braid-based architecture searchcited by 0
- 2023Learning Computational Efficient Bots with Costly Features18 Aug 2023
- 2022Braid-based architecture search8 Jul 2022
- 2021BraidNet: procedural generation of neural networks for image classification problems using braid theory20 Apr 2021
- 2021GPNAS: A Neural Network Architecture Search Framework Based on Graphical Predictor19 Mar 2021