Thomas A. Courtade

CoRR, 2024

Rigid characterizations of probability measures through independence, with applications.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Mean Estimation Under Heterogeneous Privacy Demands.

[BibT_eX]

[DOI]

Syomantak Chaudhuri

Konstantin Miagkov

CoRR, 2023

Online Pricing for Multi-User Multi-Item Markets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Mean Estimation Under Heterogeneous Privacy: Some Privacy Can Be Free.

[BibT_eX]

[DOI]

Syomantak Chaudhuri

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Entropy Inequalities and Gaussian Comparisons.

[BibT_eX]

[DOI]

Efe Aras

CoRR, 2022

Equality cases in the Anantharam-Jog-Nair inequality.

[BibT_eX]

[DOI]

Efe Aras

Albert Zhang

CoRR, 2022

2021

Sharp Maximum-Entropy Comparisons.

[BibT_eX]

[DOI]

Efe Aras

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Smoothing Brascamp-Lieb Inequalities and Strong Converses of Coding Theorems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Utility-based Resource Allocation and Pricing for Serverless Computing.

[BibT_eX]

[DOI]

CoRR, 2020

Serverless Straggler Mitigation using Local Error-Correcting Codes.

[BibT_eX]

[DOI]

CoRR, 2020

Minimax Bounds for Generalized Linear Models.

[BibT_eX]

[DOI]

Kuan-Yun Lee

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Linear Models are Most Favorable among Generalized Linear Models.

[BibT_eX]

[DOI]

Kuan-Yun Lee

Proceedings of the IEEE International Symposium on Information Theory, 2020

Serverless Straggler Mitigation using Error-Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Distributed Computing Systems, 2020

OverSketched Newton: Fast Convex Optimization for Serverless Systems.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2019

Euclidean Forward-Reverse Brascamp-Lieb Inequalities: Finiteness, Structure and Extremals.

[BibT_eX]

[DOI]

Jingbo Liu

CoRR, 2019

Transportation Proof of an inequality by Anantharam, Jog and Nair.

[BibT_eX]

[DOI]

CoRR, 2019

A Family of Bayesian Cramér-Rao Bounds, and Consequences for Log-Concave Priors.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery.

[BibT_eX]

[DOI]

Martin J. Wainwright

IEEE Trans. Inf. Theory, 2018

The Effect of Local Decodability Constraints on Variable-Length Compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Counterexample to the Vector Generalization of Costa's Entropy Power Inequality, and Partial Resolution.

[BibT_eX]

[DOI]

Guangyue Han

Yaochen Wu

IEEE Trans. Inf. Theory, 2018

Quantitative Stability of the Entropy Power Inequality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

A Strong Entropy Power Inequality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

A Forward-Reverse Brascamp-Lieb Inequality: Entropic Duality and Gaussian Optimality.

[BibT_eX]

[DOI]

Entropy, 2018

Bounds on the Poincaré constant for convolution measures.

[BibT_eX]

[DOI]

CoRR, 2018

A Quantitative Entropic CLT for Radially Symmetric Random Vectors.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

OverSketch: Approximate Matrix Multiplication for the Cloud.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

2017

Principles and Applications of Science of Information.

[BibT_eX]

[DOI]

Proc. IEEE, 2017

Worst-case vs Average-case Design for Estimation from Fixed Pairwise Comparisons.

[BibT_eX]

[DOI]

CoRR, 2017

Information-Theoretic Perspectives on Brascamp-Lieb Inequality and Its Reverse.

[BibT_eX]

[DOI]

CoRR, 2017

A Counterexample to the Vector Generalization of Costa's EPI, and Partial Resolution.

[BibT_eX]

[DOI]

Guangyue Han

Yaochen Wu

CoRR, 2017

Existence of Stein Kernels under a Spectral Gap, and Discrepancy Bound.

[BibT_eX]

[DOI]

CoRR, 2017

Novel probabilistic models of spatial genetic ancestry with applications to stratification correction in genome-wide association studies.

[BibT_eX]

[DOI]

Bioinform., 2017

Denoising linear models with permuted data.

[BibT_eX]

[DOI]

Martin J. Wainwright

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Wasserstein stability of the entropy power inequality for log-concave random vectors.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Concavity of entropy power: Equivalent formulations and generalizations.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Fundamental Limits of Genome Assembly Under an Adversarial Erasure Model.

[BibT_eX]

[DOI]

Ilan Shomorony

David Tse

IEEE Trans. Mol. Biol. Multi Scale Commun., 2016

Coded Cooperative Data Exchange for a Secret Key.

[BibT_eX]

[DOI]

Thomas R. Halford

IEEE Trans. Inf. Theory, 2016

Design of Energy- and Cost-Efficient Massive MIMO Arrays.

[BibT_eX]

[DOI]

Antonio Puglielli

Andrew Townley

Greg LaCaille

Vladimir M. Milovanovic

Pengpeng Lu

Konstantin Trotskovsky

Proc. IEEE, 2016

Wasserstein Stability of the Entropy Power Inequality for Log-Concave Densities.

[BibT_eX]

[DOI]

CoRR, 2016

Links between the Logarithmic Sobolev Inequality and the convolution inequalities for Entropy and Fisher Information.

[BibT_eX]

