English
Related papers

Related papers: Approximate Sparsity Class and Minimax Estimation

200 papers

We consider the task of estimating a conditional density using i.i.d. samples from a joint distribution, which is a fundamental problem with applications in both classification and uncertainty quantification for regression. For joint…

Statistics Theory · Mathematics 2023-06-16 Blair Bilodeau , Dylan J. Foster , Daniel M. Roy

We consider the nonparametric estimation of the intensity function of a Poisson point process in a circular model from indirect observations $N_1,\ldots,N_n$. These observations emerge from hidden point process realizations with the target…

Statistics Theory · Mathematics 2019-02-19 Martin Kroll

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 propose a new numerical scheme for approximating level-sets of Lipschitz multivariate functions which is robust to stochastic noise. The algorithm's main feature is an adaptive grid-based stochastic approximation strategy which…

Numerical Analysis · Mathematics 2025-09-19 Matteo Croci , Abdul-Lateef Haji-Ali , Ian C. J. Powell

In this paper, we use the Approximation Formula for the Fourier transform of the solution set of lattice points on k-spheres and methods of Bourgain and Ionescu to refine the l^p(Z^d)-boundedness results for discrete k- spherical maximal…

Classical Analysis and ODEs · Mathematics 2015-09-16 Kevin Hughes

Given i.i.d samples from some unknown continuous density on hyper-rectangle $[0, 1]^d$, we attempt to learn a piecewise constant function that approximates this underlying density non-parametrically. Our density estimate is defined on a…

Machine Learning · Statistics 2015-09-24 Kun Yang , Hao Su , Wing Hung Wang

The present paper considers a problem of estimating a linear functional $\Phi=\int_{-\infty}^\infty \varphi(x) f(x)dx$ of an unknown deconvolution density $f$ on the basis of i.i.d. observations $Y_i = \theta_i + \xi_i$ where $\xi_i$ has a…

Statistics Theory · Mathematics 2015-05-19 Marianna Pensky

We prove that the lowest free energy of a classical interacting system at temperature $T$ with a prescribed density profile $\rho(x)$ can be approximated by the local free energy $\int f_T(\rho(x))dx$, provided that $\rho$ varies slowly…

Mathematical Physics · Physics 2024-08-28 Michal Jex , Mathieu Lewin , Peter Madsen

The nearest-centroid classifier is a simple linear-time classifier based on computing the centroids of the data classes in the training phase, and then assigning a new datum to the class corresponding to its nearest centroid. Thanks to its…

Machine Learning · Computer Science 2019-11-26 Giuseppe C. Calafiore , Giulia Fracastoro

In this work we investigate to which extent one can recover class probabilities within the empirical risk minimization (ERM) paradigm. The main aim of our paper is to extend existing results and emphasize the tight relations between…

Machine Learning · Computer Science 2020-07-22 Alexander Mey , Marco Loog

Stochastic processes are often used to model complex scientific problems in fields ranging from biology and finance to engineering and physical science. This paper investigates rate-optimal estimation of the volatility matrix of a…

Statistics Theory · Mathematics 2014-01-30 Minjing Tao , Yazhen Wang , Harrison H. Zhou

We investigate the modeling and the numerical solution of machine learning problems with prediction functions which are linear combinations of elements of a possibly infinite-dimensional dictionary. We propose a novel flexible composite…

Statistics Theory · Mathematics 2015-12-03 Patrick L. Combettes , Saverio Salzo , Silvia Villa

A new approximation format for solutions of partial differential equations depending on infinitely many parameters is introduced. By combining low-rank tensor approximation in a selected subset of variables with a sparse polynomial…

Numerical Analysis · Mathematics 2025-06-25 Markus Bachmayr , Huqing Yang

We prove new explicit upper bounds on the leverage scores of Fourier sparse functions under both the Gaussian and Laplace measures. In particular, we study $s$-sparse functions of the form $f(x) = \sum_{j=1}^s a_j e^{i \lambda_j x}$ for…

Data Structures and Algorithms · Computer Science 2021-07-09 Tamás Erdélyi , Cameron Musco , Christopher Musco

The goal of compressive sensing is efficient reconstruction of data from few measurements, sometimes leading to a categorical decision. If only classification is required, reconstruction can be circumvented and the measurements needed are…

Computer Vision and Pattern Recognition · Computer Science 2013-10-17 B. W. Brunton , S. L. Brunton , J. L. Proctor , J. N. Kutz

In this note, we investigate the theoretical properties of Orthogonal Matching Pursuit (OMP), a class of decoder to recover sparse signal in compressed sensing. In particular, we show that the OMP decoder can give $(p,q)$ instance…

Information Theory · Computer Science 2011-02-18 Zhiqiang Xu

Given a random sample of points from some unknown density, we propose a data-driven method for estimating density level sets under the r-convexity assumption. This shape condition generalizes the convexity property. However, the main…

Statistics Theory · Mathematics 2019-05-09 Alberto Rodríguez-Casal , Paula Saavedra-Nieves

In this paper, we study estimation of certain integral functionals of one or two densities with samples from stationary m-dependent sequences. We consider two types of U-statistic estimators for these functionals that are functions of the…

Statistics Theory · Mathematics 2013-09-20 David Källberg , Oleg Seleznjev

We analyze a plug-in estimator for a large class of integral functionals of one or more continuous probability densities. This class includes important families of entropy, divergence, mutual information, and their conditional versions. For…

Statistics Theory · Mathematics 2016-03-30 Shashank Singh , Barnabás P óczos

We study the approximability of instances of the minimum entropy set cover problem, parameterized by the average frequency of a random element in the covering sets. We analyze an algorithm combining a greedy approach with another one biased…

Data Structures and Algorithms · Computer Science 2012-08-01 Cosmin Bonchis , Gabriel Istrate
‹ Prev 1 3 4 5 6 7 10 Next ›