English
Related papers

Related papers: On U-Statistics and Compressed Sensing II: Non-Asy…

200 papers

We derive new and improved non-asymptotic deviation inequalities for the sample average approximation (SAA) of an optimization problem. Our results give strong error probability bounds that are "sub-Gaussian"~even when the randomness of the…

Optimization and Control · Mathematics 2022-03-28 Roberto I. Oliveira , Philip Thompson

We investigate the complexity of solving stable or perturbation-resilient instances of $k$-Means and $k$-Median clustering in fixed dimension Euclidean metrics (more generally doubling metrics). The notion of stable (perturbation resilient)…

Data Structures and Algorithms · Computer Science 2024-02-01 Zachary Friggstad , Kamyar Khodamoradi , Mohammad R. Salavatipour

We derive a consistency result, in the $L_1$-sense, for incomplete U-statistics in the non-standard case where the kernel at hand has infinite second-order moments. Assuming that the kernel has finite moments of order $p(\geq 1)$, we obtain…

Statistics Theory · Mathematics 2021-12-30 Alexander Dürre , Davy Paindaveine

Since compressive sensing deals with a signal reconstruction using a reduced set of measurements, the existence of a unique solution is of crucial importance. The most important approach to this problem is based on the restricted isometry…

Information Theory · Computer Science 2021-05-28 Ljubisa Stankovic

The problem of model selection arises in a number of contexts, such as compressed sensing, subset selection in linear regression, estimation of structures in graphical models, and signal denoising. This paper generalizes the notion of…

Information Theory · Computer Science 2018-03-06 Waheed U. Bajwa , Robert Calderbank , Sina Jafarpour

We study the Compressed Sensing (CS) problem, which is the problem of finding the most sparse vector that satisfies a set of linear measurements up to some numerical tolerance. We introduce an $\ell_2$ regularized formulation of CS which we…

Signal Processing · Electrical Eng. & Systems 2024-07-15 Dimitris Bertsimas , Nicholas A. G. Johnson

Taking seriously phenomenological indications for supersymmetry, we have made a detailed study of unified minimal SUSY, including effects at the few percent level in a consistent fashion. We report here a general analysis without choosing a…

High Energy Physics - Phenomenology · Physics 2009-09-15 G. L. Kane , Chris Kolda , Leszek Roszkowski , James D. Wells

We review the result of SUSY parameter fits based on frequentist analyses of experimental constraints from electroweak precision data, (g-2)_mu, B-physics and cosmological data. We investigate the parameters of the constrained MSSM (CMSSM)…

High Energy Physics - Phenomenology · Physics 2010-12-13 S. Heinemeyer , G. Weiglein

Random Number Generators play a critical role in a number of important applications. In practice, statistical testing is employed to gather evidence that a generator indeed produces numbers that appear to be random. In this paper, we…

Computational Complexity · Computer Science 2010-03-25 Weiling Chang , Binxing Fang , Xiaochun Yun , Shupeng Wang , Xiangzhan Yu

A central tool in the study of nonhomogeneous random matrices, the noncommutative Khintchine inequality, yields a nonasymptotic bound on the spectral norm of general Gaussian random matrices $X=\sum_i g_i A_i$ where $g_i$ are independent…

Probability · Mathematics 2023-09-18 Afonso S. Bandeira , March T. Boedihardjo , Ramon van Handel

We study statistical restricted isometry, a property closely related to sparse signal recovery, of deterministic sensing matrices of size $m \times N$. A matrix is said to have a statistical restricted isometry property (StRIP) of order $k$…

Information Theory · Computer Science 2016-11-17 Alexander Barg , Arya Mazumdar , Rongrong Wang

We establish a strong Gaussian approximation for high-dimensional non-degenerate U-statistics with diverging dimension. Under mild assumptions, we construct, on a sufficiently rich probability space, a Gaussian process that uniformly…

Statistics Theory · Mathematics 2026-03-12 Weijia Li , Leheng Cai , Qirui Hu

Intuitively, if a density operator has small rank, then it should be easier to estimate from experimental data, since in this case only a few eigenvectors need to be learned. We prove two complementary results that confirm this intuition.…

Quantum Physics · Physics 2012-10-18 Steven T. Flammia , David Gross , Yi-Kai Liu , Jens Eisert

We take another look at using Stein's method to establish uniform Berry-Esseen bounds for Studentized nonlinear statistics, highlighting variable censoring and an exponential randomized concentration inequality for a sum of censored…

Statistics Theory · Mathematics 2025-09-04 Dennis Leung , Qi-Man Shao , Liqian Zhang

Evaluating the statistical dimension is a common tool to determine the asymptotic phase transition in compressed sensing problems with Gaussian ensemble. Unfortunately, the exact evaluation of the statistical dimension is very difficult and…

Information Theory · Computer Science 2019-06-06 Sajad Daei , Farzan Haddadi , Arash Amini , Martin Lotz

Recently, the statistical restricted isometry property (RIP) has been formulated to analyze the performance of deterministic sampling matrices for compressed sensing. In this paper, we propose the usage of orthogonal symmetric Toeplitz…

Information Theory · Computer Science 2015-03-17 Kezhi Li , Lu Gan , Cong Ling

Recovery of the sparsity pattern (or support) of an unknown sparse vector from a small number of noisy linear measurements is an important problem in compressed sensing. In this paper, the high-dimensional setting is considered. It is shown…

Information Theory · Computer Science 2013-02-06 Galen Reeves , Michael Gastpar

We present nonasymptotic concentration inequalities for sums of independent and identically distributed random variables that yield asymptotic strong Gaussian approximations of Koml\'os, Major, and Tusn\'ady (KMT) [1975,1976]. The constants…

Probability · Mathematics 2025-10-01 Ian Waudby-Smith , Martin Larsson , Aaditya Ramdas

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

We consider the stochastic behavior of a class of local $U$-statistics of Poisson processes$-$which include subgraph and simplex counts as special cases, and amounts to quantifying clustering behavior$-$for point clouds lying in diverging…

Probability · Mathematics 2022-07-25 Andrew M. Thomas