Yury Polyanskiy

Orcid: 0000-0002-2109-0979

According to our database1, Yury Polyanskiy authored at least 158 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations.
IEEE Trans. Inf. Theory, 2024

2023
Capacity of Noisy Permutation Channels.
IEEE Trans. Inf. Theory, July, 2023

A mathematical perspective on Transformers.
CoRR, 2023

Coded Orthogonal Modulation for the Multi-Antenna Multiple-Access Channel.
CoRR, 2023

Comparing Poisson and Gaussian channels (extended).
CoRR, 2023

Score-based Source Separation with Applications to Digital Communication Signals.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

The emergence of clusters in self-attention dynamics.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Kernel-Based Tests for Likelihood-Free Hypothesis Testing.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Coded Orthogonal Modulation for the Multi-Antenna MAC.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

Uniqueness of Distributional BP Fixed Point in Ising Model on Trees.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Comparing Poisson and Gaussian channels.
Proceedings of the IEEE International Symposium on Information Theory, 2023

On the Advantages of Asynchrony in the Unsourced MAC.
Proceedings of the IEEE International Symposium on Information Theory, 2023

On Neural Architectures for Deep Learning-Based Source Separation of Co-Channel OFDM Signals.
Proceedings of the IEEE International Conference on Acoustics, 2023

Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Entropic characterization of optimal rates for learning Gaussian mixtures.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Empirical Bayes via ERM and Rademacher complexities: the Poisson model.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Weak Recovery Threshold for the Hypergraph Stochastic Block Model.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Uniqueness of BP fixed point for the Potts model and applications to community detection.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Minimax optimal testing by classification.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

The Sample Complexity of Approximate Rejection Sampling With Applications to Smoothed Online Learning.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Efficient Representation of Large-Alphabet Probability Distributions.
IEEE J. Sel. Areas Inf. Theory, December, 2022

Strong Data Processing Constant Is Achieved by Binary Inputs.
IEEE Trans. Inf. Theory, 2022

Broadcasting on Two-Dimensional Regular Grids.
IEEE Trans. Inf. Theory, 2022

Intrinsic Dimension Estimation Using Wasserstein Distance.
J. Mach. Learn. Res., 2022

Ising Model on Locally Tree-like Graphs: Uniqueness of Solutions to Cavity Equations.
CoRR, 2022

Likelihood-free hypothesis testing.
CoRR, 2022

Rate of convergence of the smoothed empirical Wasserstein distance.
CoRR, 2022

Linear Programs with Polynomial Coefficients and Applications to 1D Cellular Automata.
CoRR, 2022

Exploiting Temporal Structures of Cyclostationary Signals for Data-Driven Single-Channel Source Separation.
Proceedings of the 32nd IEEE International Workshop on Machine Learning for Signal Processing, 2022

Efficient Representation of Large-Alphabet Probability Distributions via Arcsinh-Compander.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Data-Driven Blind Synchronization and Interference Rejection for Digital Communication Signals.
Proceedings of the IEEE Global Communications Conference, 2022

Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing.
Proceedings of the 58th Annual Allerton Conference on Communication, 2022

Sparse Graph Codes for the 2-User Unsourced MAC.
Proceedings of the 56th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2022, Pacific Grove, CA, USA, October 31, 2022

2021
Fundamental Limits of Many-User MAC With Finite Payloads and Fading.
IEEE Trans. Inf. Theory, 2021

Information Storage in the Stochastic Ising Model.
IEEE Trans. Inf. Theory, 2021

Information-Distilling Quantizers.
IEEE Trans. Inf. Theory, 2021

Sharp regret bounds for empirical Bayes and compound decision problems.
CoRR, 2021

Intrinsic Dimension Estimation.
CoRR, 2021

Broadcasting on Trees Near Criticality: Perturbation Theory.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Reconstruction on 2D Regular Grids.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Quantization of Random Distributions under KL Divergence.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Sequential prediction under log-loss and misspecification.
Proceedings of the Conference on Learning Theory, 2021

Stochastic block model entropy and broadcasting on trees with survey.
Proceedings of the Conference on Learning Theory, 2021

On Coding Techniques for Unsourced Multiple-Access.
Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers, 2021

2020
Massive Access for Future Wireless Communication Systems.
IEEE Wirel. Commun., 2020

Sampling of the Wiener Process for Remote Estimation Over a Channel With Random Delay.
IEEE Trans. Inf. Theory, 2020

