arXiv (All)
open access
Nearly Tight Rademacher Bounds for Sparsely Activated Neural Networks
An input may activate few hidden units even when different inputs collectively use an entire network. We study the statistical complexity of this input-dependent sparsity in the one-hidden-layer ReLU model of Awasthi et al. (COLT 2024). For width $s$, at most $k$ active units per input, and effectiv
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
- Riemannian Gradient Descent for Gaussian Mixture Models with unknown diagonal covariances#1078291
- On the $O(\frac{\sqrt{d}}{K^{1/4}})$ Convergence Rate of AdamW Measured by $\ell_1$ Norm#1117229
- Nonlinear Dynamics In Optimization Landscape of Shallow Neural Networks with Tunable Leaky ReLU#819261
- Nonlinear Dynamics In Optimization Landscape of Shallow Neural Networks with Tunable Leaky ReLU#809269
- On the Decompositionality of Neural Networks#2676
Record · ID 986729
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