Yury Polyanskiy
Professor, Department of Electrical Engineering and Computer Science
Categories
Yury Polyanskiy is a professor in MIT’s Department of Electrical Engineering and Computer Science. He is also a principal investigator with the Laboratory for Information and Decision Systems; the Institute for Data, Systems, and Society; and the Statistics and Data Science Center. His research focuses on questions in information theory, statistics, error-correcting codes, wireless communication and fault-tolerant circuits. Polyanskiy has received an NSF Career Award and an IEEE Information Theory Society Paper Award. He earned an MS in applied mathematics and physics from the Moscow Institute of Physics and Technology, and a PhD in electrical engineering from Princeton University.
Publications
- Sun, Y., Polyanskiy , Y., Uysal-Biyikoglu, E. (2020). Sampling of the Wiener process for remote estimation over a channel with random delay. IEEE Transactions on Information Theory, vol. 66, no. 2, pp. 1118-1135.
-
U. Hadar, J. Liu, Y. Polyanskiy and O. Shayevitz, (2019). Communication complexity of estimating correlations. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 792–803.
-
Polyanskiy, Y., Samorodnitsky, A. (2019). Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube. Journal of Functional Analysis, vol. 277, no. 11.
-
Polyanskiy, Y. (2017). A perspective on massive random-access. IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.
-
Polyanskiy, Y., Suresh, A. T., Wu, Y. (2017). Sample complexity of population recovery. Proceedings of the Conference On Learning Theory (COLT), vol 65:1–30.
Media
- Jan. 11, 2020: MIT News, Sending clearer signals.
- May 10, 2018: MIT News, The tenured engineers of 2018.
- Nov. 22, 2017: MIT News, Gearing up for the internet of things.
- Jan. 31, 2013: EECS News, Polyanskiy is selected for NSF Career Award.