Research map / Learning theory and algorithms / Kernels and regression theory
Nearly Optimal VC-Dimension and Pseudo-Dimension Bounds for Deep Neural Network Derivatives
Yahong Yang, Haizhao Yang, Yang Xiang
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
- Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks (JMLR 2019 · similarity 0.89)
- Dimension Reduction for Derivative-Informed Operator Learning: An Analysis of Approximation Errors (JMLR 2026 · similarity 0.88)
- Deeper or Wider: A Perspective from Optimal Generalization Error with Sobolev Loss (ICML 2024 · similarity 0.88)
- Sharper Guarantees for Learning Neural Network Classifiers with Gradient Methods (ICLR 2025 · similarity 0.86)
- Optimal deep learning of holomorphic operators between Banach spaces (NeurIPS 2024 · similarity 0.86)
- Stable Minima of ReLU Neural Networks Suffer from the Curse of Dimensionality: The Neural Shattering Phenomenon (NeurIPS 2025 · 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.
