| 2025 | Multi-Stage Active Sequential Hypothesis Testing with Clustered Hypotheses. | George Vershinin, Asaf Cohen, Omer Gurewitz |
| 2025 | Soft Best-of-$n$ Sampling for Model Alignment. | Claudio Mayrink Verdun, Alex Oesterling, Himabindu Lakkaraju, Flvio P. Calmon |
| 2025 | Ensemble Mirror Descent: a Generalization of Mirror Descent to Multiple Convex Potentials. | Kanumuri Nithin Varma, Babak Hassibi |
| 2025 | Learning and Generalization with Mixture Data. | Harsh Vardhan, Avishek Ghosh, Arya Mazumdar |
| 2025 | On the Capacity of Undirected Multiple Unicast Layered Networks with Asymmetric Demands. | M. Surya Vamsi, Satyajit Thakor |
| 2025 | Subcodes of Second-Order Reed-Muller Codes via Recursive Subproducts. | A P. Vaideeswaran, Madireddi Sai Harish, Lakshmi Prasad Natarajan |
| 2025 | On Source Coding for Stationary Sources Under Logarithmic Loss. | Oguzhan Kubilay lger, Elza Erkip |
| 2025 | An Upper Bound on the Capacity of Bandlimited LTI AWGN Channels subject to Peak-Amplitude Constraint. | Idan Tzachy, Ron Dabora, Shlomo Shamai |
| 2025 | A Network Coding-Based Approach to Floating-Point Sum Reduction. | Zhuoqi Tu, Yi Chen, Shenghao Yang |
| 2025 | D2D Coded Caching Schemes for Multiaccess Networks with Combinatorial Access Topology. | Rashid Ummer N. T., B. Sundar Rajan |
| 2025 | Structure Learning in Gaussian Graphical Models from Glauber Dynamics. | Vignesh Tirukkonda, Anirudh Rayas, Gautam Dasarathy |
| 2025 | Information-Theoretic Limits and Approximate Message-Passing for High-Dimensional Time Series. | Daria Tieplova, Jean Barbier, Samriddha Lahiry |
| 2025 | Source-Channel Separation Theorems for Distortion Perception Coding. | Chao Tian, Jun Chen, Krishna Narayanan |
| 2025 | Lossless Data Compression at Pragmatic Rates. | Andreas Theocharous, Ioannis Kontoyiannis |
| 2025 | On the Capacity of Insertion Channels for Small Insertion Probabilities. | Busra Tegin, Tolga M. Duman |
| 2025 | Twice-Universal Prediction in Over-Parameterized Linear Regression. | Anton Tchaplianka, Meir Feder |
| 2025 | Individual Confidential Computing of Polynomials Over Non-Uniform Information. | Saar Tarnopolsky, Zirui Deng, Vinayak Ramkumar, Netanel Raviv, Alejandro Cohen |
| 2025 | Outage Probability of Correlated RIS-Aided Communication Links. | Giorgio Taricco |
| 2025 | Ensemble-Tight Second-Order Asymptotics for Guessing-Based Decoding with Abandonment. | Vincent Y. F. Tan, Hamdi Joudeh |
| 2025 | Bounding the Capacity of the Multinomial Channel Using KL Divergence Covering and Packing. | Jennifer Tang |
| 2025 | The Rate-Distortion Function for Sampled Cyclostationary Gaussian Processes with Memory and with Bounded Processing Delay. | Zikun Tan, Ron Dabora, H. Vincent Poor |
| 2025 | Achievable Rates of Frequency-based Channels of Unlimited Input Resolution. | Ran Tamir, Nir Weinberger |
| 2025 | On the Theory of $\mathbb{Z}_{m}$ Linear Codes: the $\mathbb{Z}_{m}$ Linear Preparata and Goethals Codes for $m>2$. | Luca G. Tallini, Bella Bose |
| 2025 | Channel Resolvability Using Multiplicative Weight Update Algorithm. | Koki Takahashi, Shun Watanabe |
| 2025 | (Quasi-)Linear-Time Algorithms for the Closest Vector Problem in (Semi-)Equiangular Lattices. | Kenta Takahashi, Wanaru Nakamura |