arXiv:2606. 30995v1 Announce Type: new Abstract: Recent work has shown that well-optimized individual decision trees can match complex black box models in some settings, primarily in noisy domains.
arXiv:2503. 12902v4 Announce Type: replace Abstract: Model trees provide an appealing way to perform interpretable machine learning for both classification and regression problems.
The paper presents a scalable method for meta‑learning interpretable decision trees by generating synthetic pre‑training data. It samples near‑optimal trees to create large, realistic datasets and uses the MetaTree transformer architecture to match the performance of real‑world pre‑training or costly optimal tree training. This approach cuts computational costs, offers flexible data generation, and supports efficient, scalable meta‑learning of decision trees.
arXiv:2608. 08674v1 Announce Type: new Abstract: In the operation of machine learning models, model update is a fundamental process that requires careful consideration of its impact on downstream decision-making.
The paper introduces System 1 models—fast, single‑pass decision engines that map inputs directly to structured outputs, addressing the latency, cost, and calibration issues of large language models. It presents a five‑family taxonomy (encoder‑based classifiers, reward models, non‑autoregressive engines, contrastive models, and extraction models) and discusses training, deployment trade‑offs, and calibration theory, including proper scoring rules and RLCD. The guide also covers integration into agentic workflows, System 1+System 2 cascades, 18 application domains, an open‑source ecosystem, and practical resources such as code, a model zoo, and assessment questions.
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.
MotherTree is a tabular transformer that meta‑learns to produce hard, axis‑aligned decision trees in a single forward pass. It is pre‑trained on a synthetic prior distribution using stochastic gradient descent, without needing reference trees for supervision. On controlled benchmarks, MotherTree matches or surpasses size‑matched trees from traditional algorithms and serves as a strong initializer for task‑specific fine‑tuning.
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...
arXiv:2605. 13830v2 Announce Type: replace-cross Abstract: Decision tree ensembles (DTE) are a popular model for a wide range of AI classification tasks, used in multiple safety critical domains, and hence verifying properties on these models has been an active topic of study over the last decade.
The paper introduces a three‑stage framework that uses Large Language Models (LLMs) to generate rules and assemble them into decision trees for few‑shot tabular classification. By distilling LLM knowledge into interpretable trees, the method avoids the high inference costs and limited interpretability of direct LLM application while outperforming traditional decision trees in low‑data settings. Experiments on real‑world datasets show superior accuracy and interpretability with lower prompting overhead compared to existing baselines.
arXiv:2611.05774v1 Announce Type: new Abstract: Algorithmic recourse identifies modifications that can change an unfavorable model prediction into a favorable one. Under predictive multiplicity, simi...
arXiv:2606.12289v3 Announce Type: replace-cross Abstract: As Artificial Intelligence models grow in complexity, interpretability has become an indispensable tool for understanding, debugging, and con...