Research map / Learning theory and algorithms / Sample complexity
On the Role of Noise in the Sample Complexity of Learning Recurrent Neural Networks: Exponential Gaps for Long Sequences
Alireza Fathollah Pour, Hassan Ashtiani
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
- Improved Sample Complexity for Multiclass PAC Learning (NeurIPS 2024 · similarity 0.86)
- Algorithms and SQ Lower Bounds for Robustly Learning Real-valued Multi-Index Models (NeurIPS 2025 · similarity 0.86)
- When Do Transformers Outperform Feedforward and Recurrent Networks? A Statistical Perspective (NeurIPS 2025 · similarity 0.85)
- The Cost of Robustness: Tighter Bounds on Parameter Complexity for Robust Memorization in ReLU Nets (NeurIPS 2025 · similarity 0.85)
- Optimal Sample Complexity of Contrastive Learning (ICLR 2024 · similarity 0.85)
- Improved Sample Complexity Bounds for Diffusion Model Training (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.
