Tootfinder

Review of the Higgs boson production via vector boson fusion and its decay into bottom quarks in $pp$ collisions at $\sqrt{s}=8,13$ TeV
Fikriye C I Kaya, Ibrahim Mirza
https://arxiv.org/abs/2507.22765 …

Review of the Higgs boson production via vector boson fusion and its decay into bottom quarks in $pp$ collisions at $\sqrt{s}=8,13$ TeV
We present a comprehensive overview of the vector boson fusion production and the following decay of the Higgs boson to two bottom quarks (\(H\!\to\! b\bar{b}\)), which dominates the Higgs total width yet remains experimentally challenging because of substantial QCD multijet backgrounds. We overview the use of boosted decision trees, which advance jet reconstruction and flavour tagging by including boosted topologies and deep-learning-based \(b\)-tagging and which improve sensitivity in associa…

Efficient & Correct Predictive Equivalence for Decision Trees
Joao Marques-Silva, Alexey Ignatiev
https://arxiv.org/abs/2509.17774 https://arxiv.org/pd…

Efficient & Correct Predictive Equivalence for Decision Trees
The Rashomon set of decision trees (DTs) finds importance uses. Recent work showed that DTs computing the same classification function, i.e. predictive equivalent DTs, can represent a significant fraction of the Rashomon set. Such redundancy is undesirable. For example, feature importance based on the Rashomon set becomes inaccurate due the existence of predictive equivalent DTs, i.e. DTs with the same prediction for every possible input. In recent work, McTavish et al. proposed solutions for s…

Leaf it to renewal: Improved predictive maintenance policies via renewal theory and decision trees
Daniel Koutas, Daniel Straub
https://arxiv.org/abs/2509.20145 https://

Leaf it to renewal: Improved predictive maintenance policies via renewal theory and decision trees
We propose a general method for deriving prognostics-based predictive maintenance policies. The method takes into account the available decision options at hand, the information on the future state of the system provided by a prognostic model, as well as the costs of the underlying renewal-reward process. It results in heuristic policies with only a few parameters, which can be determined based on theoretical considerations or by optimization from run-to-failure data. We show the potential of t…

Foundational theory for optimal decision tree problems. II. Optimal hypersurface decision tree algorithm
Xi He
https://arxiv.org/abs/2509.12057 https://arx…

Foundational theory for optimal decision tree problems. II. Optimal hypersurface decision tree algorithm
Decision trees are a ubiquitous model for classification and regression tasks due to their interpretability and efficiency. However, solving the optimal decision tree (ODT) problem remains a challenging combinatorial optimization task. Even for the simplest splitting rules--axis-parallel hyperplanes--it is NP-hard to optimize. In Part I of this series, we rigorously defined the proper decision tree model through four axioms and, based on these, introduced four formal definitions of the ODT prob…

Energy Equity, Infrastructure and Demographic Analysis with XAI Methods
Sarahana Shrestha, Aparna S. Varde, Pankaj Lal
https://arxiv.org/abs/2509.16279 https://

Energy Equity, Infrastructure and Demographic Analysis with XAI Methods
This study deploys methods in explainable artificial intelligence (XAI), e.g. decision trees and Pearson's correlation coefficient (PCC), to investigate electricity usage in multiple locales. It addresses the vital issue of energy burden, i.e. total amount spent on energy divided by median household income. Socio-demographic data is analyzed with energy features, especially using decision trees and PCC, providing explainable predictors on factors affecting energy burden. Based on the results of…

Array-Based Monte Carlo Tree Search
James Ragan, Fred Y. Hadaegh, Soon-Jo Chung
https://arxiv.org/abs/2508.20140 https://arxiv.org/pdf/2508.20140

Array-Based Monte Carlo Tree Search
Monte Carlo Tree Search is a popular method for solving decision making problems. Faster implementations allow for more simulations within the same wall clock time, directly improving search performance. To this end, we present an alternative array-based implementation of the classic Upper Confidence bounds applied to Trees algorithm. Our method preserves the logic of the original algorithm, but eliminates the need for branch prediction, enabling faster performance on pipelined processors, and …

Adaptive Command: Real-Time Policy Adjustment via Language Models in StarCraft II
Weiyu Ma, Dongyu Xu, Shu Lin, Haifeng Zhang, Jun Wang
https://arxiv.org/abs/2508.16580 https://…

Adaptive Command: Real-Time Policy Adjustment via Language Models in StarCraft II
We present Adaptive Command, a novel framework integrating large language models (LLMs) with behavior trees for real-time strategic decision-making in StarCraft II. Our system focuses on enhancing human-AI collaboration in complex, dynamic environments through natural language interactions. The framework comprises: (1) an LLM-based strategic advisor, (2) a behavior tree for action execution, and (3) a natural language interface with speech capabilities. User studies demonstrate significant impr…

GS-BART: Bayesian Additive Regression Trees with Graph-split Decision Rules
Shuren He, Huiyan Sang, Quan Zhou
https://arxiv.org/abs/2509.07166 https://arxi…

