Research map / Learning theory and algorithms / Sample complexity
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training
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
- Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks (ICLR 2026 · similarity 0.91)
- Complexity of Neural Network Training and ETR: Extensions with Effectively Continuous Functions (AAAI 2024 · similarity 0.89)
- On the Hardness of Training Deep Neural Networks Discretely (AAAI 2025 · similarity 0.87)
- The Computational Complexity of Counting Linear Regions in ReLU Neural Networks (NeurIPS 2025 · similarity 0.86)
- Sharper Guarantees for Learning Neural Network Classifiers with Gradient Methods (ICLR 2025 · similarity 0.86)
- On the Local Complexity of Linear Regions in Deep ReLU Networks (ICML 2025 · 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.