An Exact Junction-Tree Extended Formulation for Optimal Classification Trees

arXiv:2609.24741 · cs.LG · Submitted 2026-09-21 · Read on arXiv

cs.LG

Submitted: 2026-09-21

Updated: 2026-09-21

Code: https://github.com/Tommytutu/JT-OCT

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Consistency — 11× in this paper · explained in 3 episodes
• Benchmark — 5× in this paper · explained in 2 episodes
• Aggregation — 2× in this paper · explained in 1 episode
• Accuracy — 1× in this paper · explained in 1 episode
• Admissibility — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Pruning — 1× in this paper · explained in 4 episodes
• Regularization — 1× in this paper · explained in 3 episodes
• Trace — 1× in this paper · explained in 2 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks