Papers › An Approximation Algorithm for Optimal Subarchitecture Extraction
An Approximation Algorithm for Optimal Subarchitecture Extraction
Adrian de Wynter
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections