Research map / Architectures and efficiency / Pruning and efficient tuning
Peek-a-Boo: What (More) is Disguised in a Randomly Weighted Neural Network, and How to Find It Efficiently
Xiaohan Chen, Jason Zhang, Zhangyang Wang
Read the paperCheck your idea against 137,217 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
- Training Your Sparse Neural Network Better with Any Mask (ICML 2022 · similarity 0.87)
- What's Hidden in a Randomly Weighted Neural Network? (CVPR 2020 · similarity 0.87)
- The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training (ICLR 2022 · similarity 0.87)
- Why Random Pruning Is All We Need to Start Sparse (ICML 2023 · similarity 0.87)
- No Free Prune: Information-Theoretic Barriers to Pruning at Initialization (ICML 2024 · similarity 0.85)
- Sparse Cocktail: Every Sparse Pattern Every Sparse Ratio All At Once (ICML 2024 · similarity 0.84)
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.
