| 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 | 186 | 2020 |
| Adaptive sampled softmax with kernel based sampling G Blanc, S Rendle International conference on machine learning, 590-599, 2018 | 93 | 2018 |
| Provably efficient, succinct, and precise explanations G Blanc, J Lange, LY Tan Advances in Neural Information Processing Systems 34, 6129-6141, 2021 | 43 | 2021 |
| Multiway online correlated selection G Blanc, M Charikar 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 27 | 2022 |
| Top-down induction of decision trees: rigorous guarantees and inherent limitations G Blanc, J Lange, LY Tan arXiv preprint arXiv:1911.07375, 2019 | 27 | 2019 |
| 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 | 22 | 2022 |
| Provable guarantees for decision tree induction: the agnostic setting G Blanc, J Lange, LY Tan International Conference on Machine Learning, 941-949, 2020 | 19 | 2020 |
| On the power of adaptivity in statistical adversaries G Blanc, J Lange, A Malik, LY Tan Conference on Learning Theory, 5030-5061, 2022 | 13 | 2022 |
| 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 | 11 | 2020 |
| Decision tree heuristics can fail, even in the smoothed setting G Blanc, J Lange, M Qiao, LY Tan arXiv preprint arXiv:2107.00819, 2021 | 9 | 2021 |
| Subsampling suffices for adaptive data analysis G Blanc Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 999-1012, 2023 | 8 | 2023 |
| New near-linear time decodable codes closer to the GV bound G Blanc, D Doron 37th Computational Complexity Conference (CCC 2022), 10: 1-10: 40, 2022 | 8 | 2022 |
| 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 | 7 | 2020 |
| 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 | 6 | 2020 |
| A query-optimal algorithm for finding counterfactuals G Blanc, C Koch, J Lange, LY Tan International Conference on Machine Learning, 2075-2090, 2022 | 5 | 2022 |
| Testing and reconstruction via decision trees G Blanc, J Lange, LY Tan CoRR, abs/2012.08735 9, 2020 | 5 | 2020 |
| A strong direct sum theorem for distributional query complexity G Blanc, C Koch, C Strassle, LY Tan arXiv preprint arXiv:2405.16340, 2024 | 4 | 2024 |
| 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 | 4 | 2023 |
| Popular decision tree algorithms are provably noise tolerant G Blanc, J Lange, A Malik, LY Tan International Conference on Machine Learning, 2091-2106, 2022 | 4 | 2022 |
| 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 | 4 | 2022 |
