DeepAI AI Chat
Log In Sign Up

It was "all" for "nothing": sharp phase transitions for noiseless discrete channels

by   Jonathan Niles-Weed, et al.

We establish a phase transition known as the "all-or-nothing" phenomenon for noiseless discrete channels. This class of models includes the Bernoulli group testing model and the planted Gaussian perceptron model. Previously, the existence of the all-or-nothing phenomenon for such models was only known in a limited range of parameters. Our work extends the results to all signals with arbitrary sublinear sparsity. Over the past several years, the all-or-nothing phenomenon has been established in various models as an outcome of two seemingly disjoint results: one positive result establishing the "all" half of all-or-nothing, and one impossibility result establishing the "nothing" half. Our main technique in the present work is to show that for noiseless discrete channels, the "all" half implies the "nothing" half, that is a proof of "all" can be turned into a proof of "nothing." Since the "all" half can often be proven by straightforward means – for instance, by the first-moment method – our equivalence gives a powerful and general approach towards establishing the existence of this phenomenon in other contexts.


page 1

page 2

page 3

page 4


The All-or-Nothing Phenomenon in Sparse Tensor PCA

We study the statistical problem of estimating a rank-one sparse tensor ...

Capacity of Noisy Permutation Channels

We establish the capacity of a class of communication channels introduce...

Phase retrieval in high dimensions: Statistical and computational phase transitions

We consider the phase retrieval problem of reconstructing a n-dimensiona...

Sparse Uniformity Testing

In this paper we consider the uniformity testing problem for high-dimens...

A stochastic algorithm for fault inverse problems in elastic half space with proof of convergence

A general stochastic algorithm for solving mixed linear and nonlinear pr...

Delocalisation of one-dimensional marginals of product measures and the capacity of LTI discrete channels

We consider discrete linear time invariant (LTI) channels satisfying the...

Revisiting zero-rate bounds on the reliability function of discrete memoryless channels

We present a new proof of Berlekamp's zero-rate upper bound on the relia...