A Note on the Probability of Rectangles for Correlated Binary Strings.
IEEE Trans. Inf. Theory, 2020

Broadcasting on Random Directed Acyclic Graphs.
IEEE Trans. Inf. Theory, 2020

A Lower Bound on the Expected Distortion of Joint Source-Channel Coding.
IEEE Trans. Inf. Theory, 2020

Convergence of Smoothed Empirical Measures With Applications to Entropy Estimation.
IEEE Trans. Inf. Theory, 2020

Energy Efficient Coded Random Access for the Wireless Uplink.
IEEE Trans. Commun., 2020

The Information Bottleneck Problem and its Applications in Machine Learning.
IEEE J. Sel. Areas Inf. Theory, 2020

Non-linear Log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems.
CoRR, 2020

Graceful degradation over the BEC via non-linear codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Broadcasting on trees near criticality.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Extrapolating the profile of a finite population.
Proceedings of the Conference on Learning Theory, 2020

2019
Coherent Multiple-Antenna Block-Fading Channels at Finite Blocklength.
IEEE Trans. Inf. Theory, 2019

List-Decodable Zero-Rate Codes.
IEEE Trans. Inf. Theory, 2019

Hypercontractivity of Spherical Averages in Hamming Space.
SIAM J. Discret. Math., 2019

Low density majority codes and the problem of graceful degradation.
CoRR, 2019

Dualizing Le Cam's method, with applications to estimating the unseens.
CoRR, 2019

Low Complexity Energy Efficient Random Access Scheme for the Asynchronous Fading MAC.
Proceedings of the 90th IEEE Vehicular Technology Conference, 2019

Communication complexity of estimating correlations.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Improved bounds on Gaussian MAC and sparse regression via Gaussian inequalities.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Broadcasting on Random Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Quasi-static fading MAC with many users and finite payload.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Energy efficient random access for the quasi-static fading MAC.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Relaying One Bit Across a Tandem of Binary-Symmetric Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Error Exponents in Distributed Hypothesis Testing of Correlations.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Optimality of the Plug-in Estimator for Differential Entropy Estimation under Gaussian Convolutions.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Information Storage in the Stochastic Ising Model at Low Temperature.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Estimating Information Flow in Deep Neural Networks.
Proceedings of the 36th International Conference on Machine Learning, 2019

A Simple Bound on the BER of the Map Decoder for Massive MIMO Systems.
Proceedings of the IEEE International Conference on Acoustics, 2019

Short-Packet Low-Power Coded Access for Massive MAC.
Proceedings of the 53rd Asilomar Conference on Signals, Systems, and Computers, 2019

2018
Defect Tolerance: Fundamental Limits and Examples.
IEEE Trans. Inf. Theory, 2018

Comparison of Channels: Criteria for Domination by a Symmetric Channel.
IEEE Trans. Inf. Theory, 2018

Bounds on the Reliability Function of Typewriter Channels.
IEEE Trans. Inf. Theory, 2018

Strong Data Processing Inequalities for Input Constrained Additive Noise Channels.
IEEE Trans. Inf. Theory, 2018

Beta-Beta Bounds: Finite-Blocklength Analog of the Golden Formula.
IEEE Trans. Inf. Theory, 2018

Estimating Information Flow in Neural Networks.
CoRR, 2018

Application of information-percolation method to reconstruction problems on graphs.
CoRR, 2018

Broadcasting on Bounded Degree DAGs.
CoRR, 2018

Input-Output Distance Properties of Good Linear Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Entropy Under Additive Bernoulli and Spherical Noises.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Ozarow- Type Outer Bounds for Memoryless Sources and Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Information Storage in the Stochastic Ising Model at Zero Temperature.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Joint Source-Channel Coding With Feedback.
IEEE Trans. Inf. Theory, 2017

On metric properties of maps between Hamming spaces and related graph homomorphisms.
J. Comb. Theory, Ser. A, 2017

Bounds on the reliability of typewriter channels.
CoRR, 2017

Remote estimation of the Wiener process over a channel with random delay.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

A perspective on massive random-access.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Low complexity schemes for the random access Gaussian channel.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Information-distilling quantizers.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Less noisy domination by symmetric channels.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Sample complexity of population recovery.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
Minimum Energy to Send $k$ Bits Over Multiple-Antenna Fading Channels.
IEEE Trans. Inf. Theory, 2016

Upper Bound on List-Decoding Radius of Binary Codes.
IEEE Trans. Inf. Theory, 2016

