Guy Blanc

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 58

Top Topics

Query Complexity

Decision Tree Algorithm

Daubechies Wavelet

Top Venues

Publications

Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
A Strong Direct Sum Theorem for Distributional Query Complexity. CoRR (2024)
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
A Strong Direct Sum Theorem for Distributional Query Complexity. CCC (2024)
Konstantina Bairaktari, Guy Blanc, Li-Yang Tan, Jonathan R. Ullman, Lydia Zakynthinou
Multitask Learning via Shared Features: Algorithms and Hardness. COLT (2023)
Guy Blanc, Jane Lange, Chirag Pabbaraju, Colin Sullivan, Li-Yang Tan, Mo Tiwari
Harnessing the power of choices in decision tree learning. NeurIPS (2023)
Guy Blanc
Subsampling Suffices for Adaptive Data Analysis. STOC (2023)
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers. CoRR (2023)
Guy Blanc
Subsampling Suffices for Adaptive Data Analysis. CoRR (2023)
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
A strong composition theorem for junta complexity and the boosting of property testers. FOCS (2023)
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
Lifting Uniform Learners via Distributional Decomposition. STOC (2023)
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
Lifting uniform learners via distributional decomposition. CoRR (2023)
Guy Blanc, Jane Lange, Chirag Pabbaraju, Colin Sullivan, Li-Yang Tan, Mo Tiwari
Harnessing the Power of Choices in Decision Tree Learning. CoRR (2023)
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
Certification with an NP Oracle. ITCS (2023)
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
Popular decision tree algorithms are provably noise tolerant. CoRR (2022)
Konstantina Bairaktari, Guy Blanc, Li-Yang Tan, Jonathan R. Ullman, Lydia Zakynthinou
Multitask Learning via Shared Features: Algorithms and Hardness. CoRR (2022)
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
A query-optimal algorithm for finding counterfactuals. ICML (2022)
Guy Blanc, Dean Doron
New Near-Linear Time Decodable Codes Closer to the GV Bound. CCC (2022)
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
A Query-Optimal Algorithm for Finding Counterfactuals. CoRR (2022)
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
Properly learning decision trees in almost polynomial time. FOCS (2022)
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
The Query Complexity of Certification. CoRR (2022)
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
Popular decision tree algorithms are provably noise tolerant. ICML (2022)
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
On the power of adaptivity in statistical adversaries. COLT (2022)
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
Certification with an NP Oracle. CoRR (2022)
Guy Blanc, Dean Doron
New Near-Linear Time Decodable Codes Closer to the GV Bound. Electron. Colloquium Comput. Complex. 29 (2022)
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
The query complexity of certification. STOC (2022)
Guy Blanc, Jane Lange, Li-Yang Tan
Reconstructing Decision Trees. ICALP (2022)
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
Properly Learning Decision Trees in almost Polynomial Time. J. ACM 69 (6) (2022)
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
Open Problem: Properly learning decision trees in polynomial time? CoRR (2022)
Guy Blanc, Moses Charikar
Multiway Online Correlated Selection. FOCS (2022)
Guy Blanc, Jane Lange
Properly learning decision trees in almost polynomial time. ISAIM (2022)
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
Properly learning decision trees in almost polynomial time. CoRR (2021)
Guy Blanc, Jane Lange, Li-Yang Tan
Learning Stochastic Decision Trees. ICALP (2021)
Guy Blanc, Jane Lange, Li-Yang Tan
Query strategies for priced information, revisited. SODA (2021)
Guy Blanc, Moses Charikar
Multiway Online Correlated Selection. FOCS (2021)
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
Decision Tree Heuristics Can Fail, Even in the Smoothed Setting. APPROX-RANDOM (2021)
Guy Blanc, Jane Lange, Li-Yang Tan
Provably efficient, succinct, and precise explanations. NeurIPS (2021)
Guy Blanc, Jane Lange, Li-Yang Tan
Learning stochastic decision trees. CoRR (2021)
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
Properly learning decision trees in almost polynomial time. FOCS (2021)
Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
On the power of adaptivity in statistical adversaries. CoRR (2021)
Guy Blanc, Jane Lange, Li-Yang Tan
Provably efficient, succinct, and precise explanations. CoRR (2021)
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
Decision tree heuristics can fail, even in the smoothed setting. CoRR (2021)
Guy Blanc, Moses Charikar
Multiway Online Correlated Selection. CoRR (2021)
Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
Universal guarantees for decision tree induction via a higher-order splitting criterion. CoRR (2020)
Guy Blanc, Jane Lange, Li-Yang Tan
Testing and reconstruction via decision trees. CoRR (2020)
John J. Cherian, Andrew G. Taube, Robert T. McGibbon, Panagiotis Angelikopoulos, Guy Blanc, Michael Snarski, Daniel D. Richman, John L. Klepeis, David E. Shaw
Efficient hyperparameter optimization by way of PAC-Bayes bound minimization. CoRR (2020)
Guy Blanc, Jane Lange, Li-Yang Tan
Top-Down Induction of Decision Trees: Rigorous Guarantees and Inherent Limitations. ITCS (2020)
Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
Universal guarantees for decision tree induction via a higher-order splitting criterion. NeurIPS (2020)
Guy Blanc, Jane Lange, Li-Yang Tan
Provable guarantees for decision tree induction: the agnostic setting. ICML (2020)
Guy Blanc, Jane Lange, Li-Yang Tan
Provable guarantees for decision tree induction: the agnostic setting. CoRR (2020)
Guy Blanc, Neha Gupta, Gregory Valiant, Paul Valiant
Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like process. COLT (2020)
Guy Blanc, Jane Lange, Li-Yang Tan
Query strategies for priced information, revisited. CoRR (2020)
Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
Estimating decision tree learnability with polylogarithmic sample complexity. CoRR (2020)
Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
Estimating decision tree learnability with polylogarithmic sample complexity. NeurIPS (2020)
Guy Blanc, Jane Lange, Li-Yang Tan
Top-down induction of decision trees: rigorous guarantees and inherent limitations. CoRR (2019)
Guy Blanc, Neha Gupta, Gregory Valiant, Paul Valiant
Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like process. CoRR (2019)
Guy Blanc, Jane Lange, Li-Yang Tan
Top-down induction of decision trees: rigorous guarantees and inherent limitations. Electron. Colloquium Comput. Complex. 26 (2019)
Guy Blanc, Jane Lange, Li-Yang Tan
Constructive derandomization of query algorithms. CoRR (2019)
Guy Blanc, Steffen Rendle
Adaptive Sampled Softmax with Kernel Based Sampling. ICML (2018)
Guy Blanc, Steffen Rendle
Adaptive Sampled Softmax with Kernel Based Sampling. CoRR (2017)