about
Logarithmic Pruning Is All You Need (arxiv.org)
1 point by che_shr_cat on Jul 10, 2020 | hide | past | pdf | discuss on HN

In plain words: A proof shows a big neural network, at random start and without training, contains a small subnetwork matching the trained network's accuracy. Unlike the earlier proof, it drops the strongest assumptions and needs only a very slow, logarithmic blow-up in neurons per target weight.

Abstract · Logarithmic Pruning is All You Need

The Lottery Ticket Hypothesis is a conjecture that every large neural network contains a subnetwork that, when trained in isolation, achieves comparable performance to the large network. An even stronger conjecture has been proven recently: Every sufficiently overparameterized network contains a subnetwork that, at random initialization, but without training, achieves comparable accuracy to the trained large network. This latter result, however, relies on a number of strong assumptions and guarantees a polynomial factor on the size of the large network compared to the target function. In this work, we remove the most limiting assumptions of this previous work while providing significantly tighter bounds:the overparameterized network only needs a logarithmic factor (in all variables but depth) number of neurons per weight of the target subnetwork.

Laurent Orseau, Marcus Hutter, Omar Rivasplata
arXiv:2006.12156 · cs.LG, stat.ML · submitted Jun 22, 2020 · updated Oct 25, 2020
abstract · pdf · html · NeurIPS 2020

add comment on HN