[DOI]

CoRR, 2016

Entropy Jumps for Radially Symmetric Random Vectors.

[BibT_eX]

[DOI]

CoRR, 2016

Monotonicity of entropy and Fisher information: a quick proof via maximal correlation.

[BibT_eX]

[DOI]

Commun. Inf. Syst., 2016

Information-optimal genome assembly via sparse read-overlap graphs.

[BibT_eX]

[DOI]

Bioinform., 2016

Partial DNA assembly: A rate-distortion perspective.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Brascamp-Lieb inequality and its reverse: An information theoretic view.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Smoothing Brascamp-Lieb inequalities and strong converses for common randomness generation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Overlap-based genome assembly from variable-length reads.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Strengthening the entropy power inequality.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Linear regression with an unknown permutation: Statistical and computational limits.

[BibT_eX]

[DOI]

Martin J. Wainwright

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015

Energy-Efficient Group Key Agreement for Wireless Networks.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2015

Justification of Logarithmic Loss via the Benefit of Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Compression for Quadratic Similarity Queries.

[BibT_eX]

[DOI]

Amir Ingber

IEEE Trans. Inf. Theory, 2015

CommentsComments on "Canalizing Boolean Functions Maximize Mutual Information".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Do read errors matter for genome assembly?

[BibT_eX]

[DOI]

Ilan Shomorony

David N. C. Tse

Proceedings of the IEEE International Symposium on Information Theory, 2015

Compressing sparse sequences under local decodability constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Approximate capacity of Gaussian relay networks: Is a sublinear gap to the cutset bound plausible?

[BibT_eX]

[DOI]

Ayfer Özgür

Proceedings of the IEEE International Symposium on Information Theory, 2015

A scalable massive MIMO array architecture based on common modules.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communication, 2015

2014

Information Measures: The Curious Case of the Binary Alphabet.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Coded Cooperative Data Exchange in Multihop Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Multiterminal Source Coding Under Logarithmic Loss.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Which Boolean Functions Maximize Mutual Information on Noisy Inputs?

[BibT_eX]

[DOI]

Gowtham Ramani Kumar

IEEE Trans. Inf. Theory, 2014

Enhanced Precision Through Multiple Reads for LDPC Decoding in Flash Memories.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2014

Information divergences and the curious case of the binary alphabet.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Variable-length lossy compression and channel coding: Non-asymptotic converses via cumulant generating functions.

[BibT_eX]

[DOI]

Sergio Verdú

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Cumulant generating function of codeword lengths in optimal lossless compression.

[BibT_eX]

[DOI]

Sergio Verdú

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

An extremal inequality for long Markov chains.

[BibT_eX]

[DOI]

Jiantao Jiao

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

Optimal Encoding for Discrete Degraded Broadcast Channels.

[BibT_eX]

[DOI]

Bike Xie

IEEE Trans. Inf. Theory, 2013

Outer Bounds for Multiterminal Source Coding based on Maximal Correlation

[BibT_eX]

[DOI]

CoRR, 2013

Which Boolean functions are most informative?

[BibT_eX]

[DOI]

Gowtham Ramani Kumar

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Compression for exact match identification.

[BibT_eX]

[DOI]

Amir Ingber

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Outer bounds for multiterminal source coding via a strong data processing inequality.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Quadratic Similarity Queries on Compressed Data.

[BibT_eX]

[DOI]

Amir Ingber

Proceedings of the 2013 Data Compression Conference, 2013

Energy-efficient, secure group key agreement for ad hoc networks.

[BibT_eX]

[DOI]

Thomas R. Halford

Keith M. Chugg

Proceedings of the IEEE Conference on Communications and Network Security, 2013

2012

Two Problems in Multiterminal Information Theory.

[BibT_eX]

[DOI]

PhD thesis, 2012

LDPC Decoding with Limited-Precision Soft Information in Flash Memories

[BibT_eX]

[DOI]

CoRR, 2012

The user capacity of barrage relay networks.

[BibT_eX]

[DOI]

Thomas R. Halford

Kurt A. Turck

Proceedings of the 31st IEEE Military Communications Conference, 2012

Information masking and amplification: The source coding setting.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Optimal Allocation of Redundancy Between Packet-Level Erasure Coding and Physical-Layer Channel Coding in Fading Channels.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2011

Designing Nonlinear Turbo Codes with a Target Ones Density

[BibT_eX]

[DOI]

CoRR, 2011

Superposition coding to support multiple streams, priorities, and channel capacities in the context of GMSK.

[BibT_eX]

[DOI]

Jiadong Wang

Proceedings of the MILCOM 2011, 2011

Multiterminal source coding with an entropy-based distortion measure.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Soft Information for LDPC Decoding in Flash: Mutual-Information Optimized Quantization.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2011

Minimizing weighted sum finish time for one-to-many file transfer in peer-to-peer networks.

[BibT_eX]

[DOI]

Bike Xie

Mihaela van der Schaar

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Weighted universal recovery, practical secrecy, and an efficient algorithm for solving both.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

A deterministic approach to rate-compatible fountain communication.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2010

Efficient universal recovery in broadcast networks.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009

A Cross-Layer Perspective on Rateless Coding for Wireless Channels.

[BibT_eX]

[DOI]