GS-BART: Bayesian Additive Regression Trees with Graph-split Decision Rules
Ensemble decision tree methods such as XGBoost, Random Forest, and Bayesian Additive Regression Trees (BART) have gained enormous popularity in data science for their superior performance in machine learning regression and classification tasks. In this paper, we introduce a new Bayesian graph-split additive decision tree method, GS-BART, designed to enhance the performance of axis-parallel split-based BART for dependent data with graph structures. The proposed approach encodes input feature inf…

Fr\'echet Geodesic Boosting
Yidong Zhou, Su I Iao, Hans-Georg M\"uller
https://arxiv.org/abs/2509.18013 https://arxiv.org/pdf/2509.18013

Fréchet Geodesic Boosting
Gradient boosting has become a cornerstone of machine learning, enabling base learners such as decision trees to achieve exceptional predictive performance. While existing algorithms primarily handle scalar or Euclidean outputs, increasingly prevalent complex-structured data, such as distributions, networks, and manifold-valued outputs, present challenges for traditional methods. Such non-Euclidean data lack algebraic structures such as addition, subtraction, or scalar multiplication required b…

A Bayesian Additive Regression Trees Model for zero and one inflated data for Predicting Individual Treatment Effects in Alcohol Use Disorder Trials
Pamela Solano, M Lee Van Horn, Kyle Walters, Philipp Besendorfer, Alena Kuhlemeier, Manel Mart\'inez-Ram\'on, Thomas Jaki
https://arxiv.org/abs/2507.19848

A Bayesian Additive Regression Trees Model for zero and one inflated data for Predicting Individual Treatment Effects in Alcohol Use Disorder Trials
Alcohol Use Disorder (AUD) treatment presents high individual-level heterogeneity, with outcomes ranging from complete abstinence to persistent heavy drinking. This variability-driven by complex behavioral, social, and environmental factors-poses major challenges for treatment evaluation and individualized decision-making. In particular, accurately modeling bounded semicontinuous outcomes and estimating predictive individual treatment effects (PITEs) remains methodologically demanding. For th…

Forward-Backward Quantization of Scenario Processes in Multi-Stage Stochastic Optimization
Anna Timonina-Farkas
https://arxiv.org/abs/2508.18112 https://ar…

Forward-Backward Quantization of Scenario Processes in Multi-Stage Stochastic Optimization
Multi-stage stochastic optimization lies at the core of decision-making under uncertainty. As the analytical solution is available only in exceptional cases, dynamic optimization aims to efficiently find approximations but often neglects non-Markovian time-interdependencies. Methods on scenario trees can represent such interdependencies but are subject to the curse of dimensionality. To ease this problem, researchers typically approximate the uncertainty by smaller but more accurate trees. In t…

BarkBeetle: Stealing Decision Tree Models with Fault Injection
Qifan Wang, Jonas Sander, Minmin Jiang, Thomas Eisenbarth, David Oswald
https://arxiv.org/abs/2507.06986

BarkBeetle: Stealing Decision Tree Models with Fault Injection
Machine learning models, particularly decision trees (DTs), are widely adopted across various domains due to their interpretability and efficiency. However, as ML models become increasingly integrated into privacy-sensitive applications, concerns about their confidentiality have grown, particularly in light of emerging threats such as model extraction and fault injection attacks. Assessing the vulnerability of DTs under such attacks is therefore important. In this work, we present BarkBeetle, a…

Spatio-Temporal Directed Graph Learning for Account Takeover Fraud Detection
Mohsen Nayebi Kerdabadi, William Andrew Byron, Xin Sun, Amirfarrokh Iranitalab
https://arxiv.org/abs/2509.20339

