Útmutatóhoz kapcsolódó kvíz · Közepes Szint
Sorsjegy-hipotézis kvíz
Check your understanding of lottery tickets, initialization, pruning, and the limits of claims about sparse neural networks.
kérdés 1 -ból 8
Mit jelent ebben a hipotézisben a „nyertes jegy”?
Tekintse meg az összes kérdést8 kérdéseket
A válaszok és magyarázatok megjelennek a kvíz kitöltésekor.
- Mit jelent ebben a hipotézisben a „nyertes jegy”?
- Ritka alhálózat, amely az eredeti kezdeti elemből kiképezve megfelel a teljes hálózatnak
- A szokásosnál több paraméterrel rendelkező hálózat
- Az internetről letöltött előképzett modell
- Hiperparaméterek véletlenszerűen kitalált halmaza
- In the original lottery-ticket experiments, what was paired with the discovered sparse mask when retraining a ticket?
- Fresh random values for every surviving weight
- The surviving weights’ matched original initialization
- A different architecture for each pruning round
- The final trained weights with no resetting
- Ki javasolta a sorsjegy-hipotézist?
- Goodfellow (2014)
- Krizhevsky, Sutskever, Hinton (2012)
- Frankle és Carbin (2018)
- Silver és munkatársai (2016)
- Which procedure did the original Lottery Ticket Hypothesis paper use to identify winning tickets?
- Randomly remove a fixed half of all weights once
- Iterative magnitude pruning with a reset to the original initialization
- Add dropout after each pruning round
- Increase the learning rate after every epoch
- How should the idea that overparameterization helps optimization find a trainable sparse structure be described?
- A conjecture or proposed explanation, not a result established by the original experiments
- A theorem proven for every neural-network architecture
- A guarantee that all weights can be removed without loss
- A claim that pruning eliminates the need for training data
- What does a strong lottery-ticket result claim in its theoretical setting?
- Every randomly initialized network already solves any task
- A sufficiently overparameterized randomly initialized network can contain a pruned subnetwork that approximates a target without further weight training
- Pruning always preserves the trained model’s accuracy
- A sparse network never needs data
- What does iterative magnitude pruning remove at each pruning step?
- The training examples with the lowest labels
- The neurons with the most outgoing connections
- Weights with the smallest magnitudes
- All weights in the final layer
- Which datasets were used in the original paper’s reported lottery-ticket experiments?
- ImageNet and COCO only
- LibriSpeech and Common Voice
- SQuAD and GLUE
- MNIST and CIFAR-10