À suivreGuide suivant
AI Kitchen Display Systems and Ticket Timing
Secteurs
GUIDE des fondamentaux
The Lottery Ticket Hypothesis proposes that some large, randomly initialized neural networks contain sparse subnetworks that can train in isolation from their matched initial weights to reach accuracy comparable to the dense model.
Écoutez ce guideNarré par l'IA · ~2 min
The original experiments support this in tested settings, rather than guaranteeing a compact ticket for every model or task.
Jonathan Frankle and Michael Carbin introduced the Lottery Ticket Hypothesis in 2018. In experiments on fully connected and convolutional networks for MNIST and CIFAR-10, they found sparse subnetworks that, when trained in isolation from their original initialization, reached test accuracy comparable to the dense network in a similar number of iterations. Their reported tickets were less than 10–20% of the original model size in those settings; this is an empirical result, not a general compression guarantee. Their iterative magnitude pruning procedure trains a network, removes weights with small magnitudes, restores surviving weights to their initial values, and repeats. Later work studied rewinding to an early training checkpoint. Randomly reinitializing a found mask can reduce the benefit observed in the original experiments. The broader suggestion that dense overparameterization helps optimization discover these sparse subnetworks is a conjecture about the mechanism, not a separate result established by the original experiments.
Testing whether a sparse subnetwork can retain a dense model’s accuracy on a specified dataset and architecture
Comparing iterative pruning and weight rewinding with training a sparse model from a fresh random initialization
Studying how discovered tickets transfer between related datasets or model architectures
Evaluating whether sparse models reduce storage or inference cost on a target device
Lottery-ticket research asks when sparse subnetworks can be found cheaply, whether they transfer across tasks, and how pruning affects training and inference costs. A separate strong lottery-ticket line studies whether a sufficiently overparameterized random network contains a subnetwork that approximates a target network without further weight training; this is a distinct theoretical claim and not a guarantee about every practical model.
Newsletter gratuite
Trois histoires d'IA vérifiées chaque matin de la semaine, écrites dans un anglais simple. Gratuit pour toujours, sans publicité.
Un e-mail chaque jour de la semaine. Désabonnez-vous en un clic. Nous ne vendons ni ne partageons jamais votre adresse.
Testez-vous
Commentaires instantanés sur chaque réponse et un certificat partageable avec une pièce d'identité vérifiable une fois que vous avez réussi un cours.
Soutenez l’enseignement gratuit de l’IA. AI Understanding est une organisation à but non lucratif 501(c)(3) : pas de publicité, pas de paywall, jamais. Faire un don
The Lottery Ticket Hypothesis proposes that some large, randomly initialized neural networks contain sparse subnetworks that can train in isolation from their matched initial weights to reach accuracy comparable to the dense model. The original experiments support this in tested settings, rather than guaranteeing a compact ticket for every model or task.
Un ticket gagnant est un petit sous-réseau qui, lorsqu’il est formé indépendamment des mêmes poids initiaux, atteint une précision comparable à celle du réseau dense.
The original method paired a discovered pruning mask with the surviving weights reset to their original initialization; later work also studied early-checkpoint rewinding.
Jonathan Frankle et Michael Carbin ont présenté l'hypothèse dans leur article du MIT de 2018.
The original procedure iteratively pruned low-magnitude weights and reset the surviving weights to their original initialization before retraining; early-checkpoint rewinding was studied later.
The original experiments identify winning tickets in tested settings; the claim that dense overparameterization helps the search for them is a conjecture about why the phenomenon occurs.
Continuez à apprendre
Plus de guides sélectionnés pour ce sujet
À suivreGuide suivant
AI Kitchen Display Systems and Ticket Timing
Secteurs