AMABWIRIZA Yibanze

Tike ya Tombora 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.

Umva iki gitaboAI-byavuzwe · ~2 min

Kuriyi page2 min soma
  1. Incamake
  2. Kwibira cyane
  3. Gushyira mu bikorwa Isi
  4. Kazoza ka Tike ya Tombora Hypothesis
  5. Kubishyira mubikorwa
  6. Komeza Ubushakashatsi
  7. Ibibazo bikunze kubazwa

Incamake

The original experiments support this in tested settings, rather than guaranteeing a compact ticket for every model or task.

Kwibira cyane

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.

Gushyira mu bikorwa Isi

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

Kazoza ka Tike ya Tombora Hypothesis

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.

Kubishyira mubikorwa

Impamvu ari ngombwa

  • Ibyemezo bisobanutse. Iragufasha gutandukanya ibyifuzo bya tekiniki bisobanutse nururimi rwo kwamamaza.
  • Igiciro na bije. Urashobora kubaza ibibazo byiza byo gushyira mubikorwa mbere yo gukoresha amafaranga cyangwa igihe.
  • Itsinda hamwe nakazi. Amakipe asangiye ibitekerezo akora ibicuruzwa byiza, politiki, nibyemezo byo kwiga.

Witondere

  • Amakipe atandukanye arashobora gukoresha ijambo rimwe muburyo butandukanye, sobanura intera hakiri kare.
  • Ibipimo birashobora kugaragara bikomeye mugihe imikorere-yisi-itaringaniye.
  • Kwirengagiza ubuziranenge bwamakuru na gahunda yo gusuzuma akenshi bitanga ibisubizo byoroshye.

Intambwe ikurikira

  1. Tangira nururimi rusobanutse rwibisubizo ukeneye.
  2. Toranya intsinzi imwe hamwe nuburyo bumwe bwo gutsindwa mbere yo kwipimisha.
  3. Koresha umuderevu muto hamwe namakuru ahagarariye, ntabwo ari demo yashizweho.
  4. Inyandiko aho Tombora ya Tike ya Hypothesis ifasha nuburyo bworoshye bworoshye.

Komeza Ubushakashatsi

Ibaruwa y'amakuru y'ubuntu

Ibuka amakuru ya buri munsi ya AI

Inkuru eshatu zizewe za AI buri gitondo cy'iminsi y'akazi, zanditse mu rurimi rworoshye. Ubuntu iteka ryose, nta kwamamaza.

Imeri imwe buri munsi y'akazi. Kwiyimura mu buryo bumwe. Ntitwigera tugurisha cyangwa ngo dusangire aderesi yawe.

Isuzume

Take the Lottery Ticket Hypothesis quiz

Ibisubizo ako kanya kuri buri kibazo, n'icyemezo gishobora gusangirwa gifite ID yagenzurwa umaze gutsinda isomo.

Tangira ikibazo

Fasha uburezi bwa AI bw'ubuntu. AI Understanding ni umuryango utegamiye kuri leta wa 501(c)(3) — nta kwamamaza, nta kwishyura, iteka ryose. Tanga impano

Ibibazo bikunze kubazwa

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.

Niki 'itike yatsindiye' muriyi hypothesis?

Itike yatsindiye ni subnetwork ntoya, iyo itojwe kwigunga kuva muburemere bumwe bwambere, igera kubwukuri ugereranije numuyoboro wuzuye.

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.

Ninde wasabye Hypothesis ya Tike ya Tombora?

Jonathan Frankle na Michael Carbin berekanye hypothesis mu mpapuro zabo za MIT 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.