arXiv Machine Learning August 14, 2026 By Saveliy Baturin

From Approximation Rates to Loss-Landscape Barrier Decay in Shallow ReLU Networks

Read the original on arXiv Machine Learning →

arXiv:2602. 17596v2 Announce Type: replace Abstract: We study pathwise connectivity of sublevel sets for one-hidden-layer ReLU networks with constrained first-layer weights and an $\ell_1$ penalty on the output layer.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Aug 26

Every Layer Counts: An Exponential $L_2$ Depth Hierarchy for ReLU Networks

arXiv:2608.23877v1 Announce Type: new Abstract: We prove a depth hierarchy for ReLU neural networks in which every additional ReLU layer can save exponentially many neurons. For every $\ell\geq 3$, a...

By Itay Safran

arXiv Machine Learning

Sep 23

Optimal Tradeoffs Between Network Size and Parameter Magnitude in Neural Approximation and Minimax Regression

arXiv:2609. 25710v1 Announce Type: cross Abstract: The statistical accuracy of neural networks depends on both their approximation power and the complexity of the class fitted from data.

By Baicheng Li, Zuowei Shen, Haizhao Yang, Shijun Zhang

llms

arXiv Machine Learning

Sep 11

Configuration-Dependent Lower Bounds for Approximation by Shallow ReLU$^k$ Networks on the Sphere

arXiv:2510. 04060v3 Announce Type: replace-cross Abstract: We establish two related but logically distinct results for shallow ReLU$^k$ neural networks on the unit sphere $\SS^d$.

By Tong Mao, Jinchao Xu

arXiv Machine Learning

Sep 10

Nearly Tight Rademacher Bounds for Sparsely Activated Neural Networks

arXiv:2609.09130v1 Announce Type: new Abstract: An input may activate few hidden units even when different inputs collectively use an entire network. We study the statistical complexity of this input...

By Xiaoyu Li, Zhizhou Sha, Jiaojiao Jiang, Junbin Gao, Andi Han

efficiency safety

arXiv Machine Learning

Jul 21

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy

arXiv:2607. 16676v1 Announce Type: cross Abstract: How deep does a graph neural network need to be on a sparse graph?

By Aseem Raj Baranwal

Hugging Face Trending Papers

Sep 8

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.

efficiency safety

One email a morning, machine-written

Related stories

Every Layer Counts: An Exponential $L_2$ Depth Hierarchy for ReLU Networks

Optimal Tradeoffs Between Network Size and Parameter Magnitude in Neural Approximation and Minimax Regression

Configuration-Dependent Lower Bounds for Approximation by Shallow ReLU$^k$ Networks on the Sphere

Nearly Tight Rademacher Bounds for Sparsely Activated Neural Networks

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy

Nearly Tight Rademacher Bounds for Sparsely Activated Neural Networks