Follow
Guy Blanc
Guy Blanc
Verified email at stanford.edu - Homepage
Title
Cited by
Cited by
Year
Implicit regularization for deep neural networks driven by an ornstein-uhlenbeck like process
G Blanc, N Gupta, G Valiant, P Valiant
Conference on learning theory, 483-513, 2020
1442020
Adaptive sampled softmax with kernel based sampling
G Blanc, S Rendle
International conference on machine learning, 590-599, 2018
782018
Provably efficient, succinct, and precise explanations
G Blanc, J Lange, LY Tan
Advances in Neural Information Processing Systems 34, 6129-6141, 2021
302021
Top-down induction of decision trees: rigorous guarantees and inherent limitations
G Blanc, J Lange, LY Tan
arXiv preprint arXiv:1911.07375, 2019
252019
Multiway online correlated selection
G Blanc, M Charikar
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
192022
Properly learning decision trees in almost polynomial time
G Blanc, J Lange, M Qiao, LY Tan
Journal of the ACM 69 (6), 1-19, 2022
152022
Provable guarantees for decision tree induction: the agnostic setting
G Blanc, J Lange, LY Tan
International Conference on Machine Learning, 941-949, 2020
152020
Universal guarantees for decision tree induction via a higher-order splitting criterion
G Blanc, N Gupta, J Lange, LY Tan
Advances in Neural Information Processing Systems 33, 9475-9484, 2020
92020
Decision tree heuristics can fail, even in the smoothed setting
G Blanc, J Lange, M Qiao, LY Tan
arXiv preprint arXiv:2107.00819, 2021
62021
Estimating decision tree learnability with polylogarithmic sample complexity
G Blanc, N Gupta, J Lange, LY Tan
Advances in Neural Information Processing Systems 33, 6064-6073, 2020
62020
Testing and reconstruction via decision trees
G Blanc, J Lange, LY Tan
CoRR, abs/2012.08735 9, 2020
52020
A query-optimal algorithm for finding counterfactuals
G Blanc, C Koch, J Lange, LY Tan
International Conference on Machine Learning, 2075-2090, 2022
42022
The query complexity of certification
G Blanc, C Koch, J Lange, LY Tan
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
42022
New near-linear time decodable codes closer to the GV bound
G Blanc, D Doron
37th Computational Complexity Conference (CCC 2022), 2022
42022
Query strategies for priced information, revisited
G Blanc, J Lange, LY Tan
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
42021
Efficient hyperparameter optimization by way of pac-bayes bound minimization
JJ Cherian, AG Taube, RT McGibbon, P Angelikopoulos, G Blanc, ...
arXiv preprint arXiv:2008.06431, 2020
42020
Popular decision tree algorithms are provably noise tolerant
G Blanc, J Lange, A Malik, LY Tan
International Conference on Machine Learning, 2091-2106, 2022
32022
On the power of adaptivity in statistical adversaries
G Blanc, J Lange, A Malik, LY Tan
Conference on Learning Theory, 5030-5061, 2022
32022
Lifting uniform learners via distributional decomposition
G Blanc, J Lange, A Malik, LY Tan
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1755-1767, 2023
22023
Subsampling suffices for adaptive data analysis
G Blanc
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 999-1012, 2023
22023
The system can't perform the operation now. Try again later.
Articles 1–20