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.
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...
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.
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...
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...
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.
arXiv:2606. 01708v1 Announce Type: cross Abstract: We study fixed-confidence best-action identification (BAI) in stochastic minimax trees.
arXiv:2503. 12902v4 Announce Type: replace Abstract: Model trees provide an appealing way to perform interpretable machine learning for both classification and regression problems.
We study fixed-confidence best-action identification (BAI) in stochastic minimax trees. This problem is increasingly relevant in modern AI planning, where deep minimax search and Monte Carlo Tree Search (MCTS) with language model long rollouts face a fundamental tradeoff: heuristic evaluations are cheap but biased, while accurate rollouts are reliable but prohibitively expensive.
arXiv:2606. 21497v2 Announce Type: replace-cross Abstract: Modern deep neural networks are trained using error backpropagation, which requires sequential forward and backward computations across network layers.
Test-time scaling improves language-model reasoning, but existing approaches often face a difficult trade-off: long chain-of-thought sampling remains single-threaded, while sentence- or solution-level search can be computationally expensive and hard to train end-to-end. We introduce Local Branch Routing (LBR), a token-level test-time scaling framework that expands a small local lookahead tree, forwards all sampled branches through the language model, and uses a lightweight router to select the depth-1 subtree to commit.
arXiv:2608. 03111v1 Announce Type: new Abstract: Double descent is commonly studied by scaling an explicit capacity parameter, such as neural-network width.
The paper introduces a look‑ahead splitting rule for Classification and Regression Trees (CART) that evaluates candidate splits by the error reduction achieved after growing a conventional CART subtree beneath each split. To keep the method computationally feasible, a smart look‑ahead algorithm is proposed that learns downstream split values from node‑level features. Experiments on simulated data and two real datasets show that both full and smart look‑ahead methods outperform the standard greedy splitting strategy, especially in hierarchical or interaction‑driven scenarios.