English
Related papers

Related papers: Optimal approximation of infinite-dimensional holo…

200 papers

This article deals with stochastic processes endowed with the Markov (memoryless) property and evolving over general (uncountable) state spaces. The models further depend on a non-deterministic quantity in the form of a control input, which…

Systems and Control · Computer Science 2015-09-11 Sofie Haesaert , Robert Babuska , Alessandro Abate

Let $\al$ be an irrational and $\varphi: \N \rightarrow \R^+$ be a function decreasing to zero. For any $\al$ with a given Diophantine type, we show some sharp estimations for the Hausdorff dimension of the set [E_{\varphi}(\al):={y\in \R:…

Dynamical Systems · Mathematics 2012-09-17 Lingmin Liao , Michal Rams

We study stochastic optimization of nonconvex loss functions, which are typical objectives for training neural networks. We propose stochastic approximation algorithms which optimize a series of regularized, nonlinearized losses on large…

Machine Learning · Computer Science 2019-03-12 Weiran Wang , Nathan Srebro

Let $X$ be a Banach space with the unit ball $B(X)$ and $A\subset X$ be a convex origin-symmetric compact in $X$. Let $\mathrm{j}:X\rightarrow \widetilde{X}$ be an isometric extension of $X$. It is well-known that linear widths $\lambda…

Functional Analysis · Mathematics 2024-02-09 Alexander Kushpel

In recent years, the use of sparse recovery techniques in the approximation of high-dimensional functions has garnered increasing interest. In this work we present a survey of recent progress in this emerging topic. Our main focus is on the…

Numerical Analysis · Mathematics 2017-06-12 Ben Adcock , Simone Brugiapaglia , Clayton G. Webster

Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…

Computational Complexity · Computer Science 2014-12-09 Mark Bun , Thomas Steinke

We studied linear weighted sampling algorithms and their optimality for approximate recovery of functions with mixed smoothness on $\mathbb{R}^d$ from a set of $n$ their sampled values. Functions to be recovered are in weighted Sobolev…

Numerical Analysis · Mathematics 2025-11-11 Dinh Dũng

Consider the case that we observe $n$ independent and identically distributed copies of a random variable with a probability distribution known to be an element of a specified statistical model. We are interested in estimating an infinite…

Statistics Theory · Mathematics 2017-09-20 Mark J. van der Laan , Aurélien F. Bibaut

Consider the problem of estimating the $\gamma$-level set $G^*_{\gamma}=\{x:f(x)\geq\gamma\}$ of an unknown $d$-dimensional density function $f$ based on $n$ independent observations $X_1,...,X_n$ from the density. This problem has been…

Statistics Theory · Mathematics 2009-08-26 Aarti Singh , Clayton Scott , Robert Nowak

This article delves into the study of the theory of regularized learning in Banach spaces for linear-functional data. It encompasses discussions on representer theorems, pseudo-approximation theorems, and convergence theorems. Regularized…

Machine Learning · Computer Science 2025-03-05 Qi Ye

A passive approximation problem is formulated where the target function is an arbitrary complex valued continuous function defined on an approximation domain consisting of a finite union of closed and bounded intervals on the real axis. The…

We consider the recovery of real-valued bandlimited functions from the absolute values of their samples, possibly spaced nonuniformly. We show that such a reconstruction is always possible if the function is sampled at more than twice its…

Numerical Analysis · Mathematics 2012-01-17 Gaurav Thakur

We study statistical properties of the optimal value of the Sample Average Approximation. The focus is on the tail function of the absolute error induced by the Sample Average Approximation, deriving upper estimates of its outcomes…

Probability · Mathematics 2023-12-12 Volker Krätschmer

We propose and study quantitative measures of smoothness which are adapted to anisotropic features such as edges in images or shocks in PDE's. These quantities govern the rate of approximation by adaptive finite elements, when no constraint…

Numerical Analysis · Mathematics 2015-03-17 Jean-Marie Mirebeau , Albert Cohen

We address the problem of estimating a high-dimensional matrix from linear measurements, with a focus on designing optimal rank-adaptive algorithms. These algorithms infer the matrix by estimating its singular values and the corresponding…

Information Theory · Computer Science 2026-05-12 Frédéric Zheng , Yassir Jedra , Alexandre Proutiere

Infinite-dimensional compressed sensing deals with the recovery of analog signals (functions) from linear measurements, often in the form of integral transforms such as the Fourier transform. This framework is well-suited to many real-world…

Information Theory · Computer Science 2021-05-25 Ben Adcock , Vegard Antun , Anders C. Hansen

For solving large-scale non-convex problems, we propose inexact variants of trust region and adaptive cubic regularization methods, which, to increase efficiency, incorporate various approximations. In particular, in addition to approximate…

Optimization and Control · Mathematics 2018-02-21 Zhewei Yao , Peng Xu , Farbod Roosta-Khorasani , Michael W. Mahoney

The idea of best approximation in linear n-normed space is presented and some examples showing various possibilities of best approximations in linear n-normed space is given. Also, we study strictly convex n-norm and enquire about the…

Functional Analysis · Mathematics 2023-09-27 Prasenjit Ghosh , T. K. Samanta

In this paper we study the right differentiability of a parametric infimum function over a parametric set defined by equality constraints. We present a new theorem with sufficient conditions for the right differentiability with respect to…

Optimization and Control · Mathematics 2023-06-22 Kevin Sturm

In this paper, we show that the approximation of high-dimensional functions, which are effectively low-dimensional, does not suffer from the curse of dimensionality. This is shown first in a general reproducing kernel Hilbert space set-up…

Numerical Analysis · Mathematics 2024-11-28 Christian Rieger , Holger Wendland