arXiv:2608.29262v1 Announce Type: cross
Abstract: Decision trees are attractive for tabular prediction tasks because each prediction follows an interpretable sequence of feature-threshold tests. Unde...
By Hanul Park, Jeonghoon Choi, Juseong Kim, Sanghun Sel, Giltae Song
The paper introduces DCRL (Divide-and-Conquer RL), a method that recursively decomposes offline goal-conditioned reinforcement learning trajectories into a balanced binary tree. By training values from the leaves up to the root, DCRL avoids noisy max-based backups and reduces bootstrap depth from linear to logarithmic, thereby limiting error accumulation. Experiments on diverse goal-reaching tasks show that DCRL outperforms prior flat offline GCRL methods, achieving a higher average score on the most challenging long-horizon OGBench tasks.
By Hyeonseong Jeon, Youngwoon Lee
arXiv:2609.05826v1 Announce Type: new
Abstract: Dynamic programming for optimal classification trees becomes computationally expensive as the numbers of features and training samples increase. We dev...
By Jiancheng Tu, Wenqi Fan
arXiv:2609.24741v1 Announce Type: new
Abstract: We develop an exact linear programming (LP) formulation for bounded-depth classification trees with binary features, using a junction-tree representati...
By Jiancheng TU, WenqiFan
arXiv:2608. 04310v1 Announce Type: new Abstract: The Rashomon effect describes the phenomenon that many models can achieve nearly equivalent performance on the same learning task, with significant ramifications for robustness, feature importance, and customizability.
By Zakk Heile, Hayden McTavish, Margo Seltzer, Cynthia Rudin
arXiv:2606. 01708v1 Announce Type: cross Abstract: We study fixed-confidence best-action identification (BAI) in stochastic minimax trees.
By Peter Chen, Xi Chen