The Lottery Ticket Hypothesis

Frankle, J., & Carbin, M. (2019). The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks. Proceedings of ICLR 2019.

Type

Preprint

Intellectual base

Grey literature

Year

2019

Link

https://arxiv.org/abs/1803.03635

Cited from

cognitive_science

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Pruning
  • Machine learning — magnitude and structured pruning, the lottery-ticket hypothesis, model compression; cost-complexity pruning in decision trees; alpha-beta and branch-and-bound pruning in search.

    This sourceShows a high-performing sparse subnetwork can be found only after training the dense over-parameterized network, then pruning.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:1ca178e87059 · see in the full table