Guy Blanc

74 papers A* 26A 6Misc 1Journal 40Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A conf
Differential Privacy from Axioms.
ITCS
Guy Blanc, William Pires, Toniann Pitassi
2026 A* conf
Is nasty noise actually harder than malicious noise?
SODA
Guy Blanc, Yizhi Huang, Tal Malkin, Rocco A. Servedio
2026 A conf
Samplability Makes Learning Easier.
ITCS
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2025 A* conf
A Distributional-Lifting Theorem for PAC Learning.
COLT
Guy Blanc, Jane Lange, Carmen Strassle, Li-Yang Tan
2025 J jnl
A Distributional-Lifting Theorem for PAC Learning.
CoRR
Guy Blanc, Jane Lange, Carmen Strassle, Li-Yang Tan
2025 A* conf
Adaptive and Oblivious Statistical Adversaries Are Equivalent.
STOC
Guy Blanc, Gregory Valiant
2025 A* conf
Computational-Statistical Tradeoffs from NP-hardness.
FOCS
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2025 J jnl
Computational-Statistical Tradeoffs from NP-hardness.
CoRR
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2025 J jnl
Differential privacy from axioms.
CoRR
Guy Blanc, William Pires, Toniann Pitassi
2025 A* conf
Instance-Optimal Uniformity Testing and Tracking.
FOCS
Guy Blanc, Clément L. Canonne, Erik Waingarten
2025 J jnl
Instance-Optimal Uniformity Testing and Tracking.
CoRR
Guy Blanc, Clément L. Canonne, Erik Waingarten
2025 J jnl
Is nasty noise actually harder than malicious noise?
CoRR
Guy Blanc, Yizhi Huang, Tal Malkin, Rocco A. Servedio
2025 J jnl
Samplability makes learning easier.
CoRR
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2025 J jnl
Subsampling Suffices for Adaptive Data Analysis.
J. ACM
Guy Blanc
2025 J jnl
The power of quantum circuits in sampling.
CoRR
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2024 A conf
A Strong Direct Sum Theorem for Distributional Query Complexity.
CCC
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2024 J jnl
A Strong Direct Sum Theorem for Distributional Query Complexity.
CoRR
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2024 J jnl
Adaptive and oblivious statistical adversaries are equivalent.
CoRR
Guy Blanc, Gregory Valiant
2024 A* conf
The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem.
FOCS
Guy Blanc, Alexandre Hayderi, Caleb Koch, Li-Yang Tan
2024 J jnl
The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem.
CoRR
Guy Blanc, Alexandre Hayderi, Caleb Koch, Li-Yang Tan
2023 J jnl
A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers.
CoRR
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2023 A* conf
A strong composition theorem for junta complexity and the boosting of property testers.
FOCS
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2023 A conf
Certification with an NP Oracle.
ITCS
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2023 J jnl
Harnessing the Power of Choices in Decision Tree Learning.
CoRR
Guy Blanc, Jane Lange, Chirag Pabbaraju, Colin Sullivan, Li-Yang Tan, Mo Tiwari
2023 A* conf
Harnessing the power of choices in decision tree learning.
NeurIPS
Guy Blanc, Jane Lange, Chirag Pabbaraju, Colin Sullivan, Li-Yang Tan, Mo Tiwari
2023 A* conf
Lifting Uniform Learners via Distributional Decomposition.
STOC
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2023 J jnl
Lifting uniform learners via distributional decomposition.
CoRR
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2023 A* conf
Multitask Learning via Shared Features: Algorithms and Hardness.
COLT
Konstantina Bairaktari, Guy Blanc, Li-Yang Tan, Jonathan R. Ullman, Lydia Zakynthinou
2023 A* conf
Subsampling Suffices for Adaptive Data Analysis.
STOC
Guy Blanc
2023 J jnl
Subsampling Suffices for Adaptive Data Analysis.
CoRR
Guy Blanc
2022 J jnl
A Query-Optimal Algorithm for Finding Counterfactuals.
CoRR
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2022 A* conf
A query-optimal algorithm for finding counterfactuals.
ICML
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2022 J jnl
Certification with an NP Oracle.
CoRR
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2022 J jnl
Multitask Learning via Shared Features: Algorithms and Hardness.
CoRR
Konstantina Bairaktari, Guy Blanc, Li-Yang Tan, Jonathan R. Ullman, Lydia Zakynthinou
2022 A conf
New Near-Linear Time Decodable Codes Closer to the GV Bound.
CCC
Guy Blanc, Dean Doron
2022 J jnl
New Near-Linear Time Decodable Codes Closer to the GV Bound.
Electron. Colloquium Comput. Complex.
Guy Blanc, Dean Doron
2022 A* conf
On the power of adaptivity in statistical adversaries.
COLT
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2022 J jnl
Open Problem: Properly learning decision trees in polynomial time?
CoRR
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2022 A* conf
Popular decision tree algorithms are provably noise tolerant.
ICML
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2022 J jnl
Popular decision tree algorithms are provably noise tolerant.
CoRR
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2022 J jnl
Properly Learning Decision Trees in almost Polynomial Time.
J. ACM
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2022 Misc conf
Properly learning decision trees in almost polynomial time.
ISAIM
Guy Blanc, Jane Lange
2022 A* conf
Reconstructing Decision Trees.
ICALP
Guy Blanc, Jane Lange, Li-Yang Tan
2022 J jnl
The Query Complexity of Certification.
CoRR
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2022 A* conf
The query complexity of certification.
STOC
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2021 — conf
Decision Tree Heuristics Can Fail, Even in the Smoothed Setting.
APPROX-RANDOM
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021 J jnl
Decision tree heuristics can fail, even in the smoothed setting.
CoRR
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021 A* conf
Learning Stochastic Decision Trees.
ICALP
Guy Blanc, Jane Lange, Li-Yang Tan
2021 J jnl
Learning stochastic decision trees.
CoRR
Guy Blanc, Jane Lange, Li-Yang Tan
2021 A* conf
Multiway Online Correlated Selection.
FOCS
Guy Blanc, Moses Charikar
2021 J jnl
Multiway Online Correlated Selection.
CoRR
Guy Blanc, Moses Charikar
2021 J jnl
On the power of adaptivity in statistical adversaries.
CoRR
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2021 A* conf
Properly learning decision trees in almost polynomial time.
FOCS
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021 J jnl
Properly learning decision trees in almost polynomial time.
CoRR
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021 A* conf
Provably efficient, succinct, and precise explanations.
NeurIPS
Guy Blanc, Jane Lange, Li-Yang Tan
2021 J jnl
Provably efficient, succinct, and precise explanations.
CoRR
Guy Blanc, Jane Lange, Li-Yang Tan
2021 A* conf
Query strategies for priced information, revisited.
SODA
Guy Blanc, Jane Lange, Li-Yang Tan
2020 J jnl
Efficient hyperparameter optimization by way of PAC-Bayes bound minimization.
CoRR
John J. Cherian, Andrew G. Taube, Robert T. McGibbon, Panagiotis Angelikopoulos, Guy Blanc, Michael Snarski, Daniel D. Richman, John L. Klepeis, David E. Shaw
2020 A* conf
Estimating decision tree learnability with polylogarithmic sample complexity.
NeurIPS
Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2020 J jnl
Estimating decision tree learnability with polylogarithmic sample complexity.
CoRR
Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2020 A* conf
Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like process.
COLT
Guy Blanc, Neha Gupta, Gregory Valiant, Paul Valiant
2020 A* conf
Provable guarantees for decision tree induction: the agnostic setting.
ICML
Guy Blanc, Jane Lange, Li-Yang Tan
2020 J jnl
Provable guarantees for decision tree induction: the agnostic setting.
CoRR
Guy Blanc, Jane Lange, Li-Yang Tan
2020 J jnl
Query strategies for priced information, revisited.
CoRR
Guy Blanc, Jane Lange, Li-Yang Tan
2020 J jnl
Testing and reconstruction via decision trees.
CoRR
Guy Blanc, Jane Lange, Li-Yang Tan
2020 A conf
Top-Down Induction of Decision Trees: Rigorous Guarantees and Inherent Limitations.
ITCS
Guy Blanc, Jane Lange, Li-Yang Tan
2020 A* conf
Universal guarantees for decision tree induction via a higher-order splitting criterion.
NeurIPS
Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2020 J jnl
Universal guarantees for decision tree induction via a higher-order splitting criterion.
CoRR
Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2019 J jnl
Constructive derandomization of query algorithms.
CoRR
Guy Blanc, Jane Lange, Li-Yang Tan
2019 J jnl
Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like process.
CoRR
Guy Blanc, Neha Gupta, Gregory Valiant, Paul Valiant
2019 J jnl
Top-down induction of decision trees: rigorous guarantees and inherent limitations.
CoRR
Guy Blanc, Jane Lange, Li-Yang Tan
2019 J jnl
Top-down induction of decision trees: rigorous guarantees and inherent limitations.
Electron. Colloquium Comput. Complex.
Guy Blanc, Jane Lange, Li-Yang Tan
2018 A* conf
Adaptive Sampled Softmax with Kernel Based Sampling.
ICML
Guy Blanc, Steffen Rendle
2017 J jnl
Adaptive Sampled Softmax with Kernel Based Sampling.
CoRR
Guy Blanc, Steffen Rendle