Skip to content
conftrace_

decision tree learning

11 papers

Explore in graph

Co-occurring keywords · papers mentioning both

decision tree (5) agnostic learning (3) boosting algorithm (2) membership query (2) parameterized complexity (2) optimal decision tree (2) pac learning (2) halfspace learning (1) noise tolerance (1) halfspaces (1)

Papers

Efficient Quantum Agnostic Improper Learning of Decision Trees AISTATS 2024 Learning Small Decision Trees with Few Outliers: A Parameterized Perspective AAAI 2024 Superconstant Inapproximability of Decision Tree Learning COLT 2024 Harnessing the power of choices in decision tree learning NeurIPS 2023 Open Problem: Properly learning decision trees in polynomial time? COLT 2022 Parameterized Complexity of Small Decision Tree Learning AAAI 2021 SAT-based Decision Tree Learning for Large Data Sets AAAI 2021 Provable guarantees for decision tree induction: the agnostic setting ICML 2020 PyDL8.5: a Library for Learning Optimal Decision Trees IJCAI 2020 Potential-Based Agnostic Boosting NeurIPS 2009 Structure and Majority Classes in Decision Tree Learning JMLR 2007