arXiv AI By Chenxuanyin Zou, Jiayang Ren, Qiangqiang Mao, Jing Liu, Marcus Lai, Yankai Cao

A Moving-Horizon Approximate Branch-and-Reduce Method for Deep Classification Trees

Read the original on arXiv AI →

The paper introduces a moving-horizon approximate branch‑and‑reduce method for training deep classification trees on large datasets with continuous features. It combines a hierarchical root‑subtree optimization framework, branch‑and‑reduce at the root, greedy heuristics for subtrees, and a low‑cost moving‑horizon refinement to improve accuracy. Experiments show the approach surpasses heuristic baselines in test accuracy while scaling better in dataset size and tree depth than existing global optimal solvers.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Sep 3

Recursive Value Learning for Long-Horizon Offline Goal-Conditioned RL

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 Machine Learning
Aug 6

ArborEnum: Decision Tree Rashomon Sets over Continuous Features

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