{"total":17,"rows":[{"id":"2111.01576","title":"Provably efficient, succinct, and precise explanations","created":"2021-11-01","cited_by_count":32,"area":null},{"id":"2109.00637","title":"Properly learning decision trees in almost polynomial time","created":"2021-09-01","cited_by_count":20,"area":null},{"id":"2102.07048","title":"Connecting Interpretability and Robustness in Decision Trees through Separation","created":"2021-02-14","cited_by_count":16,"area":null},{"id":"2111.12628","title":"Efficient Decompositional Rule Extraction for Deep Neural Networks","created":"2021-11-24","cited_by_count":11,"area":null},{"id":"2210.06375","title":"Superpolynomial Lower Bounds for Decision Tree Learning and Testing","created":"2022-10-12","cited_by_count":9,"area":null},{"id":"2502.15988","title":"Near Optimal Decision Trees in a SPLIT Second","created":"2025-02-21","cited_by_count":8,"area":null},{"id":"2107.00819","title":"Decision tree heuristics can fail, even in the smoothed setting","created":"2021-07-02","cited_by_count":7,"area":null},{"id":"2206.08899","title":"Popular decision tree algorithms are provably noise tolerant","created":"2022-06-17","cited_by_count":3,"area":null},{"id":"2208.10949","title":"Regularized impurity reduction: Accurate decision trees with complexity guarantees","created":"2022-08-23","cited_by_count":3,"area":null},{"id":"2310.01551","title":"Harnessing the Power of Choices in Decision Tree Learning","created":"2023-10-02","cited_by_count":2,"area":null},{"id":"2105.03594","title":"Learning stochastic decision trees","created":"2021-05-08","cited_by_count":1,"area":null},{"id":"2206.14431","title":"Open Problem: Properly learning decision trees in polynomial time?","created":"2022-06-29","cited_by_count":1,"area":null},{"id":"2503.01455","title":"Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules","created":"2025-03-03","cited_by_count":1,"area":null},{"id":"2601.20775","title":"Active Learning for Decision Trees with Provable Guarantees","created":"2026-01-28","cited_by_count":1,"area":null},{"id":"2409.13096","title":"Fast decision tree learning solves hard coding-theoretic problems","created":"2024-09-19","cited_by_count":0,"area":null},{"id":"2509.20848","title":"Actively Learning Halfspaces without Synthetic Data","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2605.12983","title":"Decision Tree Learning on Product Spaces","created":"2026-05-13","cited_by_count":0,"area":null}],"next_cursor":null}