paper-with-me

Papers

Sharp Bounds on the Approximation Rates, Metric Entropy, and $n$-widths of Shallow Neural Networks

2021-01-29 · Jonathan W. Siegel, Jinchao Xu

In this article, we study approximation properties of the variation spaces corresponding to shallow neural networks with a variety of activation functions. We introduce two main tools for estimating the metric entropy, approximation rates, and $n$-widths of these spaces. First, we introduce the notion of a smoothly parameterized dictionary and give upper bounds on the non-linear approximation rates, metric entropy and $n$-widths of their absolute convex hull. The upper bounds depend upon the order of smoothness of the parameterization. This result is applied to dictionaries of ridge functions corresponding to shallow neural networks, and they improve upon existing results in many cases. Next, we provide a method for lower bounding the metric entropy and $n$-widths of variation spaces which contain certain classes of ridge functions. This result gives sharp lower bounds on the $L^2$-approximation rates, metric entropy, and $n$-widths for variation spaces corresponding to neural networks with a range of important activation functions, including ReLU$^k$ activation functions and sigmoidal activation functions with bounded variation.

📄 PDF Abstract BibTeX arXiv:2101.12365

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Sharp Lower Bounds on the Approximation Rate of Shallow Neural Networks

2021-06-28 · Jonathan W. Siegel, Jinchao Xu

We consider the approximation rates of shallow neural networks with respect to the variation norm. Upper bounds on these rates have been established for sigmoidal and ReLU activation functions, but it has remained an imp…

Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds

2026-05-12 · Yunbei Xu, Yuzhe Yuan, Ruohan Zhan arxiv

We study the fundamental and timely problem of learning long sequences in autoregressive modeling and next-token prediction under model misspecification, measured by the joint Kullback--Leibler (KL) divergence. Our goal …

Metric Entropy-Free Sample Complexity Bounds for Sample Average Approximation in Convex Stochastic Programming

2024-01-01 · Hongcheng Liu, Jindong Tong

This paper studies sample average approximation (SAA) in solving convex or strongly convex stochastic programming (SP) problems. In estimating SAA's sample efficiency, the state-of-the-art sample complexity bounds entail…

On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization

2008-12-01 · NeurIPS 2008 12 · Sham M. Kakade, Karthik Sridharan, Ambuj Tewari

We provide sharp bounds for Rademacher and Gaussian complexities of (constrained) linear classes. These bounds make short work of providing a number of corollaries including: risk bounds for linear prediction (including …

Analyzing distortion riskmetrics and weighted entropy for unimodal and symmetric distributions under partial information constraints

2025-04-28 · Baishuai Zuo, Chuancun Yin

In this paper, we develop the lower and upper bounds of worst-case distortion riskmetrics and weighted entropy for unimodal, and symmetric unimodal distributions when mean and variance information are available. We also …