English
Related papers

Related papers: Resolution Limits for the Noisy Non-Adaptive 20 Qu…

200 papers

A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson $\beta$ functions is proposed. This bound is the dual of a converse bound established earlier by Polyanskiy and Verd\'{u} (2014). The new bound…

Information Theory · Computer Science 2016-01-25 Wei Yang , Austin Collins , Giuseppe Durisi , Yury Polyanskiy , H. Vincent Poor

Adapting to a priori unknown noise level is a very important but challenging problem in sequential decision-making as efficient exploration typically requires knowledge of the noise level, which is often loosely specified. We report…

Machine Learning · Statistics 2024-06-11 Kwang-Sung Jun , Jungtaek Kim

The two-way capacities of quantum channels determine the ultimate entanglement and secret-key distribution rates achievable by two distant parties that are connected by a noisy transmission line, in absence of quantum repeaters. Since…

Quantum Physics · Physics 2025-01-27 Francesco Anna Mele , Ludovico Lami , Vittorio Giovannetti

The goal of ordinal embedding is to represent items as points in a low-dimensional Euclidean space given a set of constraints in the form of distance comparisons like "item $i$ is closer to item $j$ than item $k$". Ordinal constraints like…

Machine Learning · Statistics 2016-06-24 Lalit Jain , Kevin Jamieson , Robert Nowak

In this paper, we consider the group testing problem with adaptive test designs and noisy outcomes. We propose a computationally efficient four-stage procedure with components including random binning, identification of bins containing…

Computation · Statistics 2019-11-11 Jonathan Scarlett

In quantum computation, amplitude estimation is a fundamental subroutine that is utilized in various quantum algorithms. A general important task of such estimation problems is to characterize the estimation lower bound, which is referred…

Quantum Physics · Physics 2025-07-10 Kohei Oshio , Yohichi Suzuki , Kaito Wada , Keigo Hisanaga , Shumpei Uno , Naoki Yamamoto

This paper shows new general nonasymptotic achievability and converse bounds and performs their dispersion analysis for the lossy compression problem in which the compressor observes the source through a noisy channel. While this problem is…

Information Theory · Computer Science 2016-09-19 Victoria Kostina , Sergio Verdú

A Chernoff-type distribution is a nonnormal distribution defined by the slope at zero of the greatest convex minorant of a two-sided Brownian motion with a polynomial drift. While a Chernoff-type distribution is known to appear as the…

Statistics Theory · Mathematics 2021-06-23 Qiyang Han , Kengo Kato

This paper is devoted to the problem of determining the concentration bounds that are achievable in non-parametric regression. We consider the setting where features are supported on a bounded subset of $\mathbb{R}^d$, the regression…

Statistics Theory · Mathematics 2024-12-02 Anna Ben-Hamou , Arnaud Guyader

The reconstruction of an unknown quantity from noisy measurements is a mathematical problem relevant in most applied sciences, for example, in medical imaging, radar inverse scattering, or astronomy. This underlying mathematical problem is…

Optimization and Control · Mathematics 2025-10-14 Nina M. Gottschling , David Iagaru , Jakob Gawlikowski , Ioannis Sgouralis

Motivated by the application of point-to-point communication networks and biological storage, we investigate new achievability bounds for noisy permutation channels with strictly positive and full-rank square matrices. Our new bounds use…

Information Theory · Computer Science 2025-01-24 Lugaoze Feng , Xunan Li , Guocheng Lv , Ye jin

We study the maximum achievable differential entropy at the output of a system assigning to each input X the sum X+N, with N a given noise with probability law absolutely continuous with respect to the Lebesgue measure and where the input…

Optimization and Control · Mathematics 2016-02-04 Francisco J. Piera

Compressed sensing typically deals with the estimation of a system input from its noise-corrupted linear measurements, where the number of measurements is smaller than the number of input components. The performance of the estimation…

Information Theory · Computer Science 2016-11-17 Jin Tan , Danielle Carmon , Dror Baron

Consider a target moving at a constant velocity on a unit-circumference circle, starting at an arbitrary location. To acquire the target, any region of the circle can be probed to obtain a noisy measurement of the target's presence, where…

Information Theory · Computer Science 2016-11-29 Yonatan Kaspi , Ofer Shayevitz , Tara Javidi

The estimation of parameters characterizing dynamical processes is central to science and technology. The estimation error changes with the number N of resources employed in the experiment (which could quantify, for instance, the number of…

Quantum Physics · Physics 2012-01-10 B. M. Escher , R. L. de Matos Filho , L. Davidovich

Line spectral estimation is a classical signal processing problem that aims to estimate the line spectra from their signal which is contaminated by deterministic or random noise. Despite a large body of research on this subject, the…

Information Theory · Computer Science 2020-10-15 Ping Liu , Hai Zhang

We consider the problem of 20 questions with noise for multiple players under the minimum entropy criterion in the setting of stochastic search, with application to target localization. Each player yields a noisy response to a binary query…

Information Theory · Computer Science 2014-03-18 Theodoros Tsiligkaridis , Brian M. Sadler , Alfred O. Hero

Calibration is nowadays one of the most important processes involved in the extraction of valuable data from measurements. The current availability of an optimum data cube measured from a heterogeneous set of instruments and surveys relies…

Instrumentation and Methods for Astrophysics · Physics 2012-08-13 Maria Jose Marquez

The noisy permutation channel is a useful abstraction introduced by Makur for point-to-point communication networks and biological storage. While the asymptotic capacity results exist for this model, the characterization of the second-order…

Information Theory · Computer Science 2024-06-24 Lugaoze Feng , Baoji Wang , Guocheng Lv , Xvnan Li , Luhua Wang , Ye jin

We derive new bounds on achievable precision in the most general adaptive quantum metrological scenarios. The bounds are proven to be asymptotically saturable and equivalent to the known parallel scheme bounds in the limit of large number…