Research map / Learning theory and algorithms / Sample complexity
Optimal approximation using complex-valued 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
- Shallow and Deep Networks are Near-Optimal Approximators of Korobov Functions (ICLR 2022 · similarity 0.88)
- Complex-valued Neurons Can Learn More but Slower than Real-valued Neurons via Gradient Descent (NeurIPS 2023 · similarity 0.86)
- Rational neural networks (NeurIPS 2020 · similarity 0.86)
- Why Deep Neural Networks for Function Approximation? (ICLR 2017 · similarity 0.86)
- Characterizing ResNet's Universal Approximation Capability (ICML 2024 · similarity 0.85)
- ReLU Network with Width $d+\mathcal{O}(1)$ Can Achieve Optimal Approximation Rate (ICML 2024 · similarity 0.84)
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.