Research map / Learning theory and algorithms / Sample complexity
Computational Complexity of Learning Neural Networks: Smoothness and Degeneracy
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
- Hardness of Learning Neural Networks with Natural Weights (NeurIPS 2020 · similarity 0.91)
- On the Hardness of Training Deep Neural Networks Discretely (AAAI 2025 · similarity 0.90)
- On the Complexity of Learning Neural Networks (NeurIPS 2017 · similarity 0.88)
- Most Neural Networks Are Almost Learnable (NeurIPS 2023 · similarity 0.88)
- On the Local Complexity of Linear Regions in Deep ReLU Networks (ICML 2025 · similarity 0.87)
- Hardness of Learning Neural Networks under the Manifold Hypothesis (NeurIPS 2024 · similarity 0.86)
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.