Research map / Learning theory and algorithms / Sample complexity
Hardness of Noise-Free Learning for Two-Hidden-Layer 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
- Superpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient Descent (ICML 2020 · similarity 0.89)
- Algorithms and SQ Lower Bounds for Robustly Learning Real-valued Multi-Index Models (NeurIPS 2025 · similarity 0.88)
- Efficiently Learning One Hidden Layer ReLU Networks From Queries (NeurIPS 2021 · similarity 0.88)
- Depth-Bounds for Neural Networks via the Braid Arrangement (NeurIPS 2025 · similarity 0.86)
- Convex Approximation of Two-Layer ReLU Networks for Hidden State Differential Privacy (NeurIPS 2025 · similarity 0.86)
- Benign overfitting in leaky ReLU networks with moderate input dimension (NeurIPS 2024 · similarity 0.85)
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.