Adaptive Sampled Softmax with Kernel Based Sampling. - Guy Blanc; Steffen Rendle (ICML, 2018)

Constructive derandomization of query algorithms. - Guy Blanc; Jane Lange; Li-Yang Tan (CoRR, 2019)

Top-down induction of decision trees: rigorous guarantees and inherent limitations. - Guy Blanc; Jane Lange; Li-Yang Tan (Electron. Colloquium Comput. Complex., 2019)

Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like process. - Guy Blanc; Neha Gupta 002; Gregory Valiant; Paul Valiant (COLT, 2020)

Provable guarantees for decision tree induction: the agnostic setting. - Guy Blanc; Jane Lange; Li-Yang Tan (ICML, 2020)

Estimating decision tree learnability with polylogarithmic sample complexity. - Guy Blanc; Neha Gupta 002; Jane Lange; Li-Yang Tan (NeurIPS, 2020)

Universal guarantees for decision tree induction via a higher-order splitting criterion. - Guy Blanc; Neha Gupta 002; Jane Lange; Li-Yang Tan (NeurIPS, 2020)

Efficient hyperparameter optimization by way of PAC-Bayes bound minimization. - John J. Cherian; Andrew G. Taube; Robert T. McGibbon; Panagiotis Angelikopoulos; Guy Blanc; Michael Snarski; Daniel D. Richman; John L. Klepeis; David E. Shaw (CoRR, 2020)

Testing and reconstruction via decision trees. - Guy Blanc; Jane Lange; Li-Yang Tan (CoRR, 2020)

Decision Tree Heuristics Can Fail, Even in the Smoothed Setting. - Guy Blanc; Jane Lange; Mingda Qiao; Li-Yang Tan (APPROX-RANDOM, 2021)

Multiway Online Correlated Selection. - Guy Blanc; Moses Charikar (FOCS, 2021)

Learning Stochastic Decision Trees. - Guy Blanc; Jane Lange; Li-Yang Tan (ICALP, 2021)

Provably efficient, succinct, and precise explanations. - Guy Blanc; Jane Lange; Li-Yang Tan (NeurIPS, 2021)

Query strategies for priced information, revisited. - Guy Blanc; Jane Lange; Li-Yang Tan (SODA, 2021)

On the power of adaptivity in statistical adversaries. - Guy Blanc; Jane Lange; Ali Malik; Li-Yang Tan (COLT, 2022)

Reconstructing Decision Trees. - Guy Blanc; Jane Lange; Li-Yang Tan (ICALP, 2022)

A query-optimal algorithm for finding counterfactuals. - Guy Blanc; Caleb Koch 001; Jane Lange; Li-Yang Tan (ICML, 2022)

Popular decision tree algorithms are provably noise tolerant. - Guy Blanc; Jane Lange; Ali Malik; Li-Yang Tan (ICML, 2022)

Properly learning decision trees in almost polynomial time. - Guy Blanc; Jane Lange (ISAIM, 2022)

The query complexity of certification. - Guy Blanc; Caleb Koch 001; Jane Lange; Li-Yang Tan (STOC, 2022)

Open Problem: Properly learning decision trees in polynomial time? - Guy Blanc; Jane Lange; Mingda Qiao; Li-Yang Tan (CoRR, 2022)

New Near-Linear Time Decodable Codes Closer to the GV Bound. - Guy Blanc; Dean Doron (Electron. Colloquium Comput. Complex., 2022)

Properly Learning Decision Trees in almost Polynomial Time. - Guy Blanc; Jane Lange; Mingda Qiao; Li-Yang Tan (J. ACM, 2022)

Multitask Learning via Shared Features: Algorithms and Hardness. - Konstantina Bairaktari; Guy Blanc; Li-Yang Tan; Jonathan R. Ullman; Lydia Zakynthinou (COLT, 2023)

A strong composition theorem for junta complexity and the boosting of property testers. - Guy Blanc; Caleb Koch 001; Carmen Strassle; Li-Yang Tan (FOCS, 2023)

Certification with an NP Oracle. - Guy Blanc; Caleb Koch 001; Jane Lange; Carmen Strassle; Li-Yang Tan (ITCS, 2023)

Harnessing the power of choices in decision tree learning. - Guy Blanc; Jane Lange; Chirag Pabbaraju; Colin Sullivan; Li-Yang Tan; Mo Tiwari (NeurIPS, 2023)

Lifting Uniform Learners via Distributional Decomposition. - Guy Blanc; Jane Lange; Ali Malik; Li-Yang Tan (STOC, 2023)

A Strong Direct Sum Theorem for Distributional Query Complexity. - Guy Blanc; Caleb Koch 001; Carmen Strassle; Li-Yang Tan (CCC, 2024)

The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem. - Guy Blanc; Alexandre Hayderi; Caleb Koch 001; Li-Yang Tan (FOCS, 2024)

A Distributional-Lifting Theorem for PAC Learning. - Guy Blanc; Jane Lange; Carmen Strassle; Li-Yang Tan (COLT, 2025)

Adaptive and Oblivious Statistical Adversaries Are Equivalent. - Guy Blanc; Gregory Valiant (STOC, 2025)

Subsampling Suffices for Adaptive Data Analysis. - Guy Blanc (J. ACM, 2025)

Computational-Statistical Tradeoffs from NP-hardness. - Guy Blanc; Caleb Koch 001; Carmen Strassle; Li-Yang Tan (CoRR, 2025)

Instance-Optimal Uniformity Testing and Tracking. - Guy Blanc; Clément L. Canonne; Erik Waingarten (CoRR, 2025)