| 2025 | Exploring Facets of Language Generation in the Limit. | Moses Charikar, Chirag Pabbaraju |
| 2025 | Towards Fair Representation: Clustering and Consensus. | Diptarka Chakraborty, Kushagra Chatterjee, Debarati Das, Tien Long Nguyen, Romina Nobahari |
| 2025 | Market Making without Regret. | Nicol Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Luigi Foscari, Vinayak Pathak |
| 2025 | Information-theoretic reduction of deep neural networks to linear models in the overparametrized proportional regime. | Francesco Camilli, Daria Tieplova, Eleonora Bergamin, Jean Barbier |
| 2025 | On the Convergence of Min-Max Langevin Dynamics and Algorithm. | Yang Cai, Siddharth Mitra, Xiuyuan Wang, Andre Wibisono |
| 2025 | What Makes Treatment Effects Identifiable? Characterizations and Estimators Beyond Unconfoundedness (Extended Abstract). | Yang Cai, Alkis Kalavasis, Katerina Mamali, Anay Mehrotra, Manolis Zampetakis |
| 2025 | On the Hardness of Bandit Learning. | Nataly Brukhim, Aldo Pacchiano, Miroslav Dudk, Robert E. Schapire |
| 2025 | A Fine-grained Characterization of PAC Learnability. | Marco Bressan, Nataly Brukhim, Nicol Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen |
| 2025 | Of Dice and Games: A Theory of Generalized Boosting. | Marco Bressan, Nataly Brukhim, Nicol Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen |
| 2025 | Computational Equivalence of Spiked Covariance and Spiked Wigner Models via Gram-Schmidt Perturbation. | Guy Bresler, Alina Harbuzova |
| 2025 | Partial and Exact Recovery of a Random Hypergraph from its Graph Projection. | Guy Bresler, Chenghao Guo, Yury Polyanskiy, Andrew Yao |
| 2025 | Logarithmic regret of exploration in average reward Markov decision processes. | Victor Boone, Bruno Gaujal |
| 2025 | Accelerating Proximal Gradient Descent via Silver Stepsizes. | Jinho Bok, Jason M. Altschuler |
| 2025 | Proofs as Explanations: Short Certificates for Reliable Predictions. | Avrim Blum, Steve Hanneke, Chirag Pabbaraju, Donya Saless |
| 2025 | Stability and List-Replicability for Agnostic Learners. | Ari Blondal, Shan Gao, Hamed Hatami, Pooya Hatami |
| 2025 | A Distributional-Lifting Theorem for PAC Learning. | Guy Blanc, Jane Lange, Carmen Strassle, Li-Yang Tan |
| 2025 | Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs. | Hadley Black, Arya Mazumdar, Barna Saha, Yinzhan Xu |
| 2025 | Learning Partitions with Optimal Query and Round Complexities. | Hadley Black, Arya Mazumdar, Barna Saha |
| 2025 | How to safely discard features based on aggregate SHAP values. | Robi Bhattacharjee, Karolin Frohnapfel, Ulrike von Luxburg |
| 2025 | Metric Embeddings Beyond Bi-Lipschitz Distortion via Sherali-Adams. | Ainesh Bakshi, Vincent Cohen-Addad, Rajesh Jayaram, Sam Hopkins, Silvio Lattanzi |
| 2025 | Thompson Sampling for Bandit Convex Optimisation. | Alireza Bakhtiari, Tor Lattimore, Csaba Szepesvri |
| 2025 | Faster Acceleration for Steepest Descent. | Cedar Site Bai, Brian Bullins |
| 2025 | Testing Thresholds and Spectral Properties of High-Dimensional Random Toroidal Graphs via Edgeworth-Style Expansions. | Samuel Baguley, Andreas Gbel, Marcus Pappik, Leon Schiller |
| 2025 | Computational Intractability of Strategizing against Online Learners. | Angelos Assos, Yuval Dagan, Nived Rajaraman |
| 2025 | Simplifying Adversarially Robust PAC Learning With Tolerance. | Hassan Ashtiani, Vinayak Pathak, Ruth Urner |