Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYury Polyanskiy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j42]Jennifer Tang
, Yury Polyanskiy:
Capacity of Noisy Permutation Channels. IEEE Trans. Inf. Theory 69(7): 4145-4162 (2023)- [c94]Adam Block, Yury Polyanskiy:
The Sample Complexity of Approximate Rejection Sampling With Applications to Smoothed Online Learning. COLT 2023: 228-273 - [c93]Yuzhou Gu, Yury Polyanskiy:
Uniqueness of BP fixed point for the Potts model and applications to community detection. COLT 2023: 837-884 - [c92]Yuzhou Gu, Yury Polyanskiy:
Weak Recovery Threshold for the Hypergraph Stochastic Block Model. COLT 2023: 885-920 - [c91]Zeyu Jia, Yury Polyanskiy, Yihong Wu:
Entropic characterization of optimal rates for learning Gaussian mixtures. COLT 2023: 4296-4335 - [c90]Soham Jana, Yury Polyanskiy, Anzo Z. Teh, Yihong Wu:
Empirical Bayes via ERM and Rademacher complexities: the Poisson model. COLT 2023: 5199-5235 - [c89]Patrik R. Gerber, Yanjun Han, Yury Polyanskiy:
Minimax optimal testing by classification. COLT 2023: 5395-5432 - [c88]Gary C. F. Lee, Amir Weiss, Alejandro Lancho, Yury Polyanskiy, Gregory W. Wornell:
On Neural Architectures for Deep Learning-Based Source Separation of Co-Channel OFDM Signals. ICASSP 2023: 1-5 - [c87]Anzo Teh, Yury Polyanskiy:
Comparing Poisson and Gaussian channels. ISIT 2023: 36-41 - [c86]Qian Yu, Yury Polyanskiy:
Uniqueness of Distributional BP Fixed Point in Ising Model on Trees. ISIT 2023: 2476-2481 - [c85]Alexander Fengler, Alejandro Lancho, Krishna Narayanan, Yury Polyanskiy:
On the Advantages of Asynchrony in the Unsourced MAC. ISIT 2023: 2523-2528 - [c84]Alexander Fengler, Alejandro Lancho, Yury Polyanskiy:
Coded Orthogonal Modulation for the Multi-Antenna MAC. ISTC 2023: 1-5 - [i82]Adam Block, Yury Polyanskiy:
The Sample Complexity of Approximate Rejection Sampling with Applications to Smoothed Online Learning. CoRR abs/2302.04658 (2023) - [i81]Gary C. F. Lee, Amir Weiss, Alejandro Lancho, Yury Polyanskiy, Gregory W. Wornell:
On Neural Architectures for Deep Learning-based Source Separation of Co-Channel OFDM Signals. CoRR abs/2303.06438 (2023) - [i80]Yuzhou Gu, Yury Polyanskiy:
Uniqueness of BP fixed point for the Potts model and applications to community detection. CoRR abs/2303.14688 (2023) - [i79]Yuzhou Gu, Yury Polyanskiy:
Weak Recovery Threshold for the Hypergraph Stochastic Block Model. CoRR abs/2303.14689 (2023) - [i78]Borjan Geshkovski, Cyril Letrouit, Yury Polyanskiy, Philippe Rigollet:
The emergence of clusters in self-attention dynamics. CoRR abs/2305.05465 (2023) - [i77]Alexander Fengler, Alejandro Lancho, Krishna Narayanan, Yury Polyanskiy:
On the Advantages of Asynchrony in the Unsourced MAC. CoRR abs/2305.06985 (2023) - [i76]Guy Bresler, Chenghao Guo, Yury Polyanskiy:
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles. CoRR abs/2305.09995 (2023) - [i75]Patrik Róbert Gerber, Yanjun Han, Yury Polyanskiy:
Minimax optimal testing by classification. CoRR abs/2306.11085 (2023) - [i74]Zeyu Jia, Yury Polyanskiy, Yihong Wu:
Entropic characterization of optimal rates for learning Gaussian mixtures. CoRR abs/2306.12308 (2023) - [i73]Tejas Jayashankar, Gary C. F. Lee, Alejandro Lancho, Amir Weiss, Yury Polyanskiy, Gregory W. Wornell:
Score-based Source Separation with Applications to Digital Communication Signals. CoRR abs/2306.14411 (2023) - [i72]Anzo Teh, Yury Polyanskiy:
Comparing Poisson and Gaussian channels (extended). CoRR abs/2306.16735 (2023) - [i71]Alexander Fengler, Alejandro Lancho, Yury Polyanskiy:
Coded Orthogonal Modulation for the Multi-Antenna Multiple-Access Channel. CoRR abs/2307.01095 (2023) - [i70]Patrik Róbert Gerber, Tianze Jiang, Yury Polyanskiy, Rui Sun:
Kernel-Based Tests for Likelihood-Free Hypothesis Testing. CoRR abs/2308.09043 (2023) - 2022
- [j41]Adam Block, Zeyu Jia, Yury Polyanskiy, Alexander Rakhlin:
Intrinsic Dimension Estimation Using Wasserstein Distance. J. Mach. Learn. Res. 23: 313:1-313:37 (2022) - [j40]Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Efficient Representation of Large-Alphabet Probability Distributions. IEEE J. Sel. Areas Inf. Theory 3(4): 651-663 (2022) - [j39]Or Ordentlich, Yury Polyanskiy:
Strong Data Processing Constant Is Achieved by Binary Inputs. IEEE Trans. Inf. Theory 68(3): 1480-1481 (2022) - [j38]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Two-Dimensional Regular Grids. IEEE Trans. Inf. Theory 68(10): 6297-6334 (2022) - [c83]Alexander Fengler, Gianluigi Liva, Yury Polyanskiy:
Sparse Graph Codes for the 2-User Unsourced MAC. IEEECONF 2022: 682-686 - [c82]Alejandro Lancho, Alexander Fengler, Yury Polyanskiy:
Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing. Allerton 2022: 1-8 - [c81]Alejandro Lancho, Amir Weiss, Gary C. F. Lee, Jennifer Tang, Yuheng Bu, Yury Polyanskiy, Gregory W. Wornell:
Data-Driven Blind Synchronization and Interference Rejection for Digital Communication Signals. GLOBECOM 2022: 2296-2302 - [c80]Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Efficient Representation of Large-Alphabet Probability Distributions via Arcsinh-Compander. ISIT 2022: 162-167 - [c79]Jennifer Tang, Yury Polyanskiy:
Capacity of Noisy Permutation Channels. ISIT 2022: 1987-1992 - [c78]Gary C. F. Lee, Amir Weiss, Alejandro Lancho, Jennifer Tang, Yuheng Bu, Yury Polyanskiy, Gregory W. Wornell:
Exploiting Temporal Structures of Cyclostationary Signals for Data-Driven Single-Channel Source Separation. MLSP 2022: 1-6 - [i69]Guy Bresler, Chenghao Guo, Yury Polyanskiy:
Linear Programs with Polynomial Coefficients and Applications to 1D Cellular Automata. CoRR abs/2204.06357 (2022) - [i68]Adam Block, Zeyu Jia, Yury Polyanskiy, Alexander Rakhlin:
Rate of convergence of the smoothed empirical Wasserstein distance. CoRR abs/2205.02128 (2022) - [i67]Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Efficient Representation of Large-Alphabet Probability Distributions. CoRR abs/2205.03752 (2022) - [i66]Gary C. F. Lee, Amir Weiss, Alejandro Lancho, Jennifer Tang, Yuheng Bu, Yury Polyanskiy, Gregory W. Wornell:
Exploiting Temporal Structures of Cyclostationary Signals for Data-Driven Single-Channel Source Separation. CoRR abs/2208.10325 (2022) - [i65]Alejandro Lancho, Amir Weiss, Gary C. F. Lee, Jennifer Tang, Yuheng Bu, Yury Polyanskiy, Gregory W. Wornell:
Data-Driven Blind Synchronization and Interference Rejection for Digital Communication Signals. CoRR abs/2209.04871 (2022) - [i64]Alejandro Lancho, Alexander Fengler, Yury Polyanskiy:
Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing. CoRR abs/2210.01951 (2022) - [i63]Patrik Róbert Gerber, Yury Polyanskiy:
Likelihood-free hypothesis testing. CoRR abs/2211.01126 (2022) - [i62]Qian Yu, Yury Polyanskiy:
Ising Model on Locally Tree-like Graphs: Uniqueness of Solutions to Cavity Equations. CoRR abs/2211.15242 (2022) - 2021
- [j37]Ziv Goldfeld, Guy Bresler, Yury Polyanskiy:
Information Storage in the Stochastic Ising Model. IEEE Trans. Inf. Theory 67(3): 1373-1399 (2021) - [j36]Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy:
Information-Distilling Quantizers. IEEE Trans. Inf. Theory 67(4): 2472-2487 (2021) - [j35]Suhas S. Kowshik, Yury Polyanskiy:
Fundamental Limits of Many-User MAC With Finite Payloads and Fading. IEEE Trans. Inf. Theory 67(9): 5853-5884 (2021) - [c77]Gianluigi Liva, Yury Polyanskiy:
On Coding Techniques for Unsourced Multiple-Access. ACSCC 2021: 1507-1514 - [c76]Emmanuel Abbe, Elisabetta Cornacchia, Yuzhou Gu, Yury Polyanskiy:
Stochastic block model entropy and broadcasting on trees with survey. COLT 2021: 1-25 - [c75]Meir Feder, Yury Polyanskiy:
Sequential prediction under log-loss and misspecification. COLT 2021: 1937-1964 - [c74]Qian Yu, Yury Polyanskiy:
Broadcasting on Trees Near Criticality: Perturbation Theory. ISIT 2021: 2101-2106 - [c73]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Reconstruction on 2D Regular Grids. ISIT 2021: 2107-2112 - [c72]Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Quantization of Random Distributions under KL Divergence. ISIT 2021: 2762-2767 - [i61]Emmanuel Abbe, Elisabetta Cornacchia, Yuzhou Gu, Yury Polyanskiy:
Stochastic block model entropy and broadcasting on trees with survey. CoRR abs/2101.12601 (2021) - [i60]Meir Feder, Yury Polyanskiy:
Sequential prediction under log-loss and misspecification. CoRR abs/2102.00050 (2021) - [i59]Adam Block, Zeyu Jia, Yury Polyanskiy, Alexander Rakhlin:
Intrinsic Dimension Estimation. CoRR abs/2106.04018 (2021) - [i58]Yury Polyanskiy, Yihong Wu:
Sharp regret bounds for empirical Bayes and compound decision problems. CoRR abs/2109.03943 (2021) - [i57]Jennifer Tang, Yury Polyanskiy:
Capacity of Noisy Permutation Channels. CoRR abs/2111.00559 (2021) - 2020
- [j34]Ziv Goldfeld, Yury Polyanskiy:
The Information Bottleneck Problem and its Applications in Machine Learning. IEEE J. Sel. Areas Inf. Theory 1(1): 19-38 (2020) - [j33]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Energy Efficient Coded Random Access for the Wireless Uplink. IEEE Trans. Commun. 68(8): 4694-4708 (2020) - [j32]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Directed Acyclic Graphs. IEEE Trans. Inf. Theory 66(2): 780-812 (2020) - [j31]Yin Sun, Yury Polyanskiy, Elif Uysal:
Sampling of the Wiener Process for Remote Estimation Over a Channel With Random Delay. IEEE Trans. Inf. Theory 66(2): 1118-1135 (2020) - [j30]Ziv Goldfeld, Kristjan H. Greenewald, Jonathan Niles-Weed, Yury Polyanskiy:
Convergence of Smoothed Empirical Measures With Applications to Entropy Estimation. IEEE Trans. Inf. Theory 66(7): 4368-4391 (2020) - [j29]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. IEEE Trans. Inf. Theory 66(8): 4722-4741 (2020) - [j28]Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz:
A Note on the Probability of Rectangles for Correlated Binary Strings. IEEE Trans. Inf. Theory 66(12): 7878-7886 (2020) - [j27]Yongpeng Wu, Xiqi Gao, Shidong Zhou, Wei Yang, Yury Polyanskiy, Giuseppe Caire:
Massive Access for Future Wireless Communication Systems. IEEE Wirel. Commun. 27(4): 148-156 (2020) - [c71]Soham Jana, Yury Polyanskiy, Yihong Wu:
Extrapolating the profile of a finite population. COLT 2020: 2011-2033 - [c70]Hajir Roozbehani, Yury Polyanskiy:
Graceful degradation over the BEC via non-linear codes. ISIT 2020: 280-285 - [c69]Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy:
Broadcasting on trees near criticality. ISIT 2020: 1504-1509 - [i56]Ziv Goldfeld, Yury Polyanskiy:
The Information Bottleneck Problem and Its Applications in Machine Learning. CoRR abs/2004.14941 (2020) - [i55]Yuzhou Gu, Yury Polyanskiy:
Non-linear Log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems. CoRR abs/2005.05444 (2020) - [i54]Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy:
Broadcasting on trees near criticality. CoRR abs/2005.07801 (2020) - [i53]Soham Jana, Yury Polyanskiy, Yihong Wu:
Extrapolating the profile of a finite population. CoRR abs/2005.10561 (2020) - [i52]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Two-Dimensional Regular Grids. CoRR abs/2010.01390 (2020) - [i51]Or Ordentlich, Yury Polyanskiy:
Strong data processing constant is achieved by binary inputs. CoRR abs/2010.01987 (2020)
2010 – 2019
- 2019
- [j26]Yury Polyanskiy:
Hypercontractivity of Spherical Averages in Hamming Space. SIAM J. Discret. Math. 33(2): 731-754 (2019) - [j25]Austin Collins, Yury Polyanskiy:
Coherent Multiple-Antenna Block-Fading Channels at Finite Blocklength. IEEE Trans. Inf. Theory 65(1): 380-405 (2019) - [j24]Noga Alon, Boris Bukh, Yury Polyanskiy:
List-Decodable Zero-Rate Codes. IEEE Trans. Inf. Theory 65(3): 1657-1667 (2019) - [c68]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Short-Packet Low-Power Coded Access for Massive MAC. ACSSC 2019: 827-832 - [c67]Christos Thrampoulidis, Ilias Zadik, Yury Polyanskiy:
A Simple Bound on the BER of the Map Decoder for Massive MIMO Systems. ICASSP 2019: 4544-4548 - [c66]Ziv Goldfeld, Ewout van den Berg, Kristjan H. Greenewald, Igor Melnyk, Nam Nguyen, Brian Kingsbury, Yury Polyanskiy:
Estimating Information Flow in Deep Neural Networks. ICML 2019: 2299-2308 - [c65]Ilias Zadik, Yury Polyanskiy, Christos Thrampoulidis:
Improved bounds on Gaussian MAC and sparse regression via Gaussian inequalities. ISIT 2019: 430-434 - [c64]Suhas S. Kowshik, Yury Polyanskiy:
Quasi-static fading MAC with many users and finite payload. ISIT 2019: 440-444 - [c63]Ziv Goldfeld, Guy Bresler, Yury Polyanskiy:
Information Storage in the Stochastic Ising Model at Low Temperature. ISIT 2019: 732-736 - [c62]Ziv Goldfeld, Kristjan H. Greenewald, Jonathan Weed, Yury Polyanskiy:
Optimality of the Plug-in Estimator for Differential Entropy Estimation under Gaussian Convolutions. ISIT 2019: 892-896 - [c61]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. ISIT 2019: 1332-1336 - [c60]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Networks. ISIT 2019: 1632-1636 - [c59]Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz:
Error Exponents in Distributed Hypothesis Testing of Correlations. ISIT 2019: 2674-2678 - [c58]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Energy efficient random access for the quasi-static fading MAC. ISIT 2019: 2768-2772 - [c57]Wasim Huleihel, Yury Polyanskiy, Ofer Shayevitz:
Relaying One Bit Across a Tandem of Binary-Symmetric Channels. ISIT 2019: 2928-2932 - [c56]Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz:
Communication complexity of estimating correlations. STOC 2019: 792-803 - [c55]Kirill V. Andreev, Suhas S. Kowshik, Alexey A. Frolov, Yury Polyanskiy:
Low Complexity Energy Efficient Random Access Scheme for the Asynchronous Fading MAC. VTC Fall 2019: 1-5 - [i50]Suhas S. Kowshik, Yury Polyanskiy:
Fundamental limits of many-user MAC with finite payloads and fading. CoRR abs/1901.06732 (2019) - [i49]Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz:
Communication Complexity of Estimating Correlations. CoRR abs/1901.09100 (2019) - [i48]Yury Polyanskiy, Yihong Wu:
Dualizing Le Cam's method, with applications to estimating the unseens. CoRR abs/1902.05616 (2019) - [i47]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. CoRR abs/1902.07979 (2019) - [i46]Christos Thrampoulidis, Ilias Zadik, Yury Polyanskiy:
A simple bound on the BER of the MAP decoder for massive MIMO systems. CoRR abs/1903.03949 (2019) - [i45]Ziv Goldfeld, Kristjan H. Greenewald, Yury Polyanskiy, Jonathan Weed:
Convergence of Smoothed Empirical Measures with Applications to Entropy Estimation. CoRR abs/1905.13576 (2019) - [i44]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Energy efficient coded random access for the wireless uplink. CoRR abs/1907.09448 (2019) - [i43]Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz:
A Note on the Probability of Rectangles for Correlated Binary Strings. CoRR abs/1909.01221 (2019) - [i42]Yongpeng Wu, Xiqi Gao, Shidong Zhou, Wei Yang, Yury Polyanskiy, Giuseppe Caire:
Massive Access for Future Wireless Communication Systems. CoRR abs/1910.12678 (2019) - [i41]Hajir Roozbehani, Yury Polyanskiy:
Low density majority codes and the problem of graceful degradation. CoRR abs/1911.12263 (2019) - 2018
- [j23]Flávio du Pin Calmon, Yury Polyanskiy, Yihong Wu:
Strong Data Processing Inequalities for Input Constrained Additive Noise Channels. IEEE Trans. Inf. Theory 64(3): 1879-1892 (2018) - [j22]Jennifer Tang, Da Wang, Yury Polyanskiy, Gregory W. Wornell:
Defect Tolerance: Fundamental Limits and Examples. IEEE Trans. Inf. Theory 64(7): 5240-5260 (2018) - [j21]Anuran Makur, Yury Polyanskiy:
Comparison of Channels: Criteria for Domination by a Symmetric Channel. IEEE Trans. Inf. Theory 64(8): 5704-5725 (2018) - [j20]Marco Dalai, Yury Polyanskiy:
Bounds on the Reliability Function of Typewriter Channels. IEEE Trans. Inf. Theory 64(9): 6208-6222 (2018) - [j19]Wei Yang, Austin Collins, Giuseppe Durisi, Yury Polyanskiy, H. Vincent Poor:
Beta-Beta Bounds: Finite-Blocklength Analog of the Golden Formula. IEEE Trans. Inf. Theory 64(9): 6236-6256 (2018) - [c54]S. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke:
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels. ISIT 2018: 311-315 - [c53]Or Ordentlich, Yury Polyanskiy:
Entropy Under Additive Bernoulli and Spherical Noises. ISIT 2018: 521-525 - [c52]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
Ozarow- Type Outer Bounds for Memoryless Sources and Channels. ISIT 2018: 1774-1778 - [c51]Ziv Goldfeld, Guy Bresler, Yury Polyanskiy:
Information Storage in the Stochastic Ising Model at Zero Temperature. ISIT 2018: 2127-2131 - [c50]Hajir Roozbehani, Yury Polyanskiy:
Input-Output Distance Properties of Good Linear Codes. ISIT 2018: 2510-2514 - [i40]S. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke:
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels. CoRR abs/1801.09481 (2018) - [i39]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Bounded Degree DAGs. CoRR abs/1803.07527 (2018) - [i38]Ziv Goldfeld, Guy Bresler, Yury Polyanskiy:
Information Storage in the Stochastic Ising Model. CoRR abs/1805.03027 (2018) - [i37]Yury Polyanskiy, Yihong Wu:
Application of information-percolation method to reconstruction problems on graphs. CoRR abs/1806.04195 (2018) - [i36]Ziv Goldfeld, Ewout van den Berg, Kristjan H. Greenewald, Igor Melnyk, Nam Nguyen, Brian Kingsbury, Yury Polyanskiy:
Estimating Information Flow in Neural Networks. CoRR abs/1810.05728 (2018) - [i35]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Directed Acyclic Graphs. CoRR abs/1811.03946 (2018) - [i34]Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy:
Information-Distilling Quantizers. CoRR abs/1812.03031 (2018) - 2017
- [j18]Yury Polyanskiy:
On metric properties of maps between Hamming spaces and related graph homomorphisms. J. Comb. Theory, Ser. A 145: 227-251 (2017) - [j17]