Research map / Architectures and efficiency / RNNs and normalization
Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks
Peter L. Bartlett, Nick Harvey, Christopher Liaw, Abbas Mehrabian
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 Bounds on Neural Complexity for Representing Piecewise Linear Functions (NeurIPS 2022 · similarity 0.90)
- Understanding Deep Neural Networks with Rectified Linear Units (ICLR 2018 · similarity 0.89)
- Depth-Bounds for Neural Networks via the Braid Arrangement (NeurIPS 2025 · similarity 0.88)
- Minimum Width for Deep, Narrow MLP: A Diffeomorphism Approach (NeurIPS 2025 · similarity 0.87)
- Exact Upper and Lower Bounds for the Output Distribution of Neural Networks with Random Inputs (ICML 2025 · similarity 0.86)
- Sharper Guarantees for Learning Neural Network Classifiers with Gradient Methods (ICLR 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.
