惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

G
Google Developers Blog
博客园 - 司徒正美
Last Week in AI
Last Week in AI
Recent Announcements
Recent Announcements
Y
Y Combinator Blog
博客园 - 聂微东
M
MIT News - Artificial intelligence
博客园_首页
Jina AI
Jina AI
博客园 - 叶小钗
酷 壳 – CoolShell
酷 壳 – CoolShell
H
Hackread – Cybersecurity News, Data Breaches, AI and More
J
Java Code Geeks
F
Fortinet All Blogs
aimingoo的专栏
aimingoo的专栏
小众软件
小众软件
Vercel News
Vercel News
The Cloudflare Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
云风的 BLOG
云风的 BLOG
N
Netflix TechBlog - Medium
B
Blog
Google DeepMind News
Google DeepMind News
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More

JMLR

Transformers Can Overcome the Curse of Dimensionality: A Theoretical Study from an Approximation Perspective Online Bernstein-von Mises theorem Covariate-dependent Hierarchical Dirichlet Processes DCatalyst: A Unified Accelerated Framework for Decentralized Optimization Boosted Control Functions: Distribution Generalization and Invariance in Confounded Models Contrasting Local and Global Modeling with Machine Learning and Satellite Data: A Case Study Estimating Tree Canopy Height in African Savannas A Symplectic Analysis of Alternating Mirror Descent Two-way Node Popularity Model for Directed and Bipartite Networks Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization Bayesian Inference of Contextual Bandit Policies via Empirical Likelihood A causal fused lasso for interpretable heterogeneous treatment effects estimation Unsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization Reparameterized Complex-valued Neurons Can Efficiently Learn More than Real-valued Neurons via Gradient Descent Hierarchical Causal Models Optimizing Attention with Mirror Descent: Generalized Max-Margin Token Selection Adaptive Forward Stepwise: A Method for High Sparsity Regression Optimization and Generalization of Gradient Descent for Shallow ReLU Networks with Minimal Width Finite Neural Networks as Mixtures of Gaussian Processes: From Provable Error Bounds to Prior Selection CHANI: Correlation-based Hawkes Aggregation of Neurons with bio-Inspiration Persistence Diagrams Estimation of Multivariate Piecewise Hölder-continuous Signals Exploring Novel Uncertainty Quantification through Forward Intensity Function Modeling Generative Bayesian Inference with GANs Communication-efficient Distributed Statistical Inference for Massive Data with Heterogeneous Auxiliary Information Decorrelated Local Linear Estimator: Inference for Non-linear Effects in High-dimensional Additive Models Refined Risk Bounds for Unbounded Losses via Transductive Priors A Common Interface for Automatic Differentiation LazyDINO: Fast, Scalable, and Efficiently Amortized Bayesian Inversion via Structure-Exploiting and Surrogate-Driven Measure Transport The Distribution of Ridgeless Least Squares Interpolators Nonparametric Estimation of a Factorizable Density using Diffusion Models Learning Bayesian Network Classifiers to Minimize Class Variable Parameters
Nonlocal Techniques for the Analysis of Deep ReLU Neural ...
Cornelia Sch · 2026-01-01 · via JMLR

Cornelia Schneider, Mario Ullrich, Jan Vybíral; 27(11):1−41, 2026.

Abstract

In recent work concerned with the approximation and expressive powers of deep neural networks, Daubechies, DeVore, Foucart, Hanin, and Petrova introduced a system of piecewise linear functions, which can be easily reproduced by artificial neural networks with the ReLU activation function, and showed that it forms a Riesz basis of $L_2([0, 1])$. Their work was subsequently generalized to the multivariate setting by Schneider and Vybíral. In the work at hand, we show that this system serves as a Riesz basis also for Sobolev spaces $W^s([0,1]^d)$ and Barron classes ${\mathbb B}^s([0,1]^d)$ with smoothness $0\lt s\lt 1$. We apply this fact to re-prove some recent results on the approximation of functions from these classes by deep neural networks. Our proof method avoids using local approximations and also allows us to track the implicit constants as well as to show that we can avoid the curse of dimension. Moreover, we also study how well one can approximate Sobolev and Barron functions by neural networks if only function values are known.

[abs][pdf][bib]