English
Related papers

Related papers: Sampling projections in the uniform norm

200 papers

We prove a sharp bound between sampling numbers and entropy numbers in the uniform norm for bounded convex sets of bounded functions.

Functional Analysis · Mathematics 2025-10-02 Mario Ullrich

We introduce a sampling theoretic framework for the recovery of smooth surfaces and functions living on smooth surfaces from few samples. The proposed approach can be thought of as a nonlinear generalization of union of subspace models…

Signal Processing · Electrical Eng. & Systems 2019-03-05 Qing Zou , Mathews Jacob

We study the problem of reconstructing an unknown point in $\mathbb{R}^d$ from approximate linear queries. This setting arises naturally in applications ranging from low-dimensional remote sensing and signal recovery to high-dimensional…

Machine Learning · Computer Science 2026-05-20 Yuval Filmus , Shay Moran , Elizaveta Nesterova

We prove that for any compact set B in R^d and for any epsilon >0 there is a finite subset X of B of |X|=d^{O(1/epsilon^2)} points such that the maximum absolute value of any linear function ell: R^d --> R on X approximates the maximum…

Metric Geometry · Mathematics 2012-04-13 Alexander Barvinok

We investigate the maximal size of an increasing subset among points randomly sampled from certain probability densities. Kerov and Vershik's celebrated result states that the largest increasing subset among $N$ uniformly random points on…

Probability · Mathematics 2024-12-19 Victor Dubach

This article introduces subbagging (subsample aggregating) estimation approaches for big data analysis with memory constraints of computers. Specifically, for the whole dataset with size $N$, $m_N$ subsamples are randomly drawn, and each…

Methodology · Statistics 2021-03-05 Tao Zou , Xian Li , Xuan Liang , Hansheng Wang

We derive sufficient conditions for sampling with derivatives in shift-invariant spaces generated by a periodic exponential B-spline. The sufficient conditions are expressed with a new notion of measuring the gap between consecutive…

Functional Analysis · Mathematics 2023-11-15 Karlheinz Gröchenig , Irina Shafkulovska

Let $\mathbb{B}_p^N$ be the $N$-dimensional unit ball corresponding to the $\ell_p$-norm. For each $N\in\mathbb N$ we sample a uniform random subspace $E_N$ of fixed dimension $m\in\mathbb{N}$ and consider the volume of $\mathbb{B}_p^N$…

Probability · Mathematics 2024-12-23 Joscha Prochno , Christoph Thaele , Philipp Tuchel

We examine a fundamental problem that models various active sampling setups, such as network tomography. We analyze sampling of a multivariate normal distribution with an unknown expectation that needs to be estimated: in our setup it is…

Machine Learning · Statistics 2012-08-14 Assaf Hallak , Shie Mannor

Diffusion models generate samples by iteratively querying learned score estimates. A rapidly growing literature focuses on accelerating sampling by minimizing the number of score evaluations, yet the information-theoretic limits of such…

Machine Learning · Computer Science 2026-04-14 Zhiyang Xun , Eric Price

For the space of functions that can be approximated by linear chirps, we prove a reconstruction theorem by random sampling at arbitrary rates.

Probability · Mathematics 2010-08-31 Eric Carlen , R. Vilela Mendes

Using coherent-state techniques, we prove a sampling theorem for Majorana's (holomorphic) functions on the Riemann sphere and we provide an exact reconstruction formula as a convolution product of $N$ samples and a given reconstruction…

Mathematical Physics · Physics 2011-09-13 Manuel Calixto , Julio Guerrero , Juan Carlos Sánchez-Monreal

Let $\mathbb{T}^d$ denote the $d$-dimensional torus. We consider the problem of optimally recovering a target function $f^*:\mathbb{T}^d\rightarrow \mathbb{C}$ from samples of its Fourier coefficients. We make classical smoothness…

Functional Analysis · Mathematics 2025-09-01 Jonathan W. Siegel

In many applications sampled data are collected in irregular fashion or are partly lost or unavailable. In these cases it is required to convert irregularly sampled signals to regularly sampled ones or to restore missing data. In this…

This paper proposes two linear projection methods for supervised dimension reduction using only the first and second-order statistics. The methods, each catering to a different parameter regime, are derived under the general Gaussian model…

Information Theory · Computer Science 2024-08-13 Biao Chen , Joshua Kortje

This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…

Combinatorics · Mathematics 2009-09-29 Olivier Bodini , Eric Fusy , Carine Pivoteau

We study universal approximation of continuous functionals on compact subsets of products of Hilbert spaces. We prove that any such functional can be uniformly approximated by models that first take finitely many continuous linear…

Machine Learning · Computer Science 2026-02-04 Andrey Krylov , Maksim Penkin

Phenomena with a constrained sample space appear frequently in practice. This is the case e.g. with strictly positive data and with compositional data, like percentages and the like. If the natural measure of difference is not the absolute…

Methodology · Statistics 2008-02-20 G. Mateu-Figueras , V. Pawlowsky-Glahn , J. J. Egozcue

We consider two theorems from the theory of compressive sensing. Mainly a theorem concerning uniform recovery of random sampling matrices, where the number of samples needed in order to recover an $s$-sparse signal from linear measurements…

Information Theory · Computer Science 2013-06-05 Joel Andersson , Jan-Olov Strömberg

The Hahn-Banach theorem states that onto each line in every normed space, there is a unitary projection, and Kadec and Snobar proved (using John's ellipsoid) that onto each $n$-dimensional subspace of any real normed space, there is a…

Metric Geometry · Mathematics 2017-03-06 David Hermann