arXiv (All)
open access
Configuration-Dependent Lower Bounds for Approximation by Shallow ReLU$^k$ Networks on the Sphere
We establish two related but logically distinct results for shallow ReLU$^k$ neural networks on the unit sphere $\SS^d$. First, for an arbitrary set of inner neural-network parameters, the best $\mathcal{L}^2(\SS^d)$ approximation of a fixed target function with smoothness $r>\tfrac{d+2k+1}{2}$ admi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Towards Lower Bounds on the Depth of ReLU Neural Networks#19806
- Optimization of randomized neural networks for transfer operator approximation#222596
- Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method#819326
- Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method#809333
- DATA-DRIVEN AND CONSTRAINED APPROACHES TO LEARNING AND ENFORCING SYMMETRY IN NEURAL NETWORKS#929419
Record · ID 998028
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive