Research map / Learning theory and algorithms / Sample complexity
Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks
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
- New Complexity-Theoretic Frontiers of Tractability for Neural Network Training (NeurIPS 2023 · similarity 0.91)
- On the Universal Approximability and Complexity Bounds of Quantized ReLU Neural Networks (ICLR 2019 · similarity 0.91)
- Training Neural Networks is NP-Hard in Fixed Dimension (NeurIPS 2023 · similarity 0.91)
- On the Hardness of Training Deep Neural Networks Discretely (AAAI 2025 · similarity 0.88)
- The Cost of Robustness: Tighter Bounds on Parameter Complexity for Robust Memorization in ReLU Nets (NeurIPS 2025 · similarity 0.87)
- On the Local Complexity of Linear Regions in Deep ReLU Networks (ICML 2025 · similarity 0.87)
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.