Yury Polyanskiy

Yury Polyanskiy
Professor
(EECS)

Curriculum Vitae
Publications & Preprints
Other

Books, notes, code

Y. Polyanskiy and Y. Wu. "Information Theory: From Coding to Learning," Cambridge University Press, 2023+ (book draft)
This material will be published by Cambridge University Press as "Information Theory" by Yury Polyanskiy and Yihong Wu. This prepublication version is free to view and download for personal use only. Not for redistribution, resale or use in derivative works.
Note that while this version has matching equation numbers, theorems etc, the printed version will have many typos corrected. We recommend using it for thorough reading, while free version could be used for quick reference lookup. © Polyanskiy & Wu 2023
older draft (2022)

Y. Polyanskiy, "Information theory methods in statistics and computer science," (course page) 2019-2020.

Numerical code for finite-blocklength research: "SPECTRE: Short packet communication toolbox," GitHub repository, Dec 2014.
Curious? Check manual.pdf (for up-to-date version: git clone; cd documentation; make manual.pdf)

Publications

Journal Papers and Full Conference Papers

G. Liva and Y. Polyanskiy, "Unsourced multiple access: a coding paradigm for massive random access," Proc. IEEE, 2024 (to appear)
also arxiv:2408.09874, Aug. 2024
G. Bresler, C. Guo, and Y. Polyanskiy, "Thresholds for reconstruction of random hypergraphs from graph projections", Proc. Conf. On Learning Theory (COLT-2024), Jul. 2024
P. Agostini, J.-F. Chamberland, F. Clazzer, J. Dommel, G. Liva, A. Munari, K. Narayanan, Y. Polyanskiy, S. Stanczak and Z. Utkovski, "Evolution of the 5G new radio two-step random access towards 6G unsourced MAC," arXiv:2405.03348, May. 2024
P. R. Gerber, T. Jiang, Y. Polyanskiy, and R. Sun, "Density estimation using the perceptron", arxiv:2312.17701, Dec. 2023
B. Geshkovski, C. Letrouit, Y. Polyanskiy, and P. Rigollet, "A mathematical perspective on Transformers", arxiv:2312.10794, Dec. 2023 (updated Feb. 2024, Aug. 2024)
B. Geshkovski, C. Letrouit, Y. Polyanskiy, and P. Rigollet, "The emergence of clusters in self-attention dynamics", Proc. 37th Adv. in Neural Inform. Proc. Syst. (NeurIPS-2023), Dec. 2023;
also arxiv:2305.05465, May 2023
P. R. Gerber, T. Jiang, Y. Polyanskiy, and R. Sun, "Kernel-based tests for likelihood-free hypothesis testing", Proc. 37th Adv. in Neural Inform. Proc. Syst. (NeurIPS-2023), Dec. 2023;
also arxiv:2308.09043, Aug. 2023 (updated Nov. 2023)
T. Jayashankar, G. Lee, A. Lancho, A. Weiss, Y. Polyanskiy, and G. W. Wornel, "Score-based source separation with applications to digital communication signals", Proc. 37th Adv. in Neural Inform. Proc. Syst. (NeurIPS-2023), Dec. 2023;
also arxiv:2306.14411, Jun. 2023
G. Bresler, C. Guo, and Y. Polyanskiy, "Algorithmic decorrelation and planted clique in dependent random graphs: the case of extra triangles", Proc. 64th Symp. Found. Comp. Sci (FOCS-2023), Nov. 2023;
also arxiv:2305.09995, May 2023
S. Jana, Y. Polyanskiy, A. Teh, and Y. Wu, "Empirical Bayes via ERM and Rademacher complexities: the Poisson model", Proc. Conf. On Learning Theory (COLT-2023), Jul. 2023;
also arxiv:2307.02070, Jul. 2023
P. R. Gerber, Y. Han, and Y. Polyanskiy, "Minimax optimal testing by classification", Proc. Conf. On Learning Theory (COLT-2023), Jul. 2023;
also arxiv:2306.11085, Jun. 2023
Z. Jia, Y. Polyanskiy, and Y. Wu, "Entropic characterization of optimal rates for learning Gaussian mixtures", Proc. Conf. On Learning Theory (COLT-2023), Jul. 2023;
also arxiv:2306.12308, Jun. 2023
Y. Gu and Y. Polyanskiy, "Weak recovery threshold for the hypergraph stochastic block model", Proc. Conf. On Learning Theory (COLT-2023), Jul. 2023;
also arxiv:2303.14689, Mar. 2023
Y. Gu and Y. Polyanskiy, "Uniqueness of BP fixed point for the Potts model and applications to community detection", Proc. Conf. On Learning Theory (COLT-2023), Jul. 2023;
also arxiv:2303.14688, Mar. 2023
A. Block and Y. Polyanskiy, "The sample complexity of approximate rejection sampling with applications to smoothed online learning", Proc. Conf. On Learning Theory (COLT-2023), Jul. 2023;
also arxiv:2302.04658, Feb. 2023 (upd. Feb. 2024). Errata (Feb 2024): Version in COLT proceedings has a mistake in Lemma 27 that propagated to a wrong coefficient in Theorem 3, arXiv version is correct (thanks G. Flamich and W. L. Wells!)
A. Fengler, A. Lancho, K. Narayanan, and Y. Polyanskiy, "On the advantages of asynchrony in the unsourced MAC (extended)," arxiv:2305.06985, May 2023
an abridged version appeared in Proc. 2023 IEEE ISIT, Taiwan, Jun. 2023
P. R. Gerber and Y. Polyanskiy, "Likelihood-free hypothesis testing", IEEE Trans. Inf. Theory, 2024 (to appear)
also arxiv:2211.01126, Nov. 2022 (updated Feb. 2023, Sep. 2023, Jun. 2024)
S. Jana, Y. Polyanskiy, and Y. Wu, "Optimal empirical Bayes estimation for the Poisson model via minimum-distance methods", arxiv:2209.01328, Sep. 2022 (updated Sep. 2023, May 2024)
A. Adler, J. Tang, and Y. Polyanskiy, "Efficient representation of large-alphabet probability distributions", IEEE J. Sel. Areas Inf. Theory, vol. 3, no. 4, pp. 651--663, Dec. 2022
also arxiv:2205.03752, May. 2022 (updated Dec. 2022)
A. Block, Z. Jia, Y. Polyanskiy, and A. Rakhlin, "Rate of convergence of the smoothed empirical Wasserstein distance", arxiv:2205.02128, May. 2022 (updated Aug 2024)
G. Bresler, C. Guo, and Y. Polyanskiy, "Linear programs with polynomial coefficients and applications to 1D cellular automata", arxiv:2204.06357, Apr. 2022
Q. Yu and Y. Polyanskiy "Ising model on locally tree-like graphs: uniqueness of solutions to cavity equations", IEEE Trans. Inf. Theory, vol. 70, no. 3, pp. 1913--1938, Mar. 2024
also arxiv:2211.15242, Feb. 2021 (updated Nov. 2022, Jul. 2023)
J. Tang and Y. Polyanskiy, "Capacity of noisy permutation channels", IEEE Trans. Inf. Theory, vol. 69, no. 7, pp. 4145--4162, Jul. 2023
also arxiv:2111.00559, Nov. 2021
Y. Polyanskiy and Y. Wu, "Sharp regret bounds for empirical Bayes and compound decision problems", 2109.03943, Sep. 2021
A. Block, Z. Jia, Y. Polyanskiy, A. Rakhlin, "Intrinsic dimension estimation using Wasserstein distances", J. Machine Learning Research (JMLR), 23(313):1-37, 2022.
also arxiv:2106.04018, Jun. 2021 (updated Dec. 2021; May 2022)
E. Abbe, E. Cornacchia, Y. Gu and Y. Polyanskiy, "Stochastic block model entropy and broadcasting on trees with survey", Proc. Conf. On Learning Theory (COLT-2021), Aug. 2021; Best Student Paper Award
also arxiv:2101.12601, Jan. 2021
M. Feder and Y. Polyanskiy, "Sequential prediction under log-loss and misspecification,", Proc. Conf. On Learning Theory (COLT-2021), Aug. 2021;
also arxiv:2102.00050, Jan. 2021
A. Makur, E. Mossel and Y. Polyanskiy, "Broadcasting on two-dimensional regular grids", IEEE Trans. Inf. Theory, vol. 68, no.10, pp. 6297--6334, Oct. 2022;
also arxiv:2010.01390, Oct. 2020
O. Ordentlich and Y. Polyanskiy, "Strong data processing constant is achieved by binary inputs", IEEE Trans. Inf. Theory, vol. 68, no.3, pp. 1480--1481, Mar. 2022;
also arxiv:2010.01987, Sep. 2020 (updated Jun. 2021)
Y. Polyanskiy and Y. Wu, "Self-regularizing property of nonparametric maximum likelihood estimator in mixture models " arxiv:2008.08244, Aug. 2020
Y. Polyanskiy and Y. Wu, "Note on approximating the Laplace transform of a Gaussian on a complex disk " arxiv:2008.13372, Aug. 2020
J. Gaudio and Y. Polyanskiy, "Attracting random walks," Elect. J. Probability, vol. 25, no. 73, 2020;
also arxiv:1903.00427, May 2020.
S. Jana, Y. Polyanskiy and Y. Wu, "Extrapolating the profile of a finite population," Proc. Conf. On Learning Theory (COLT-2020), Jul. 2020 ;
also arxiv:2005.10561, May 2020.
Y. Gu and Y. Polyanskiy, "Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems," Commun. Math. Phys., vol. 404, pp. 769-831, Dec. 2023;
also arxiv:2005.05444, May 2020 (updated Nov. 2022).
Z. Goldfeld and Y. Polyanskiy, "The information bottleneck problem and its applications in machine learning," IEEE Journal on Selected Areas in Information Theory, vol. 1, no. 1, pp. 19--38, Apr. 2020;
also arXiv:2004.14941, Apr. 2020
H. Roozbehani and Y. Polyanskiy, "Low density majority codes and the problem of graceful degradation," arxiv:1911.12263, June 2019 (updated Nov. 2019).
Y. Wu, X. Gao, S. Zhou, W. Yang, Y. Polyanskiy, and G. Caire, "Massive access for future wireless communication systems," IEEE Trans. Wireless Comm., vol. 27, no. 4, pp. 148--156, Apr. 2020;
also arxiv:1910.12678, Oct. 2019. (updated Feb. 2020)
O. Ordentlich, Y. Polyanskiy and O. Shayevitz,"A note on the probability of rectangles for correlated binary strings," IEEE Trans. Inf. Theory, vol. 66, no. 12, pp.7878 -- 7886, Dec. 2020;
also arxiv:1909.01221, Sep. 2019. (updated Aug. 2020)
S. Kowshik, K. Andreev, A. Frolov and Y. Polyanskiy, "Energy efficient coded random access for the wireless uplink," IEEE Trans. Comm., vol. 68, no. 8, pp. 4694--4708, Aug. 2020;
also arxiv:1907.09448, July 2019 (updated May 2020).
Z. Goldfeld, K. Greenewald, Y. Polyanskiy and J. Weed, "Convergence of smoothed empirical measures with applications to entropy estimation,," IEEE Trans. Inf. Theory, vol. 66, no. 7, pp. 4368--4391, Jul. 2020;
also arxiv:1905.13576, May 2019.
Y. Polyanskiy and Y. Wu, "Dualizing Le Cam's method for functional estimation, with applications to estimating the unseens " arxiv:1902.05616, Feb. 2019 (updated Dec. 2020).
Y. Kochman, O. Ordentlich and Y. Polyanskiy, "A lower bound on the expected distortion of joint source-channel coding," IEEE Trans. Inf. Theory, vol. 66, no. 8, pp. 4722--4741, Aug. 2020;
also arxiv:1902.07979, Feb. 2019.
U. Hadar, J. Liu, Y. Polyanskiy and O. Shayevitz, "Communication complexity of estimating correlations, " Proc. 51st ACM Symp. on Theory of Comp. (STOC), 2019;
also arxiv:1901.09100, Jan. 2019 (upd. Apr 2019)
S. Kowshik and Y. Polyanskiy, "Fundamental limits of many-user MAC with finite payloads and fading," IEEE Trans. Inf. Theory, vol. 67, no. 9, pp.5853--5884, Sep. 2021;
also arxiv:1901.06732, Jan. 2019. (upd. May 2019, Nov. 2020, Jun. 2021)
A. Bhatt, B. Nazer, O. Ordentlich and Y. Polyanskiy, "Information-distilling quantizers," IEEE Trans. Inf. Theory, vol. 67, no. 4, pp. 2472--2487, Apr. 2021;
also arxiv:1812.03031, Dec. 2018.
A. Makur, E. Mossel and Y. Polyanskiy, "Broadcasting on random directed acyclic graphs," IEEE Trans. Inf. Theory, vol. 66, no. 2, pp. 780-812, Feb. 2020;
also arxiv:1811.03946, Nov. 2018.
Y. Sun, Y. Polyanskiy and E. Uysal-Biyikoglu, , "Sampling of the Wiener process for remote estimation over a channel with random delay," IEEE Trans. Inf. Theory, vol. 66, no. 2, pp. 1118-1135, Feb. 2020;
also arxiv:1707.02531, Nov. 2018.
Z. Goldfeld, E. van den Berg, K. Greenewald, I. Melnyk, N. Nguyen, B. Kingsbury and Y. Polyanskiy, "Estimating information flow in deep neural networks," Proc. 36th Int. Conf. Machine Learning (ICML'2019), Long Beach, CA, June 2019.
also arxiv:1810.05728, Oct. 2018.
Y. Polyanskiy and Y. Wu, "Application of information-percolation method to reconstruction problems on graphs," Math. Stat. Learn., vol. 2, no. 1, pp. 1--24, 2019.
also arxiv:1806.04195, Jun. 2018.
Z. Goldfeld, G. Bresler and Y. Polyanskiy, "Information storage in the stochastic Ising model," IEEE Trans. Inf. Theory, vol. 67, no. 3, pp. 1373--1399, Mar. 2021;
also arxiv:1805.03027, May 2018.
A. Makur, E. Mossel and Y. Polyanskiy, "Broadcasting on bounded degree DAGs," arxiv:1803.07527, Mar. 2018. NOTE: This earlier draft was subsequently split into two papers, see part 1 and part 2.
N. Alon, B. Bukh, and Y. Polyanskiy, "List-decodable zero-rate codes," IEEE Trans. Inf. Theory, vol. 65, no. 3, pp. 1657--1667, Mar. 2019;
also arxiv:1710.10663, Oct. 2017 (updated May 2018).
W. Yang, A. Collins, G. Durisi, Y. Polyanskiy, and H. V. Poor, "Beta-Beta bounds: finite-blocklength analog of the golden formula," IEEE Trans. Inf. Theory, vol. 64, no. 9, pp. 6236--6256, Sep. 2018;
also arxiv:1706.05972, Jun. 2017 (updated Mar 2018).
A. Collins and Y. Polyanskiy, "Coherent multiple-antenna block-fading channels at finite blocklength," IEEE Trans. Inf. Theory, vol. 65, no. 1, pp. 380--405, Jan. 2019;
also arxiv:1704.06962, Apr. 2017 (updated May 2018).
Y. Polyanskiy, A. T. Suresh and Y. Wu, "Sample complexity of population recovery," Proc. Conf. On Learning Theory (COLT-2017), Jul. 2017 ;
also arxiv:1702.05574, Feb. 2017.
Errata (Apr 2020): Earlier versions (incl. the one in proceedings) had a mistake in Prop. 9 that propagated to Theorem 1 (lower bound) and Lemma 12.
M. Dalai and Y. Polyanskiy, "Bounds on the reliability function of typewriter channels," IEEE Trans. Inf. Theory, vol. 64, no. 9, pp. 6208--6222, Sep. 2018;
also arxiv:1702.07703, Feb. 2017 (updated Oct. 2017).
A. Makur and Y. Polyanskiy, "Comparison of channels: criteria for domination by a symmetric channel," IEEE Trans. Inf. Theory, vol. 64, no. 8, pp. 5704--5725, Aug. 2018;
also arxiv:1609.06877, Sep. 2016 (updated Nov. 2017).
Y. Polyanskiy and A. Samorodnitsky, "Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube," J. Functional Analysis, vol. 277, no. 11, Dec. 2019;
also arxiv:1606.07491, Jun. 2016 (updated Oct 2016, Sep 2018, Apr 2019).
J. Tang, D. Wang, Y. Polyanskiy and G. Wornell, "Defect tolerance: fundamental limits and examples," IEEE Trans. Inf. Theory, vol. 64, no. 7, pp. 5240--5260, Jul. 2018;
also arxiv:1610.02578, Feb. 2016 (updated Jul 2016, Oct. 2016, Oct. 2017).
F. P. Calmon, Y. Polyanskiy and Y. Wu, "Strong data processing inequalities for input constrained additive noise channels," IEEE Trans. Inf. Theory, vol. 64, no. 3, pp. 1879--1892, Mar. 2018;
also arxiv:1512.06429, Dec. 2015.
Y. Polyanskiy and Y. Wu, "Strong data-processing inequalities for channels and Bayesian networks," In Convexity, Concentration and Discrete Structures, part of The IMA Volumes in Mathematics and its Applications, vol. 161, Springer-Verlag, New York, 2017;
also arxiv:1508.06025, Aug. 2015 (updated Jan. 2016, May 2016, Jul 2016).
M. Dalai and Y. Polyanskiy, "Bounds for codes on pentagon and other cycles," arxiv:1508.03020, Aug. 2015.
W. Yang, G. Durisi and Y. Polyanskiy, "Minimum energy to send k bits over multiple-antenna fading channels," IEEE Trans. Inf. Theory, vol. 62, no. 12, pp. 6831--6853, Dec. 2016;
also arxiv:1507.03843, Jul. 2015 (updated May 2016 and Dec 2016).
Y. Polyanskiy and Y. Wu, "Wasserstein continuity of entropy and outer bounds for interference channels," IEEE Trans. Inf. Theory, vol. 62, no. 7, pp. 3992--4002, Jul. 2016;
also arxiv:1504.04419.
Y. Polyanskiy, "On metric properties of maps between Hamming spaces and related graph homomorphisms," J. Combin. Theory Ser. A , vol. 145, pp. 227--251, 2017;
also arXiv:1503.02779.
V. Kostina, Y. Polyanskiy and S. Verdú, "Joint source-channel coding with feedback, IEEE Trans. Inf. Theory, vol. 63, no. 6, pp. 3502--3515, Jun 2017;
also arXiv:1501.07640, Jan. 2015 (updated Sep. 2016, Feb. 2017).
G. Durisi, T. Koch, J. Östman, Y. Polyanskiy and W. Yang "Short-packet communications with multiple antennas: transmit diversity, spatial multiplexing, and channel estimation overhead," IEEE Trans. Comm., vol. 64, no. 2, pp. 618--629, Feb. 2016;
also arXiv:1412.7512.
H. Roozbehani and Y. Polyanskiy, "Algebraic methods of classifying directed graphical models," arXiv:1401.5551, Dec. 2014.
Y. Polyanskiy, "Upper bound on list-decoding radius of binary codes," IEEE Trans. Inf. Theory, vol. 62, no. 3, pp. 1119--1128, Mar. 2016;
also arXiv:1409.7765.
W. Yang, G. Caire, G. Durisi and Y. Polyanskiy, "Optimum power control at finite blocklength," IEEE Trans. Inf. Theory, vol. 61, no. 9, pp. 4598--4615, Sep. 2015;
also arXiv:1406.5422.
Y. Polyanskiy and Y. Wu, "Dissipation of information in channels with input constraints," IEEE Trans. Inf. Theory, vol. 62, no. 1, pp. 35--55, Jan. 2016;
also arXiv:1405.3629.
V. Kostina, Y. Polyanskiy and S. Verdú, "Variable-length compression allowing errors," IEEE Trans. Inf. Theory, vol. 61, no. 8, pp.4316--4330, Aug. 2015;
also arXiv:1402.0608.
W. Yang, G. Durisi, T. Koch and Y. Polyanskiy, "Quasi-static multiple-antenna fading channels at finite blocklength," IEEE Trans. Inf. Theory, vol. 60, no. 7, pp.4232--4265, Jul. 2014.
A. Makhdoumi, S.-L. Huang, M. Médard and Y. Polyanskiy, "On Locally Decodable Source Coding," arXiv:1308.5239, Aug. 2013.
Y. Polyanskiy, "Hypercontractivity of spherical averages in Hamming space," SIAM J. Discrete Math., vol. 33, no. 2, pp. 731--754, 2019.
also arxiv:1309.3014, Jun. 2013 (updated Nov. 2015, Jun. 2017, Jun. 2018).
Y. Polyanskiy, "Hypothesis testing via a comparator and hypercontractivity," preprint, Feb. 2013.
Y. Polyanskiy and Y. Wu, "Peak-to-average power ratio of good codes for Gaussian channel," IEEE Trans. Inf. Theory, vol. 60, no. 12, pp. 7655-7660, Dec. 2014;
also arXiv:1302.0084.
Y. Polyanskiy, "Saddle point in the minimax converse for channel coding," IEEE Trans. Inf. Theory, vol. 59, no. 5, pp. 2576-2595, May 2013.
Y. Polyanskiy and S. Verdú, "Empirical distribution of good channel codes with non-vanishing error probability," IEEE Trans. Inf. Theory, vol. 60, no. 1, pp. 5-21, Jan. 2014.
Extended version (with Section VII included): arXiv:1309.0141, Aug. 2013.
Y. Polyanskiy, "Asynchronous communication: exact synchronization, universality, and dispersion," IEEE Trans. Inf. Theory, vol. 59, no. 3, pp. 1256-1270, Mar. 2013.
Y. Polyanskiy, H. V. Poor and S. Verdú, "Feedback in the non-asymptotic regime," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 4903 - 4925, Aug. 2011.
Y. Polyanskiy, H. V. Poor and S. Verdú, "Minimum energy to send k bits through the Gaussian channel with and without feedback," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 4880 - 4902, Aug. 2011.
Y. Polyanskiy, H. V. Poor and S. Verdú, "Dispersion of the Gilbert-Elliot channel," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 1829-1848, Apr. 2011.
Y. Polyanskiy, H. V. Poor and S. Verdú, "Channel coding rate in the finite blocklength regime," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2307-2359, May 2010.
Errata: In (175) the upper limit of summation should be (ℓ-1). (Thanks D. Divsalar!). Analysis of case 1 in Theorem 48 has a gap, fixed by Cao and Tomamichel.
V. Gorokhov, G. Popelnukha, G. Polyanskiy, Y. Polyanskiy, V. Tsukanov, "Switchboard for managing submersible electric motor," Russian Federation Patent N 31061 (RU), Jul. 10, 2003.

Conference Proceedings

T. Jayashankar, B. Kurien, A. Lancho, G. C.F. Lee, Y. Polyanskiy, A. Weiss, and G. W. Wornell, "The data-driven radio frequency signal separation challenge," IEEE ICASSP 2024,, Seoul, Korea, Apr. 2024
A. Fengler, A. Lancho, and Y. Polyanskiy, "Coded orthogonal modulation for the multi-antenna multiple-access channel," IEEE Comm. Theory Workshop (CTW-2023), Taiwan, Jul. 2023
also arxiv:2307.01095, Jul. 2023
A. Teh and Y. Polyanskiy, "Comparing Poisson and Gaussian channels (extended)," 2023 IEEE Int. Symp. Inf. Theory (ISIT), Taipei, Taiwan, Jun. 2023
also arxiv:2306.16735, Jun. 2023
Q. Yu and Y. Polyanskiy, "Uniqueness of distributional BP fixed point in Ising model on trees," 2023 IEEE Int. Symp. Inf. Theory (ISIT), Taipei, Taiwan, Jun. 2023
A. Fengler, A. Lancho, K. Narayanan, and Y. Polyanskiy, "On the advantages of asynchrony in the unsourced MAC," 2023 IEEE Int. Symp. Inf. Theory (ISIT), Taipei, Taiwan, Jun. 2023
G. Lee, A. Weiss, A. Lancho, Y. Polyanskiy, and G. Wornell, "On neural architectures for deep learning-based source separation of co-channel OFDM signals," IEEE ICASSP 2023,, Greece, Jun. 2023
A. Fengler, G. Liva and Y. Polyanskiy, "Sparse graph codes for the 2-user unsourced MAC," 2022 Asilomar Conf. Sig. Syst. Comp., Pacific Grove, CA, USA, Nov. 2022
A. Lancho, A. Weiss, G. Lee, J. Tang, Y. Bu, Y. Polyanskiy, and G. Wornell, "Data-driven blind synchronization and interference rejection for digital communication signals," IEEE GLOBECOM 2022,, Rio de Janeiro, Brazil, Dec. 2022
A. Lancho, A. Fengler, and Y. Polyanskiy "Finite-blocklength results for the A-channel: applications to unsourced random access and group testing," 58th Allerton Conference, Allerton Retreat Center, Monticello, IL, USA, Sep. 2022
also arxiv:2210.01951, Oct. 2022
G. Lee, A. Weiss, A. Lancho, J. Tang, Y. Bu, Y. Polyanskiy, and G. W. Wornell "Exploiting temporal structures of cyclostationary signals for data-driven single-channel source separation,," 32nd IEEE Int. Workshop Machine Learning for Sig. Proc. (MLSP), Xi'an, China, Aug. 2022 (Best student paper award).
J. Tang and Y. Polyanskiy, "Capacity of noisy permutation channels," 2022 IEEE Int. Symp. Inf. Theory (ISIT), Espoo, Finland, Jun. 2022 (Best student paper award).
A. Adler, J. Tang and Y. Polyanskiy, "Efficient representation of large-alphabet probability distributions via arcsinh-compander," 2022 IEEE Int. Symp. Inf. Theory (ISIT), Espoo, Finland, Jun. 2022.
G. Liva and Y. Polyanskiy, "On coding techniques for unsourced multiple-access," 2021 Asilomar Conf. Sig. Syst. Comp., Pacific Grove, CA, USA, Nov. 2021
J.-F. Chamberland, K. Narayanan, and Y. Polyanskiy, "Unsourced multiple access (UMAC): information theory and coding (tutorial)," 2021 IEEE Int. Symp. Inf. Theory (ISIT), Melbourne, Australia, Jul. 2021
A. Adler, J. Tang and Y. Polyanskiy, "Quantization of random distributions under KL divergence," 2021 IEEE Int. Symp. Inf. Theory (ISIT), Melbourne, Australia, Jul. 2021
Errata: In Theorem 1 constants c1 and c2 should depend on alpha; typos in the proof of Prop. 7; Lemma 2(iii) applies to uniform p
A. Makur, E. Mossel and Y. Polyanskiy, "Reconstruction on 2D regular grids," 2021 IEEE Int. Symp. Inf. Theory (ISIT), Melbourne, Australia, Jul. 2021
Q. Yu and Y. Polyanskiy, "Broadcasting on trees near criticality: perturbation theory," 2021 IEEE Int. Symp. Inf. Theory (ISIT), Melbourne, Australia, Jul. 2021
Y. Gu, H. Roozbehani and Y. Polyanskiy, "Broadcasting on trees near criticality," 2020 IEEE Int. Symp. Inf. Theory (ISIT), Los Angeles, CA, USA, Jun. 2020.
also arxiv:2005.07801, May 2020
H. Roozbehani and Y. Polyanskiy, "Graceful degradation over the BEC via non-linear codes," 2020 IEEE Int. Symp. Inf. Theory (ISIT), Los Angeles, CA, USA, Jun. 2020.
Y. Polyanskiy, "Remarks on massive random access (slides)," DLR-MIT-TUM Workshop, DLR, Munich, Germany, Feb. 2020
S. Kowshik, K. Andreev, A. Frolov and Y. Polyanskiy, "Short-packet low-power coded access for massive MAC," 2019 Asilomar Conf. Sig. Syst. Comp., Pacific Grove, CA, USA, Nov. 2019
A. Makur, E. Mossel and Y. Polyanskiy, "Broadcasting on random networks," 2019 IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, Jul. 2019.
S. Kowshik and Y. Polyanskiy, "Quasi-static fading MAC with many users and finite payload," 2019 IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, Jul. 2019.
I. Zadik, Y. Polyanskiy, and C. Thrampoulidis, "Improved bounds on Gaussian MAC and sparse regression via Gaussian inequalities," 2019 IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, Jul. 2019.
S. Kowshik, K. Andreev, A. Frolov and Y. Polyanskiy, "Energy efficient random access for the quasi-static fading MAC," 2019 IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, Jul. 2019.
Z. Goldfeld, K. Greenewald, J. Weed and Y. Polyanskiy, "Optimality of the plug-in estimator for differential entropy estimation under Gaussian convolutions," 2019 IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, Jul. 2019.
U. Hadar, J. Liu, Y. Polyanskiy and O. Shayevitz, "Error exponents in distributed hypothesis testing of correlations," 2019 IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, Jul. 2019.
Y. Kochman, O. Ordentlich and Y. Polyanskiy, "A lower bound on the expected distortion of joint source-channel coding," 2019 IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, Jul. 2019.
W. Huleihel, Y. Polyanskiy and O. Shayevitz, "Relaying one bit across a tandem of binary-symmetric channels," 2019 IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, Jul. 2019.
Z. Goldfeld, G. Bresler and Y. Polyanskiy, "Information storage in the stochastic Ising model at low temperature," 2019 IEEE Int. Symp. Inf. Theory (ISIT), Paris, France, Jul. 2019.
C. Thrampoulidis, I. Zadik and Y. Polyanskiy, "A simple bound on the BER of the MAP decoder for massive MIMO systems," Proc. 2019 IEEE ICASSP, Brighton, UK, May 2019.
Y. Polyanskiy, "Modern aspects of multiple access for IoT (4 lectures)," short course, SkolTech Inst. Of Tech., Moscow, Russia, Jul. 2018.
Y. Polyanskiy, "Information-theoretic perspective on massive multiple-access (tutorial)," 2018 North-American School of Information Theory, Texas A&M University, College Station, TX, May 2018
Z. Goldfeld, G. Bresler and Y. Polyanskiy, "Information storage in the stochastic Ising model at zero temperature," 2018 IEEE Int. Symp. Inf. Theory (ISIT), Vail, CO, USA, Jun. 2018.
O. Ordentlich and Y. Polyanskiy, "Entropy under additive Bernoulli and spherical noises," 2018 IEEE Int. Symp. Inf. Theory (ISIT), Vail, CO, USA, Jun. 2018.
H. Hassani, S. Kudekar, O. Ordentlich, Y. Polyanskiy and R. Urbanke, "Almost optimal scaling of Reed-Muller codes on BEC and BSC channels," 2018 IEEE Int. Symp. Inf. Theory (ISIT), Vail, CO, USA, Jun. 2018.
Y. Kochman, O. Ordentlich and Y. Polyanskiy, "Ozarow-type outer bounds for memoryless sources and channels," 2018 IEEE Int. Symp. Inf. Theory (ISIT), Vail, CO, USA, Jun. 2018.
H. Roozbehani and Y. Polyanskiy, "Input-output distance properties of good linear codes," 2018 IEEE Int. Symp. Inf. Theory (ISIT), Vail, CO, USA, Jun. 2018.
H. Roozbehani and Y. Polyanskiy, "Triangulation codes: a family of non-linear codes with graceful degradation," 2018 Conf. Inform. Sciences and Syst. (CISS), Princeton, NJ, USA, Mar.. 2018.
Y. Polyanskiy, "A perspective on massive random-access," 2017 IEEE Int. Symp. Inf. Theory (ISIT), Aachen, Germany, Jun. 2017.
O. Ordentlich and Y. Polyanskiy, "Low complexity schemes for the random access Gaussian channel," 2017 IEEE Int. Symp. Inf. Theory (ISIT), Aachen, Germany, Jun. 2017.
also see: "Low complexity schemes for the random access Gaussian channel (extended version)."
A. Makur and Y. Polyanskiy, "Less noisy domination by symmetric channels," 2017 IEEE Int. Symp. Inf. Theory (ISIT), Aachen, Germany, Jun. 2017.
B. Nazer, O. Ordentlich, and Y. Polyanskiy, "Information-distilling quantizers," 2017 IEEE Int. Symp. Inf. Theory (ISIT), Aachen, Germany, Jun. 2017.
Y. Sun, Y. Polyanskiy, and E. Uysal-Biyikoglu, "Remote estimation of the Wiener process over a channel with random delay," 2017 IEEE Int. Symp. Inf. Theory (ISIT), Aachen, Germany, Jun. 2017.
J. Tang, D. Wang, Y. Polyanskiy, and G. Wornell, "Defect tolerance: fundamental limits and examples," 2016 IEEE Int. Symp. Inf. Theory (ISIT), Barcelona, Spain, Jul. 2016.
A. Collins and Y. Polyanskiy, "Dispersion of the coherent MIMO block-fading channel," 2016 IEEE Int. Symp. Inf. Theory (ISIT), Barcelona, Spain, Jul. 2016.
Errata: Proposition 3 is incorrect. There are many caids, but for all of them entries are pairwise independent. Consequently, they all achieve the same dispersion. See the journal version for details.
W. Yang, A. Collins, G. Durisi, Y. Polyanskiy, and H. V. Poor, "A beta-beta achievability bound with applications," 2016 IEEE Int. Symp. Inf. Theory (ISIT), Barcelona, Spain, Jul. 2016.
Y. Polyanskiy and Y. Wu, "Converse bounds for interference channels via coupling and proof of Costa's conjecture," 2016 IEEE Int. Symp. Inf. Theory (ISIT), Barcelona, Spain, Jul. 2016.
A. Mazumdar, Y. Polyanskiy, A.S. Rawat and H. Roozbehani, "Distance-preserving maps and combinatorial joint source-channel coding for large alphabets," 2016 IEEE Int. Symp. Inf. Theory (ISIT), Barcelona, Spain, Jul. 2016.
D. Cullina, M. Dalai and Y. Polyanskiy, "Rate-distance tradeoff for codes above graph capacity," 2016 IEEE Int. Symp. Inf. Theory (ISIT), Barcelona, Spain, Jul. 2016.
M. Dalai and Y. Polyanskiy "Bounds on the reliability of a typewriter channel," 2016 IEEE Int. Symp. Inf. Theory (ISIT), Barcelona, Spain, Jul. 2016.
Y. Polyanskiy, "Finite blocklength information theory (tutorial)," 2016 European School of Information Theory (ESIT), Chalmers Univ., Gothenburg, Sweden, Apr. 2016
M. Dalai and Y. Polyanskiy, "Bounds for codes on pentagon and other cycles," 53rd Allerton Conference 2015, Allerton Retreat Center, Monticello, IL, USA, Oct. 2015.
G. Ajjanagadde and Y. Polyanskiy, "Adder MAC and estimates for Rényi entropy," 53rd Allerton Conference 2015, Allerton Retreat Center, Monticello, IL, USA, Oct. 2015.
Y. Polyanskiy, "Upper bound on list-decoding radius of binary codes," 2015 IEEE Int. Symp. Inf. Theory (ISIT), Hong Kong, China, Jun. 2015.
A. Young and Y. Polyanskiy, "Converse and duality results for combinatorial source-channel coding in binary Hamming spaces," 2015 IEEE Int. Symp. Inf. Theory (ISIT), Hong Kong, China, Jun. 2015.
F. Calmon, Y. Polyanskiy and Y. Wu, "Strong data processing inequalities in power-constrained Gaussian channels," 2015 IEEE Int. Symp. Inf. Theory (ISIT), Hong Kong, China, Jun. 2015.
W. Yang, G. Durisi and Y. Polyanskiy, "Minimum energy to send k bits over Rayleigh-fading channels," 2015 IEEE Int. Symp. Inf. Theory (ISIT), Hong Kong, China, Jun. 2015.
V. Kostina, Y. Polyanskiy and S, Verdú, "Joint source-channel coding with feedback," 2015 IEEE Int. Symp. Inf. Theory (ISIT), Hong Kong, China, Jun. 2015.
Y. Polyanskiy and Y. Wu, "Strong data-processing of mutual information: beyond Ahlswede and Gács," 2015 Information Theory and Applications Workshop (ITA) , UCSD, San Diego, CA, USA, Feb. 2015.
Y. Polyanskiy, "Hypercontractivity in Hamming space (Invited)," 52nd Allerton Conference 2014, Allerton Retreat Center, Monticello, IL, USA, Oct. 2014.
A. Collins, Y. Polyanskiy, "Orthogonal designs optimize achievable dispersion for coherent MISO channels," 2014 IEEE Int. Symp. Inf. Theory (ISIT), Honolulu, Hawaii, Jul 2014.
Errata: Proposition 1 erroneously claims that any caid is necessarily jointly Gaussian. In truth, only rows/columns of the caid are guaranteed to be jointly Gaussian. Consequently, proof of Theorem 6 needs to be modified slightly to account for non-jointly Gaussian caids.
V. Kostina, Y. Polyanskiy, S. Verdú, "Variable-length compression allowing errors," 2014 IEEE Int. Symp. Inf. Theory (ISIT), Honolulu, Hawaii, Jul 2014.
D. Wang, Y. Polyanskiy, G. Wornell, "Scalar quantization with noisy partitions and its application to flash ADC design," 2014 IEEE Int. Symp. Inf. Theory (ISIT), Honolulu, Hawaii, Jul 2014.
H. Roozbehani, Y. Polyanskiy, "Algebraic methods of classifying directed graphical models," 2014 IEEE Int. Symp. Inf. Theory (ISIT), Honolulu, Hawaii, Jul 2014.
M. Johnston, E. Modiano, Y. Polyanskiy, "Opportunistic scheduling with limited channel state information: a rate distortion approach," 2014 IEEE Int. Symp. Inf. Theory (ISIT), Honolulu, Hawaii, Jul 2014.
W. Yang, G. Caire, G. Durisi, Y. Polyanskiy, "Finite-blocklength channel coding rate under a long-term power constraint," 2014 IEEE Int. Symp. Inf. Theory (ISIT), Honolulu, Hawaii, Jul 2014.
W. Yang, G. Durisi, T. Koch, Y. Polyanskiy, "Dispersion of quasi-static MIMO fading channels via Stokes' theorem," 2014 IEEE Int. Symp. Inf. Theory (ISIT), Honolulu, Hawaii, Jul 2014.
Y. Polyanskiy and Y. Wu, "Dissipation of information in channels with input constraints," Theory Group Seminar, Microsoft Research, Redmond, WA, May 2014.
W. Gao and Y. Polyanskiy, "On the bit error rate of repeated error-correcting codes," 48th Conference on Information Sciences and Systems (CISS) 2014, Princeton, NJ, USA, Mar 2014.
Y. Polyanskiy, "On dispersion of compound DMCs (Invited)," 51st Allerton Conference 2013, Allerton Retreat Center, Monticello, IL, USA, Oct. 2013.
Y. Polyanskiy, "Finite blocklength methods in channel coding (tutorial)," Part of the tutorial delivered with S. Verdú at 2013 IEEE Int. Symp. Inf. Theory (ISIT), Istanbul, Turkey, Jul 2013.
W. Yang, G. Durisi, T. Koch, Y. Polyanskiy, "Quasi-static SIMO fading channels at finite blocklength," 2013 IEEE Int. Symp. Inf. Theory (ISIT), Istanbul, Turkey, Jul 2013.
A. Mazumdar, Y. Polyanskiy, B. Saha, "On Chebyshev radius of a set in Hamming space and the closest string problem," 2013 IEEE Int. Symp. Inf. Theory (ISIT), Istanbul, Turkey, Jul 2013.
Errata: Results in Section II.A (in particular Theorem 1) are correct, but trivial: taking set S to be the entire space shows Jung constant of Hamming space equals 2 for all dimensions n.
A. Andoni, H. L. Nguyen, Y. Polyanskiy, Y. Wu, "Tight lower bound for linear sketches of moments," 40th Internat. Coll. Automata, Languages, and Programming (ICALP-2013), Riga, Latvia, Jul 2013.
Y. Polyanskiy, "Lp-norms of codewords from capacity and dispersion-achieving Gaussian codes (Invited)," 50th Allerton Conference 2012, Allerton Retreat Center, Monticello, IL, USA, Oct. 2012.
Y. Kochman, A. Mazumdar, Y. Polyanskiy, "Results on combinatorial joint source-channel coding (Invited)," 2012 Inf. Theory Workshop (ITW), Lausanne, Switzerland, Sep 2012.
Errata: W. Gao and Y. Polyanskiy found Theorem 7 to be in error (Apr. 2013).
W. Yang, G. Durisi, T. Koch, Y. Polyanskiy, "Diversity versus channel knowledge at finite block-length," 2012 Inf. Theory Workshop (ITW), Lausanne, Switzerland, Sep 2012.
Y. Kochman, A. Mazumdar, Y. Polyanskiy, "The adversarial joint source-channel problem," 2012 IEEE Int. Symp. Inf. Theory (ISIT), Cambridge, MA, Jul 2012.
Y. Polyanskiy, "Hypothesis testing via a comparator," 2012 IEEE Int. Symp. Inf. Theory (ISIT), Cambridge, MA, Jul 2012.
Y. Polyanskiy, "On asynchronous capacity and dispersion (Invited)," 46th Conference on Information Sciences and Systems (CISS) 2012, Princeton, NJ, USA, Mar 2012.
Y. Polyanskiy and S. Verdú, "Relative entropy at the channel output of a capacity-achieving code," 49th Allerton Conference 2011, Allerton Retreat Center, Monticello, IL, USA, Sep. 2011.
Y. Polyanskiy and S. Verdú, "Scalar coherent fading channel: dispersion analysis," 2011 IEEE Int. Symp. Inf. Theory (ISIT), St. Petersburg, Russia, Aug. 2011.
Y. Polyanskiy and S. Verdú, "Binary hypothesis testing with feedback (slides)," 2011 Information Theory and Applications Workshop (ITA) , UCSD, San Diego, CA, USA, Feb. 2011.
Y. Polyanskiy and S. Verdú, "Arimoto channel coding converse and Rényi divergence," 48th Allerton Conference 2010, Allerton Retreat Center, Monticello, IL, USA, Sep. 2010.
Errata: Typo in Theorem 5.1. The correct version is "concave in P_X and convex in P_{Y|X}". (Thanks Siu-Wai Ho!)
Y. Polyanskiy and S. Verdú, "Channel dispersion and moderate deviations limits for memoryless channels," 48th Allerton Conference 2010, Allerton Retreat Center, Monticello, IL, USA, Sep. 2010.
Y. Polyanskiy, H. V. Poor and S. Verdú, "Memoryless channels: the benefits of feedback in the non-asymptotic regime (poster)," 2010 School of Inf. Theory, Univ. of Southern California, Los Angeles, CA, USA, Aug. 2010.
Y. Polyanskiy, H. V. Poor and S. Verdú, "Variable-length coding with feedback in the non-asymptotic regime," 2010 IEEE Int. Symp. Inf. Theory (ISIT), Austin, TX, USA, Jun. 2010 (Best student paper award).
Y. Polyanskiy, H. V. Poor and S. Verdú, "Minimum energy to send k bits with and without feedback," 2010 IEEE Int. Symp. Inf. Theory (ISIT), Austin, TX, USA, Jun. 2010.
Y. Polyanskiy, H. V. Poor and S. Verdú, "Finite blocklength results in channel coding (poster)," 2009 School of Inf. Theory, Northwestern Univ., IL, USA, Aug. 2009.
Y. Polyanskiy, H. V. Poor and S. Verdú, "Dispersion of Gaussian channels," 2009 IEEE Int. Symp. Inf. Theory (ISIT), Seoul, Korea, Jul. 2009.
Y. Polyanskiy, H. V. Poor and S. Verdú, "Dispersion of the Gilbert-Elliot channel," 2009 IEEE Int. Symp. Inf. Theory (ISIT), Seoul, Korea, Jul. 2009.
Y. Polyanskiy, H. V. Poor and S. Verdú, "New channel coding achievability bounds," 2008 IEEE Int. Symp. Inf. Theory (ISIT), Toronto, Canada, Jun. 2008 (Best student paper award).

Thesis

Y. Polyanskiy, Channel coding: non-asymptotic fundamental limits, Ph.D. dissertation, Princeton University, Sep. 2010.

Old preprints, lecture notes, etc

Y. Polyanskiy, Y. Wu, "Lecture notes on Information Theory," MIT (6.441), UIUC (ECE 563), Yale (STAT 664), 2012-2017.
Y. Polyanskiy, "Channel automorphisms and categories in information theory", 2008.
Y. Polyanskiy, "Notes on optimal stopping of Markov processes", 2009.
Y. Polyanskiy, "Notes on entropy rate of hidden Markov chains", 2008-2010.

MIT Accessibility Page

Yury Polyanskiy Professor (EECS)