An Approximation Algorithm for Optimal Subarchitecture Extraction

10/16/2020
by   Adrian de Wynter, et al.
0

We consider the problem of finding the set of architectural parameters for a chosen deep neural network which is optimal under three metrics: parameter size, inference speed, and error rate. In this paper we state the problem formally, and present an approximation algorithm that, for a large subset of instances behaves like an FPTAS with an approximation error of ρ≤ |1- ϵ|, and that runs in O(|Ξ| + |W^*_T|(1 + |Θ||B||Ξ|/(ϵ s^3/2))) steps, where ϵ and s are input parameters; |B| is the batch size; |W^*_T| denotes the cardinality of the largest weight set assignment; and |Ξ| and |Θ| are the cardinalities of the candidate architecture and hyperparameter spaces, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2019

On ultrametric 1-median selection

Consider the problem of finding a point in an ultrametric space with the...
research
06/07/2005

An Efficient Approximation Algorithm for Point Pattern Matching Under Noise

Point pattern matching problems are of fundamental importance in various...
research
06/11/2019

Almost Optimal Semi-streaming Maximization for k-Extendible Systems

In this paper we consider the problem of finding a maximum weight set su...
research
05/12/2021

Breaking O(nr) for Matroid Intersection

We present algorithms that break the Õ(nr)-independence-query bound for ...
research
11/08/2019

On the Complexity of BWT-runs Minimization via Alphabet Reordering

We present the first set of results on the computational complexity of m...
research
03/30/2021

Approximation algorithm for finding short synchronizing words in weighted automata

In this paper we are dealing with the issue of finding possibly short sy...
research
09/21/2023

Optimal Conditional Inference in Adaptive Experiments

We study batched bandit experiments and consider the problem of inferenc...

Please sign up or login with your details

Forgot password? Click here to reset