 Limitations of Membership Queries in Testable LearningInformation Technology Convergence and Services (ITCS), 2025 |
 Fast decision tree learning solves hard coding-theoretic problemsIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2024 |
 |
 Harnessing the Power of Choices in Decision Tree LearningNeural Information Processing Systems (NeurIPS), 2023 |
 Properly Learning Decision Trees with Queries Is NP-HardIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023 |
 Agnostic proper learning of monotone functions: beyond the black-box
correction barrierIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023 |
 Lifting uniform learners via distributional decompositionSymposium on the Theory of Computing (STOC), 2023 |
 Superpolynomial Lower Bounds for Decision Tree Learning and TestingACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 |
 Efficient Quantum Agnostic Improper Learning of Decision TreesInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2022 |
 Popular decision tree algorithms are provably noise tolerantInternational Conference on Machine Learning (ICML), 2022 |
 Reconstructing decision treesInternational Colloquium on Automata, Languages and Programming (ICALP), 2020 |
