English
Related papers

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

200 papers

We give sufficient conditions for the asymptotic normality of linear combinations of order statistics (L-statistics) in the case of simple random samples without replacement. In the first case, restrictions are imposed on the weights of…

Statistics Theory · Mathematics 2012-04-11 Andrius Čiginas

In 'An asymptotic result on compressed sensing matrices', a new construction for compressed sensing matrices using combinatorial design theory was introduced. In this paper, we use deterministic and probabilistic methods to analyse the…

Information Theory · Computer Science 2015-05-21 Darryn Bryant , Charles Colbourn , Daniel Horsley , Padraig Ó Catháin

We study asymptotic anytime-valid confidence sequences for degree-two U-statistics under continuous monitoring. In the nondegenerate case, Hoeffding's projection reduces the problem to a time-uniform central limit theory for the partial…

Statistics Theory · Mathematics 2026-05-19 Leheng Cai , Qirui Hu , Weijia Li

In this paper, we consider robust control using randomized algorithms. We extend the existing order statistics distribution theory to the general case in which the distribution of population is not assumed to be continuous and the order…

Optimization and Control · Mathematics 2008-05-13 Xinjia Chen , Kemin Zhou

We adapt the techniques in Stigler [Ann. Statist. 1 (1973) 472--477] to obtain a new, general asymptotic result for trimmed $U$-statistics via the generalized $L$-statistic representation introduced by Serfling [Ann. Statist. 12 (1984)…

Statistics Theory · Mathematics 2010-11-29 Yuri V. Borovskikh , N. C. Weber

In this paper, we aim to develop stochastic hard thresholding algorithms for the important problem of AUC maximization in imbalanced classification. The main challenge is the pairwise loss involved in AUC maximization. We overcome this…

Machine Learning · Computer Science 2020-11-05 Zhenhuan Yang , Baojian Zhou , Yunwen Lei , Yiming Ying

This paper deals with the computational complexity of conditions which guarantee that the NP-hard problem of finding the sparsest solution to an underdetermined linear system can be solved by efficient algorithms. In the literature, several…

Optimization and Control · Mathematics 2013-11-05 Andreas M. Tillmann , Marc E. Pfetsch

We investigate the asymptotic distributions of coordinates of regression M-estimates in the moderate $p/n$ regime, where the number of covariates $p$ grows proportionally with the sample size $n$. Under appropriate regularity conditions, we…

Statistics Theory · Mathematics 2016-12-20 Lihua Lei , Peter J. Bickel , Noureddine El Karoui

Compressed sensing is a signal processing technique in which data is acquired directly in a compressed form. There are two modeling approaches that can be considered: the worst-case (Hamming) approach and a statistical mechanism, in which…

Information Theory · Computer Science 2016-01-20 Wasim Huleihel , Neri Merhav

This paper studies the Gaussian and bootstrap approximations for the probabilities of a non-degenerate U-statistic belonging to the hyperrectangles in $\mathbb{R}^d$ when the dimension $d$ is large. A two-step Gaussian approximation…

Statistics Theory · Mathematics 2017-07-11 Xiaohui Chen

The many variants of the restricted isometry property (RIP) have proven to be crucial theoretical tools in the fields of compressed sensing and matrix completion. The study of extending compressed sensing to accommodate phaseless…

Information Theory · Computer Science 2014-04-16 Vladislav Voroninski , Zhiqiang Xu

This paper deals with U-statistics of Poisson processes and multiple Wiener-It\^o integrals on the Poisson space. Via sharp bounds on the cumulants for both classes of random variables, moderate deviation principles, concentration…

Probability · Mathematics 2023-04-13 Matthias Schulte , Christoph Thaele

A distributed average consensus algorithm in which every sensor transmits with bounded peak power is proposed. In the presence of communication noise, it is shown that the nodes reach consensus asymptotically to a finite random variable…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-15 Sivaraman Dasarathan , Cihan Tepedelenlioglu , Mahesh Banavar , Andreas Spanias

The choice of the sensing matrix is crucial in compressed sensing. Random Gaussian sensing matrices satisfy the restricted isometry property, which is crucial for solving the sparse recovery problem using convex optimization techniques.…

Signal Processing · Electrical Eng. & Systems 2023-12-29 Kartheek Kumar Reddy Nareddy , Abijith Jagannath Kamath , Chandra Sekhar Seelamantula

In compressed sensing one measures sparse signals directly in a compressed form via a linear transform and then reconstructs the original signal. However, it is often the case that the linear transform itself is known only approximately, a…

Information Theory · Computer Science 2013-11-13 Florent Krzakala , Marc Mézard , Lenka Zdeborová

Compressed sensing allows for the recovery of sparse signals from few measurements, whose number is proportional to the sparsity of the unknown signal, up to logarithmic factors. The classical theory typically considers either random linear…

Functional Analysis · Mathematics 2025-04-02 Giovanni S. Alberti , Alessandro Felisi , Matteo Santacesaria , S. Ivan Trapasso

U-statistics are a fundamental class of estimators that generalize the sample mean and underpin much of nonparametric statistics. Although extensively studied in both statistics and probability, key challenges remain: their high…

Statistics Theory · Mathematics 2026-02-19 Cesare Miglioli , Jordan Awan

In compressed sensing, it is often desirable to consider signals possessing additional structure beyond sparsity. One such structured signal model - which forms the focus of this paper - is the local sparsity in levels class. This class has…

Information Theory · Computer Science 2017-06-05 Chen Li , Ben Adcock

Phase-only compressed sensing (PO-CS) concerns the recovery of sparse signals from the phases of complex measurements. Recent results show that sparse signals in the standard sphere $\mathbb{S}^{n-1}$ can be exactly recovered from complex…

Information Theory · Computer Science 2026-04-07 Junren Chen , Michael K. Ng , Jonathan Scarlett

The task of compressed sensing is to recover a sparse vector from a small number of linear and non-adaptive measurements, and the problem of finding a suitable measurement matrix is very important in this field. While most recent works…

Information Theory · Computer Science 2012-12-18 Yi-Zheng Fan , Tao Huang , Ming Zhu