Research map / Learning theory and algorithms / Sample complexity
Logarithmic Pruning is All You Need
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
- Optimal Lottery Tickets via Subset Sum: Logarithmic Over-Parameterization is Sufficient (NeurIPS 2020 · similarity 0.93)
- Proving the Lottery Ticket Hypothesis for Convolutional Neural Networks (ICLR 2022 · similarity 0.92)
- The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks (ICLR 2019 · similarity 0.91)
- On the Sparsity of the Strong Lottery Ticket Hypothesis (NeurIPS 2024 · similarity 0.91)
- Validating the Lottery Ticket Hypothesis with Inertial Manifold Theory (NeurIPS 2021 · similarity 0.91)
- Proving the Lottery Ticket Hypothesis: Pruning is All You Need (ICML 2020 · similarity 0.91)
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.