Research map / Learning theory and algorithms / Sample complexity
Optimal Lottery Tickets via Subset Sum: Logarithmic Over-Parameterization is Sufficient
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- On the Sparsity of the Strong Lottery Ticket Hypothesis (NeurIPS 2024 · similarity 0.94)
- Logarithmic Pruning is All You Need (NeurIPS 2020 · similarity 0.93)
- Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets (NeurIPS 2023 · similarity 0.92)
- Most Activation Functions Can Win the Lottery Without Excessive Depth (NeurIPS 2022 · similarity 0.92)
- Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Sparse Neural Networks (NeurIPS 2021 · similarity 0.91)
- Find A Winning Sign: Sign Is All We Need to Win the Lottery (ICLR 2025 · similarity 0.90)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.