Research map / Learning theory and algorithms / Prediction and decision losses
PAC-Bayes Tree: weighted subtrees with guarantees
Tin D Nguyen, Samory Kpotufe
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 |
|---|---|---|---|
| PAC-Bayes weighted subtrees versus default pruning heuristic | PAC-Bayes tree · UCI digit, dyadic tree | error ratio to baseline: 0.936 | Improved |
| PAC-Bayes weighted subtrees versus default pruning heuristic | PAC-Bayes tree · UCI spam, dyadic tree | error ratio to baseline: 0.975 | Improved |
| PAC-Bayes weighted subtrees versus default pruning heuristic | PAC-Bayes tree · UCI crowd, dyadic tree | error ratio to baseline: 1.020 | Hurt |
| PAC-Bayes weighted subtrees versus default pruning heuristic | PAC-Bayes tree · UCI eeg, KD tree | error ratio to baseline: 0.990 | Improved |
| PAC-Bayes weighted subtrees versus default pruning heuristic | PAC-Bayes tree · UCI letter, KD tree | error ratio to baseline: 1.001 | No clear effect |
| PAC-Bayes weighted subtrees versus default pruning heuristic | PAC-Bayes tree · UCI spam, KD tree | error ratio to baseline: 1.020 | Hurt |
| SN-pruning instead of default pruning heuristic | SN-pruning · UCI spam, dyadic tree | error ratio to baseline: 1.118 | Hurt |
| SN-pruning instead of default pruning heuristic | SN-pruning · UCI eeg, dyadic tree | error ratio to baseline: 0.979 | Improved |
| HS-vote majority classifier instead of default pruning | HS-vote · UCI epileptic, KD tree | error ratio to baseline: 0.907 | Improved |
| HS-vote majority classifier instead of default pruning | HS-vote · UCI spam, dyadic tree | error ratio to baseline: 1.224 | Hurt |
| PAC-Bayes tree versus SN-pruning and HS-vote overall | PAC-Bayes tree · 7 UCI datasets, dyadic and KD trees | classification error | No clear effect |
Closest papers by meaning
- Optimal Decision Tree Pruning Revisited: Algorithms and Complexity (ICML 2025 · similarity 0.84)
- Distribution Learning Meets Graph Structure Sampling (NeurIPS 2025 · similarity 0.84)
- SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration (NeurIPS 2025 · similarity 0.84)
- Recursive PAC-Bayes: A Frequentist Approach to Sequential Prior Updates with No Information Loss (NeurIPS 2024 · similarity 0.84)
- Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound (AAAI 2025 · similarity 0.83)
- Scenario-Based Robust Optimization of Tree Structures (AAAI 2025 · 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.
