A new formalism for function approximation is used to argue that no search procedure can achieve zero error on all functions and that neural architecture search might match exhaustive search only under unstated conditions.
IEEE Transactions on Evolutionary Computation 9, 721–735 (2005)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On the Bounds of Function Approximations
A new formalism for function approximation is used to argue that no search procedure can achieve zero error on all functions and that neural architecture search might match exhaustive search only under unstated conditions.