English
Related papers

Related papers: On the Error in Phase Transition Computations for …

200 papers

The one-bit compressed sensing framework aims to reconstruct a sparse signal by only using the sign information of its linear measurements. To compensate for the loss of scale information, past studies in the area have proposed recovering…

Information Theory · Computer Science 2016-09-21 Yingying Xu , Yoshiyuki Kabashima

We study the problem of detection of a p-dimensional sparse vector of parameters in the linear regression model with Gaussian noise. We establish the detection boundary, i.e., the necessary and sufficient conditions for the possibility of…

Statistics Theory · Mathematics 2010-09-13 Yuri I. Ingster , Alexandre B. Tsybakov , Nicolas Verzelen

We consider parameter estimation in distributed networks, where each sensor in the network observes an independent sample from an underlying distribution and has $k$ bits to communicate its sample to a centralized processor which computes…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-23 Yanjun Han , Ayfer Özgür , Tsachy Weissman

The Lasso is one of the most important approaches for parameter estimation and variable selection in high dimensional linear regression. At the heart of its success is the attractive rate of convergence result even when $p$, the dimension…

Statistics Theory · Mathematics 2019-08-09 Junlong Zhao , Chenlei Leng

Compressed sensing is a novel research area, which was introduced in 2006, and since then has already become a key concept in various areas of applied mathematics, computer science, and electrical engineering. It surprisingly predicts that…

Information Theory · Computer Science 2012-08-29 Gitta Kutyniok

The goal of this paper is to characterize Gaussian-Process optimization in the setting where the function domain is large relative to the number of admissible function evaluations, i.e., where it is impossible to find the global optimum. We…

Machine Learning · Computer Science 2022-01-26 Manuel Wüthrich , Bernhard Schölkopf , Andreas Krause

The laws of quantum mechanics place fundamental limits on the accuracy of measurements and therefore on the estimation of unknown parameters of a quantum system. In this work, we prove lower bounds on the size of confidence regions reported…

Quantum Physics · Physics 2014-12-23 Michael Walter , Joseph M. Renes

Phase estimation plays a central role in communications, sensing, and information processing. Quantum correlated states, such as squeezed states, enable phase estimation beyond the shot-noise limit, and in principle approach the ultimate…

Quantum Physics · Physics 2024-09-25 M. A. Rodríguez-García , F. E. Becerra

Species evolution is essentially a random process of interaction between biological populations and their environments. As a result, some physical parameters in evolution models are subject to statistical fluctuations. In this paper, two…

Populations and Evolution · Quantitative Biology 2015-06-02 Duo-Fang Li , Tian-Guang Cao , Jin-Peng Geng , Li-Hua Qiao , Jian-Zhong Gu , Yong Zhan

Consider the problem of detecting one of M i.i.d. Gaussian signals corrupted in white Gaussian noise. Conventionally, matched filters are used for detection. We first show that the outputs of the matched filter form a set of asymptotically…

Information Theory · Computer Science 2020-08-19 Jiachun Pan , Yonglong Li , Vincent Y. F. Tan , Yonina C. Eldar

This paper uses information-theoretic tools to analyze the generalization error in unsupervised domain adaptation (UDA). We present novel upper bounds for two notions of generalization errors. The first notion measures the gap between the…

Machine Learning · Computer Science 2023-03-03 Ziqiao Wang , Yongyi Mao

We study the problem of recovering the common $k$-sized support of a set of $n$ samples of dimension $d$, using $m$ noisy linear measurements per sample. Most prior work has focused on the case when $m$ exceeds $k$, in which case $n$ of the…

Information Theory · Computer Science 2021-05-14 Lekshmi Ramesh , Chandra R. Murthy , Himanshu Tyagi

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an…

Information Theory · Computer Science 2010-01-26 Galen Reeves , Michael Gastpar

This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative intensities whose measurements are corrupted by Poisson noise. In this…

Information Theory · Computer Science 2015-05-14 Maxim Raginsky , Rebecca M. Willett , Zachary T. Harmany , Roummel F. Marcia

This paper is concerned with high-dimensional panel data models where the number of regressors can be much larger than the sample size. Under the assumption that the true parameter vector is sparse we propose a panel-Lasso estimator and…

Statistics Theory · Mathematics 2014-02-14 Anders Bredahl Kock

In the era of big data, it is necessary to split extremely large data sets across multiple computing nodes and construct estimators using the distributed data. When designing distributed estimators, it is desirable to minimize the amount of…

Statistics Theory · Mathematics 2022-04-25 Azeem Zaman , Botond Szabó

We consider computationally-efficient estimation of population parameters when observations are subject to missing data. In particular, we consider estimation under the realizable contamination model of missing data in which an $\epsilon$…

Statistics Theory · Mathematics 2026-03-18 Kabir Aladin Verchand , Ankit Pensia , Saminul Haque , Rohith Kuditipudi

The effectiveness of non-parametric, kernel-based methods for function estimation comes at the price of high computational complexity, which hinders their applicability in adaptive, model-based control. Motivated by approximation techniques…

Statistics Theory · Mathematics 2023-03-17 Anna Scampicchio , Elena Arcari , Melanie N. Zeilinger

We consider statistical models of estimation of a rank-one matrix (the spike) corrupted by an additive gaussian noise matrix in the sparse limit. In this limit the underlying hidden vector (that constructs the rank-one matrix) has a number…

Information Theory · Computer Science 2019-11-13 Jean Barbier , Nicolas Macris

Although a majority of the theoretical literature in high-dimensional statistics has focused on settings which involve fully-observed data, settings with missing values and corruptions are common in practice. We consider the problems of…

Machine Learning · Statistics 2017-11-06 Yining Wang , Jialei Wang , Sivaraman Balakrishnan , Aarti Singh
‹ Prev 1 3 4 5 6 7 10 Next ›