15 citations · 108 across the 28 of their papers we have counts for
25 papers · 1 filter
Two-Sided Bounds for Entropic Optimal Transport via a Rate-Distortion Integral
Jingbo Liu
We show that the maximum expected inner product between a random vector and the standard normal vector over all couplings subject to a mutual information constraint or regularizati…
Improving the Lower Bound for the Union-closed Sets Conjecture via Conditionally IID Coupling
Jingbo Liu
Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequali…
From Soft-Minoration to Information-Constrained Optimal Transport and Spiked Tensor Models
Jingbo Liu
Let be a given distribution on . For any , we may interpret as a soft-max of . W…
Stability of the Gaussian Stationary Point in the Han-Kobayashi Region for Z-Interference Channels
Jingbo Liu
The Gaussian stationary point in an inequality motivated by the Z-interference channel was recently conjectured by Costa, Nair, Ng, and Wang to be the global optimizer, which, if t…
A Few Interactions Improve Distributed Nonparametric Estimation, Optimally
Jingbo Liu
Consider the problem of nonparametric estimation of an unknown -Hölder smooth density at a given point, where and are both dimensional. An infinite sequence…
Minoration via Mixed Volumes and Cover's Problem for General Channels
Jingbo Liu
We give a complete solution to an open problem of Thomas Cover in 1987 about the capacity of a relay channel in the general discrete memoryless setting without any additional assum…
Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation
Vishesh Jain, Frederic Koehler, Jingbo Liu +1
The analysis of Belief Propagation and other algorithms for the {\em reconstruction problem} plays a key role in the analysis of community detection in inference on graphs, phyloge…
Communication Complexity of Estimating Correlations
Uri Hadar, Jingbo Liu, Yury Polyanskiy +1
We characterize the communication complexity of the following distributed estimation problem. Alice and Bob observe infinitely many iid copies of -correlated unit-variance (Gaus…
Sharp Bounds for Mutual Covering
Jingbo Liu, Mohammad H. Yassaee, Sergio Verdú
A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of inde…
Second-Order Converses via Reverse Hypercontractivity
Jingbo Liu, Ramon van Handel, Sergio Verdú
A strong converse shows that no procedure can beat the asymptotic (as blocklength ) fundamental limit of a given information-theoretic problem for any fixed error proba…
Capacity Upper Bounds for the Relay Channel via Reverse Hypercontractivity
Jingbo Liu, Ayfer Ozgur
The primitive relay channel, introduced by Cover in 1987, is the simplest single-source single-destination network model that captures some of the most essential features and chall…
Dispersion Bound for the Wyner-Ahlswede-Körner Network via Reverse Hypercontractivity on Types
Jingbo Liu
This paper introduces a new converse machinery for a challenging class of distributed source-type problems (e.g.\ distributed source coding, common randomness generation, or hypoth…
Information-Theoretic Perspectives on Brascamp-Lieb Inequality and Its Reverse
Jingbo Liu, Thomas A. Courtade, Paul Cuff +1
We introduce an inequality which may be viewed as a generalization of both the Brascamp-Lieb inequality and its reverse (Barthe's inequality), and prove its information-theoretic (…
Brascamp-Lieb Inequality and Its Reverse: An Information Theoretic View
Jingbo Liu, Thomas A. Courtade, Paul Cuff +1
We generalize a result by Carlen and Cordero-Erausquin on the equivalence between the Brascamp-Lieb inequality and the subadditivity of relative entropy by allowing for random tran…
Smoothing Brascamp-Lieb Inequalities and Strong Converses for Common Randomness Generation
Jingbo Liu, Thomas A. Courtade, Paul Cuff +1
We study the infimum of the best constant in a functional inequality, the Brascamp-Lieb-like inequality, over auxiliary measures within a neighborhood of a product distribution. In…
Secret Key Generation with Limited Interaction
Jingbo Liu, Paul Cuff, Sergio Verdú
A basic two-terminal secret key generation model is considered, where the interactive communication rate between the terminals may be limited, and in particular may not be enough t…
-Resolvability
Jingbo Liu, Paul Cuff, Sergio Verdú
The conventional channel resolvability refers to the minimum rate needed for an input process to approximate the channel output distribution in total variation distance. In this pa…
Resolvability in Eγ with Applications to Lossy Compression and Wiretap Channels
Jingbo Liu, Paul Cuff, Sergio Verdú
We study the amount of randomness needed for an input process to approximate a given output distribution of a channel in the distance. A general one-shot achievability bound…
Secret Key Generation with One Communicator and a One-Shot Converse via Hypercontractivity
Jingbo Liu, Paul Cuff, Sergio Verdu
A new model of multi-party secret key agreement is proposed, in which one terminal called the communicator can transmit public messages to other terminals before all terminals agre…
One-Shot Mutual Covering Lemma and Marton's Inner Bound with a Common Message
Jingbo Liu, Paul Cuff, Sergio Verdu
By developing one-shot mutual covering lemmas, we derive a one-shot achievability bound for broadcast with a common message which recovers Marton's inner bound (with three auxiliar…
Key Capacity for Product Sources with Application to Stationary Gaussian Processes
Jingbo Liu, Paul Cuff, Sergio Verdú
We show that for product sources, rate splitting is optimal for secret key agreement using limited one-way communication between two terminals. This yields an alternative informati…
Key Capacity with Limited One-Way Communication for Product Sources
Jingbo Liu, Paul Cuff, Sergio Verdú
We show that for product sources, rate splitting is optimal for secret key agreement using limited one-way communication at two terminals. This yields an alternative proof of the t…
Polynomial complexity of polar codes for non-binary alphabets, key agreement and Slepian-Wolf coding
Jingbo Liu, Emmanuel Abbe
We consider polar codes for memoryless sources with side information and show that the blocklength, construction, encoding and decoding complexities are bounded by a polynomial of…
Robustness of Sparse Recovery via -minimization: A Topological Viewpoint
Jingbo Liu, Jian Jin, Yuantao Gu
A recent trend in compressed sensing is to consider non-convex optimization techniques for sparse recovery. The important case of -minimization has become of particular interest…