Lottery Ticket Hypothesis
Version 1.0.0 · Updated 2026-07-31
CORE DEFINITION
A hypothesis proposed by Jonathan Frankle and Michael Carbin, suggesting that within a randomly initialized neural network, there exists a sparse subnetwork (the "winning ticket") that, when trained in isolation, can achieve performance comparable to the full network. This subnetwork has a special initial weight configuration from the start.
SCAFFOLDING EFFECT
Reduce cognitive load
Explanation of network sparsity. It provides a new perspective for understanding the training dynamics and generalization ability of neural networks, revealing the "lucky" initial configurations that exist in networks, and has important implications for model compression and efficient training.
Anchor fast decisions
The hypothesis posits that within a randomly initialized neural network, there exists a sparse subnetwork (the "winning ticket") that, when trained in isolation with its initial weights, can achieve performance comparable to the full network, indicating that large models contain discoverable "efficient substructures".
MINIMUM ACTION
In progress 0/4Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Lottery_ticket_hypothesisverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS