English
Related papers

Related papers: Function values are enough for $L_2$-approximation

200 papers

Given an i.i.d. sample $X_1,...,X_n$ with common bounded density $f_0$ belonging to a Sobolev space of order $\alpha$ over the real line, estimation of the quadratic functional $\int_{\mathbb{R}}f_0^2(x) \mathrm{d}x$ is considered. It is…

Statistics Theory · Mathematics 2008-12-18 Evarist Giné , Richard Nickl

Many data-fitting applications require the solution of an optimization problem involving a sum of large number of functions of high dimensional parameter. Here, we consider the problem of minimizing a sum of $n$ functions over a convex…

Optimization and Control · Mathematics 2016-02-29 Farbod Roosta-Khorasani , Michael W. Mahoney

We study approximation of multivariate functions from a separable Hilbert space in the randomized setting with the error measured in the weighted $L_2$ norm. We consider algorithms that use standard information $\Lambda^{\rm std}$…

Numerical Analysis · Mathematics 2021-01-12 Wanting Lu , Heping Wang

This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…

Machine Learning · Statistics 2015-10-06 Alekh Agarwal , Leon Bottou

The sparse polynomial approximation of continuous functions has emerged as a prominent area of interest in function approximation theory in recent years. A key challenge within this domain is the accurate estimation of approximation errors.…

Numerical Analysis · Mathematics 2025-06-10 Renzhong Feng , Bowen Zhang

We consider linear approximation based on function evaluations in reproducing kernel Hilbert spaces of certain analytic weighted power series kernels and stationary kernels on the interval $[-1,1]$. Both classes contain the popular Gaussian…

Numerical Analysis · Mathematics 2025-10-03 Toni Karvonen , Yuya Suzuki

The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how…

Combinatorics · Mathematics 2017-11-23 Kai-Uwe Schmidt

In Bayesian statistics probability distributions express beliefs. However, for many problems the beliefs cannot be computed analytically and approximations of beliefs are needed. We seek a loss function that quantifies how "embarrassing" it…

Statistics Theory · Mathematics 2017-08-07 Reimar H. Leike , Torsten A. Enßlin

We investigate the rate of convergence of linear sampling numbers of the embedding $H^{\alpha,\beta} (\mathbb{T}^d) \hookrightarrow H^\gamma (\mathbb{T}^d)$. Here $\alpha$ governs the mixed smoothness and $\beta$ the isotropic smoothness in…

Numerical Analysis · Mathematics 2014-08-18 Glenn Byrenheid , Dinh Dũng , Winfried Sickel , Tino Ullrich

Let $A$ be a set and $V$ a real Hilbert space. Let $H$ be a real Hilbert space of functions $f:A\to V$ and assume $H$ is continuously embedded in the Banach space of bounded functions. For $i=1,\cdots,n$, let $(x_i,y_i)\in A\times V$…

Functional Analysis · Mathematics 2022-02-23 Karen Yeressian

We study the $\ell_1$-low rank approximation problem, where for a given $n \times d$ matrix $A$ and approximation factor $\alpha \geq 1$, the goal is to output a rank-$k$ matrix $\widehat{A}$ for which $$\|A-\widehat{A}\|_1 \leq \alpha…

Data Structures and Algorithms · Computer Science 2020-04-17 Zhao Song , David P. Woodruff , Peilin Zhong

We study the approximation of arbitrary distributions $P$ on $d$-dimensional space by distributions with log-concave density. Approximation means minimizing a Kullback--Leibler-type functional. We show that such an approximation exists if…

Statistics Theory · Mathematics 2011-10-17 Lutz Duembgen , Richard Samworth , Dominic Schuhmacher

Over the last decade, approximating functions in infinite dimensions from samples has gained increasing attention in computational science and engineering, especially in computational uncertainty quantification. This is primarily due to the…

Numerical Analysis · Mathematics 2023-10-18 Ben Adcock , Nick Dexter , Sebastian Moraga

In approximation of functions based on point values, least-squares methods provide more stability than interpolation, at the expense of increasing the sampling budget. We show that near-optimal approximation error can nevertheless be…

Numerical Analysis · Mathematics 2024-02-14 Abdellah Chkifa , Matthieu Dolbeault

We characterize the best $L_{2}$ approximation to a multivariate function by linear combinations of ridge functions multiplied by some fixed weight functions. In the special case when the weight functions are constants, we propose explicit…

Classical Analysis and ODEs · Mathematics 2007-08-27 Vugar Ismailov

In a previous paper [Adcock & Huybrechs, 2019] we described the numerical approximation of functions using redundant sets and frames. Redundancy in the function representation offers enormous flexibility compared to using a basis, but…

Numerical Analysis · Mathematics 2020-07-13 Ben Adcock , Daan Huybrechs

We propose a general methodology for the construction and analysis of minimax estimators for a wide class of functionals of finite dimensional parameters, and elaborate on the case of discrete distributions, where the alphabet size $S$ is…

Information Theory · Computer Science 2015-03-11 Jiantao Jiao , Kartik Venkat , Yanjun Han , Tsachy Weissman

In this paper we present results on asymptotic characteristics of multivariate function classes in the uniform norm. Our main interest is the approximation of functions with mixed smoothness parameter not larger than $1/2$. Our focus will…

Functional Analysis · Mathematics 2021-11-01 Vladimir Temlyakov , Tino Ullrich

We study the polynomial approximation problem in $L^2(\mu_1)$ where $\mu_1(dx) = e^{-|x|}/2 dx$. We show that for any absolutely continuous function $f$, $$ \sum_{k=1}^{\infty} \log^2(e+k) \langle f, P_k \rangle^2 \ \leq C \left(…

Classical Analysis and ODEs · Mathematics 2025-02-12 Pierre Bizeul , Boaz Klartag

We consider the problem of random sampling for band-limited functions. When can a band-limited function $f$ be recovered from randomly chosen samples $f(x_j), j\in \mathbb{N}$? We estimate the probability that a sampling inequality of the…

Probability · Mathematics 2011-04-27 Karlheinz Gröchenig , Richard F. Bass