Research map / Learning theory and algorithms / Sample complexity
Shallow and Deep Networks are Near-Optimal Approximators of Korobov Functions
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
- Why Deep Neural Networks for Function Approximation? (ICLR 2017 · similarity 0.90)
- Towards Lower Bounds on the Depth of ReLU Neural Networks (NeurIPS 2021 · similarity 0.89)
- ReLU Network with Width $d+\mathcal{O}(1)$ Can Achieve Optimal Approximation Rate (ICML 2024 · similarity 0.89)
- Characterizing ResNet's Universal Approximation Capability (ICML 2024 · similarity 0.88)
- Universal Consistency of Wide and Deep ReLU Neural Networks and Minimax Optimal Convergence Rates for Kolmogorov-Donoho Optimal Function Classes (ICML 2024 · similarity 0.87)
- Minimum width for universal approximation using ReLU networks on compact domain (ICLR 2024 · 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.