概述
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.
付诸实践
为什么这很重要
- 更清晰的判决. 它可以帮助您将清晰的技术声明与营销语言分开。
- 成本与预算. 在花费金钱或时间之前，您可以提出更好的实施问题。
- 团队与工作流程. 具有共同理解的团队可以做出更好的产品、政策和学习决策。
留意
- 不同的团队可能会以不同的方式使用同一术语，因此请尽早定义范围。
- 基准测试可能看起来很强大，但实际性能却参差不齐。
- 忽视数据质量和评估计划通常会产生脆弱的结果。
后续步骤
- 从您需要的结果的简单语言定义开始。
- 在测试之前选择一种成功指标和一种失败条件。
- 使用代表性数据运行小型试点，而不是完善的演示集。
- 记录彩票假设在哪些方面有帮助以及在哪些方面更简单的方法更好。
不断探索
常见问题
What is Lottery Ticket Hypothesis?
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.
这个假设中的“中奖彩票”是什么？
中奖彩票是一个小型子网络，当独立于相同的初始权重进行训练时，它可以达到与密集网络相当的准确性。
In the original lottery-ticket experiments, what was paired with the discovered sparse mask when retraining a ticket?
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) 和迈克尔·卡宾 (Michael Carbin) 在 2018 年麻省理工学院的论文中介绍了这一假设。
Which procedure did the original Lottery Ticket Hypothesis paper use to identify winning tickets?
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.
How should the idea that overparameterization helps optimization find a trainable sparse structure be described?
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.