Spatio-Temporal Directed Graph Learning for Account Takeover Fraud Detection
Account Takeover (ATO) fraud poses a significant challenge in consumer banking, requiring high recall under strict latency while minimizing friction for legitimate users. Production systems typically rely on tabular gradient-boosted decision trees (e.g., XGBoost) that score sessions independently, overlooking the relational and temporal structure of online activity that characterizes coordinated attacks and "fraud rings." We introduce ATLAS (Account Takeover Learning Across Spatio-Temporal Dire…

SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate
Murayyiam Parvez, Annus Zulfiqar, Roman Beltiukov, Shir Landau Feibish, Walter Willinger, Arpit Gupta, Muhammad Shahbaz
https://arxiv.org/abs/2509.00397

SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate
Machine learning (ML) is increasingly being deployed in programmable data planes (switches and SmartNICs) to enable real-time traffic analysis, security monitoring, and in-network decision-making. Decision trees (DTs) are particularly well-suited for these tasks due to their interpretability and compatibility with data-plane architectures, i.e., match-action tables (MATs). However, existing in-network DT implementations are constrained by the need to compute all input features upfront, forcing …

The Honest Truth About Causal Trees: Accuracy Limits for Heterogeneous Treatment Effect Estimation
Matias D. Cattaneo, Jason M. Klusowski, Ruiqi Rae Yu
https://arxiv.org/abs/2509.11381

The Honest Truth About Causal Trees: Accuracy Limits for Heterogeneous Treatment Effect Estimation
Recursive decision trees have emerged as a leading methodology for heterogeneous causal treatment effect estimation and inference in experimental and observational settings. These procedures are fitted using the celebrated CART (Classification And Regression Tree) algorithm [Breiman et al., 1984], or custom variants thereof, and hence are believed to be "adaptive" to high-dimensional data, sparsity, or other specific features of the underlying data generating process. Athey and Imbens [2016] pr…

Temporal Counterfactual Explanations of Behaviour Tree Decisions
Tamlin Love, Antonio Andriella, Guillem Aleny\`a
https://arxiv.org/abs/2509.07674 https://…

Temporal Counterfactual Explanations of Behaviour Tree Decisions
Explainability is a critical tool in helping stakeholders understand robots. In particular, the ability for robots to explain why they have made a particular decision or behaved in a certain way is useful in this regard. Behaviour trees are a popular framework for controlling the decision-making of robots and other software systems, and thus a natural question to ask is whether or not a system driven by a behaviour tree is capable of answering "why" questions. While explainability for behaviour…

Fairness-Aware and Interpretable Policy Learning
Nora Bearth, Michael Lechner, Jana Mareckova, Fabian Muny
https://arxiv.org/abs/2509.12119 https://arxiv.o…

Fairness-Aware and Interpretable Policy Learning
Fairness and interpretability play an important role in the adoption of decision-making algorithms across many application domains. These requirements are intended to avoid undesirable group differences and to alleviate concerns related to transparency. This paper proposes a framework that integrates fairness and interpretability into algorithmic decision making by combining data transformation with policy trees, a class of interpretable policy functions. The approach is based on pre-processing…

A Generic Complete Anytime Beam Search for Optimal Decision Tree
Harold Silv\`ere Kiossou, Siegfried Nijssen, Pierre Schaus
https://arxiv.org/abs/2508.06064 https://

A Generic Complete Anytime Beam Search for Optimal Decision Tree
Finding an optimal decision tree that minimizes classification error is known to be NP-hard. While exact algorithms based on MILP, CP, SAT, or dynamic programming guarantee optimality, they often suffer from poor anytime behavior -- meaning they struggle to find high-quality decision trees quickly when the search is stopped before completion -- due to unbalanced search space exploration. To address this, several anytime extensions of exact methods have been proposed, such as LDS-DL8.5, Top-k-DL…

Machines Learn Number Fields, But How? The Case of Galois Groups
Kyu-Hwan Lee, Seewoo Lee
https://arxiv.org/abs/2508.06670 https://arxiv.org/pdf/2508.06670…

Machines Learn Number Fields, But How? The Case of Galois Groups
By applying interpretable machine learning methods such as decision trees, we study how simple models can classify the Galois groups of Galois extensions over $\mathbb{Q}$ of degrees 4, 6, 8, 9, and 10, using Dedekind zeta coefficients. Our interpretation of the machine learning results allows us to understand how the distribution of zeta coefficients depends on the Galois group, and to prove new criteria for classifying the Galois groups of these extensions. Combined with previous results, thi…

Tree-like Pairwise Interaction Networks
Ronald Richman, Salvatore Scognamiglio, Mario V. W\"uthrich
https://arxiv.org/abs/2508.15678 https://arxiv.org…

Tree-like Pairwise Interaction Networks
Modeling feature interactions in tabular data remains a key challenge in predictive modeling, for example, as used for insurance pricing. This paper proposes the Tree-like Pairwise Interaction Network (PIN), a novel neural network architecture that explicitly captures pairwise feature interactions through a shared feed-forward neural network architecture that mimics the structure of decision trees. PIN enables intrinsic interpretability by design, allowing for direct inspection of interaction e…

Exploring the Design Space of Fair Tree Learning Algorithms
Kiara Stempel, Mattia Cerrato, Stefan Kramer
https://arxiv.org/abs/2509.03204 https://arxiv.org…

Exploring the Design Space of Fair Tree Learning Algorithms
Decision trees have been studied extensively in the context of fairness, aiming to maximize prediction performance while ensuring non-discrimination against different groups. Techniques in this space usually focus on imposing constraints at training time, constraining the search space so that solutions which display unacceptable values of relevant metrics are not considered, discarded, or discouraged. If we assume one target variable y and one sensitive attribute s, the design space of tree lea…

Multi-timescale Stochastic Programming with Applications in Power Systems
Yihang Zhang, Suvrajeet Sen
https://arxiv.org/abs/2508.08520 https://arxiv.org/pd…

Multi-timescale Stochastic Programming with Applications in Power Systems
This paper introduces a multi-timescale stochastic programming framework designed to address decision-making challenges in power systems, particularly those with high renewable energy penetration. The framework models interactions across different timescales using aggregated state variables to coordinate decisions. In addition to Multi-timescale uncertainty modeled via multihorizon trees, we also introduce a "synchronized state approximation," which periodically aligns states across timescales …