| 2026 | SODA | Is nasty noise actually harder than malicious noise? | Guy Blanc, Yizhi Huang, Tal Malkin, Rocco A. Servedio |
| 2025 | COLT | A Distributional-Lifting Theorem for PAC Learning. | Guy Blanc, Jane Lange, Carmen Strassle, Li-Yang Tan |
| 2025 | FOCS | Instance-Optimal Uniformity Testing and Tracking. | Guy Blanc, Clment L. Canonne, Erik Waingarten |
| 2025 | FOCS | Computational-Statistical Tradeoffs from NP-hardness. | Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan |
| 2025 | STOC | Adaptive and Oblivious Statistical Adversaries Are Equivalent. | Guy Blanc, Gregory Valiant |
| 2024 | FOCS | The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem. | Guy Blanc, Alexandre Hayderi, Caleb Koch, Li-Yang Tan |
| 2023 | COLT | Multitask Learning via Shared Features: Algorithms and Hardness. | Konstantina Bairaktari, Guy Blanc, Li-Yang Tan, Jonathan R. Ullman, Lydia Zakynthinou |
| 2023 | FOCS | A strong composition theorem for junta complexity and the boosting of property testers. | Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan |
| 2023 | STOC | Subsampling Suffices for Adaptive Data Analysis. | Guy Blanc |
| 2023 | STOC | Lifting Uniform Learners via Distributional Decomposition. | Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan |
| 2022 | COLT | On the power of adaptivity in statistical adversaries. | Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan |
| 2022 | ICALP | Reconstructing Decision Trees. | Guy Blanc, Jane Lange, Li-Yang Tan |
| 2022 | ICML | A query-optimal algorithm for finding counterfactuals. | Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan |
| 2022 | ICML | Popular decision tree algorithms are provably noise tolerant. | Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan |
| 2022 | ISAIM | Properly learning decision trees in almost polynomial time. | Guy Blanc, Jane Lange |
| 2022 | STOC | The query complexity of certification. | Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan |
| 2021 | FOCS | Multiway Online Correlated Selection. | Guy Blanc, Moses Charikar |
| 2021 | FOCS | Properly learning decision trees in almost polynomial time. | Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan |
| 2021 | ICALP | Learning Stochastic Decision Trees. | Guy Blanc, Jane Lange, Li-Yang Tan |
| 2021 | SODA | Query strategies for priced information, revisited. | Guy Blanc, Jane Lange, Li-Yang Tan |
| 2020 | COLT | Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like process. | Guy Blanc, Neha Gupta, Gregory Valiant, Paul Valiant |
| 2020 | ICML | Provable guarantees for decision tree induction: the agnostic setting. | Guy Blanc, Jane Lange, Li-Yang Tan |
| 2018 | ICML | Adaptive Sampled Softmax with Kernel Based Sampling. | Guy Blanc, Steffen Rendle |