Wasserstein Continuity of Entropy and Outer Bounds for Interference Channels.
IEEE Trans. Inf. Theory, 2016

Dissipation of Information in Channels With Input Constraints.
IEEE Trans. Inf. Theory, 2016

Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels.
IEEE Trans. Commun., 2016

Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube.
CoRR, 2016

A beta-beta achievability bound with applications.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Converse bounds for interference channels via coupling and proof of Costa's conjecture.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Distance preserving maps and combinatorial joint source-channel coding for large alphabets.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Bounds on the reliability of a typewriter channel.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Rate-distance tradeoff for codes above graph capacity.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Dispersion of the coherent MIMO block-fading channel.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Optimum Power Control at Finite Blocklength.
IEEE Trans. Inf. Theory, 2015

Variable-Length Compression Allowing Errors.
IEEE Trans. Inf. Theory, 2015

A note on the strong data-processing inequalities in Bayesian networks.
CoRR, 2015

Joint source-channel coding with feedback (extended).
CoRR, 2015

Bounds for codes on pentagon and other cycles.
CoRR, 2015

Transmitting k samples over the Gaussian channel: Energy-distortion tradeoff.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Converse and duality results for combinatorial source-channel coding in binary Hamming spaces.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Minimum energy to send k bits over Rayleigh-fading channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Strong data processing inequalities in power-constrained Gaussian channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On locally decodable source coding.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

Adder MAC and estimates for Rényi entropy.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength.
IEEE Trans. Inf. Theory, 2014

Empirical Distribution of Good Channel Codes With Nonvanishing Error Probability.
IEEE Trans. Inf. Theory, 2014

Peak-to-Average Power Ratio of Good Codes for Gaussian Channel.
IEEE Trans. Inf. Theory, 2014

Variable-length compression allowing errors (extended).
CoRR, 2014

Short-Packet Communications with Multiple Antennas: Transmit Diversity, Spatial Multiplexing, and Channel Estimation Overhead.
CoRR, 2014

Dispersion of quasi-static MIMO fading channels via Stokes' theorem.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Finite-blocklength channel coding rate under a long-term power constraint.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Scalar quantization with noisy partitions and its application to Flash ADC design.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Algebraic methods of classifying directed graphical models.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Opportunistic scheduling with limited channel state information: A rate distortion approach.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Orthogonal designs optimize achievable dispersion for coherent MISO channels.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the bit error rate of repeated error-correcting codes.
Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014

2013
Saddle Point in the Minimax Converse for Channel Coding.
IEEE Trans. Inf. Theory, 2013

Asynchronous Communication: Exact Synchronization, Universality, and Dispersion.
IEEE Trans. Inf. Theory, 2013

Quasi-Static MIMO Fading Channels at Finite Blocklength.
CoRR, 2013

Empirical distribution of good channel codes with non-vanishing error probability (extended version).
CoRR, 2013

Block-Fading Channels at Finite Blocklength.
Proceedings of the ISWCS 2013, 2013

Quasi-static SIMO fading channels at finite blocklength.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On Chebyshev radius of a set in Hamming space and the closest string problem.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Tight Lower Bound for Linear Sketches of Moments.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

On dispersion of compound DMCs.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Diversity versus channel knowledge at finite block-length.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Results on combinatorial joint source-channel coding.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Hypothesis testing via a comparator.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

The adversarial joint source-channel problem.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On asynchronous capacity and dispersion.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

ℓp-norms of codewords from capacity- and dispersion-achieveing Gaussian codes.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Feedback in the Non-Asymptotic Regime.
IEEE Trans. Inf. Theory, 2011

Minimum Energy to Send k Bits Through the Gaussian Channel With and Without Feedback.
IEEE Trans. Inf. Theory, 2011

Dispersion of the Gilbert-Elliott Channel.
IEEE Trans. Inf. Theory, 2011

Scalar coherent fading channel: Dispersion analysis.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Relative entropy at the channel output of a capacity-achieving code.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Channel coding rate in the finite blocklength regime.
IEEE Trans. Inf. Theory, 2010

Variable-length coding with feedback in the non-asymptotic regime.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Minimum energy to send k bits with and without feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Channel dispersion and moderate deviations limits for memoryless channels.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

Arimoto channel coding converse and Rényi divergence.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Dispersion of Gaussian channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
New channel coding achievability bounds.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008


  Loading...