Research map / Learning theory and algorithms / Prediction and decision losses
Weighted Oblique Decision Trees
Bin-Bin Yang, Song-Qing Shen, Wei Gao
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use random initialization with weighted soft-split entropy objective (WODT) instead of random-init CO2r | oblique decision tree · 20 UCI/LIBSVM datasets | test accuracy: win/tie/loss 15/5/0 | Improved |
| WODT vs OC1r (random init) | oblique decision tree · 20 UCI/LIBSVM datasets | test accuracy: win/tie/loss 11/7/2 | Improved |
| WODT with random init vs axis-parallel-initialized CO2 | oblique decision tree · 20 UCI/LIBSVM datasets | test accuracy: win/tie/loss 20/0/0 | Improved |
| WODT vs axis-parallel tree APDT | decision tree · 20 UCI/LIBSVM datasets | test accuracy: win/tie/loss 17/2/1 | Mixed |
| WODT vs random-init oblique trees on leaf count | oblique decision tree · 20 datasets | leaf count: win/tie/loss 19/0/1 vs CO2r | Improved |
| WODT vs APDT on tree size | decision tree · 20 datasets | leaf count: win/tie/loss 14/0/6 | Mixed |
| WODT vs other trees in training time on high-dimensional data (>200 features) | decision tree · usps, protein, mnist | training time: about 100 times faster | Improved |
| WODT vs APDT across tree depths 2 to 20 | decision tree · usps, protein, connect4, mnist | test accuracy | Improved |
Closest papers by meaning
- Alternating optimization of decision trees, with application to learning sparse oblique trees (NeurIPS 2018 · similarity 0.89)
- Witty: An Efficient Solver for Computing Minimum-Size Decision Trees (AAAI 2025 · similarity 0.84)
- Optimal Decision Tree Pruning Revisited: Algorithms and Complexity (ICML 2025 · similarity 0.84)
- Near-Optimal Decision Trees in a SPLIT Second (ICML 2025 · similarity 0.83)
- SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration (NeurIPS 2025 · similarity 0.83)
- Learning Small Decision Trees with Few Outliers: A Parameterized Perspective (AAAI 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
