2020/06/04 by Sébastien Bubeck, Bubeck, Sébastien, Ronen Eldan +5
Computer Science · #FOS: Computer and information sciences #Face and Expression Recognition #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Machine Learning and ELM #Neural Networks and Applications
paper · pdf · doi:10.48550/arxiv.2006.02855
openalex publication_date 2020/06/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In 1988, Eric B. Baum showed that two-layers neural networks with threshold activation function can perfectly memorize the binary labels of n points in general position in ℝd using only \ulcorner n/d \urcorner neurons. We observe that with ReLU networks, using four times as many neurons one can fit arbitrary real labels. Moreover, for approximate memorization up to error ε, the neural tangent kernel can also memorize with only O((n)/(d) ⋅ log(1/ε) ) neurons (assuming that the data is well dispersed too). We show however that these constructions give rise to networks where the magnitude of the neurons' weights are far from optimal. In contrast we propose a new training procedure for ReLU networks, based on complex (as opposed to real) recombination of the neurons, for which we show approximate memorization with both O((n)/(d) ⋅ \fraclog(1/ε)ε) neurons, as well as nearly-optimal size of the weights.