English
Related papers

Related papers: Efficient & Correct Predictive Equivalence for Dec…

200 papers

Neural architectures such as Recurrent Neural Networks (RNNs), Transformers, and State-Space Models have shown great success in handling sequential data by learning temporal dependencies. Decision Trees (DTs), on the other hand, remain a…

Machine Learning · Computer Science 2025-02-07 Sascha Marton , Moritz Schneider

In this paper we study a polynomial time algorithms that for an input $A\subseteq {B_m}$ outputs a decision tree for $A$ of minimum depth. This problem has many applications that include, to name a few, computer vision, group testing, exact…

Data Structures and Algorithms · Computer Science 2018-02-02 Nader H. Bshouty , Waseem Makhoul

Decision Transformer (DT) is an innovative algorithm leveraging recent advances of the transformer architecture in reinforcement learning (RL). However, a notable limitation of DT is its reliance on recalling trajectories from datasets,…

Machine Learning · Computer Science 2023-11-02 Yi Ma , Chenjun Xiao , Hebin Liang , Jianye Hao

We proposed the tensor-input tree (TT) method for scalar-on-tensor and tensor-on-tensor regression problems. We first address scalar-on-tensor problem by proposing scalar-output regression tree models whose input variable are tensors (i.e.,…

Machine Learning · Computer Science 2025-07-10 Hengrui Luo , Akira Horiguchi , Li Ma

Sparse decision tree learning provides accurate and interpretable predictive models that are ideal for high-stakes applications by finding the single most accurate tree within a (soft) size limit. Rather than relying on a single "best"…

Machine Learning · Computer Science 2025-11-06 Elif Arslan , Jacobus G. M. van der Linden , Serge Hoogendoorn , Marco Rinaldi , Emir Demirović

We introduce compositional tensor trains (CTTs) for the approximation of multivariate functions, a class of models obtained by composing low-rank functions in the tensor-train format. This format can encode standard approximation tools,…

Numerical Analysis · Mathematics 2025-12-23 Martin Eigel , Charles Miranda , Anthony Nouy , David Sommer

Decision trees are widely used for non-linear modeling, as they capture interactions between predictors while producing inherently interpretable models. Despite their popularity, performing inference on the non-linear fit remains largely…

Methodology · Statistics 2026-04-14 Soham Bakshi , Snigdha Panigrahi

Deep Neural Networks (DNNs) are the de facto algorithm for tackling cognitive tasks in real-world applications such as speech recognition and natural language processing. DNN inference comprises numerous dot product operations between…

Hardware Architecture · Computer Science 2023-11-20 Nitesh Narayana GS , Marc Ordoñez , Lokananda Hari , Franyell Silfa , Antonio González

This paper argues that DNNs implement a computational Occam's razor -- finding the `simplest' algorithm that fits the data -- and that this could explain their incredible and wide-ranging success over more traditional statistical methods.…

Machine Learning · Statistics 2026-03-26 Arthur Jacot

Deep Neural Network (DNN) applications with edge computing presents a trade-off between responsiveness and computational resources. On one hand, edge computing can provide high responsiveness deploying computational resources close to end…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-29 Roberto G. Pacheco , Rodrigo S. Couto

We report on a series of experiments in which all decision trees consistent with the training data are constructed. These experiments were run to gain an understanding of the properties of the set of consistent decision trees and the…

Artificial Intelligence · Computer Science 2008-02-03 P. M. Murphy , M. J. Pazzani

Random Forests (RF) is a popular machine learning method for classification and regression problems. It involves a bagging application to decision tree models. One of the primary advantages of the Random Forests model is the reduction in…

Machine Learning · Statistics 2022-07-06 Sai K Popuri

We present an approach to improve the accuracy-interpretability trade-off of Machine Learning (ML) Decision Trees (DTs). In particular, we apply Maximum Satisfiability technology to compute Minimum Pure DTs (MPDTs). We improve the runtime…

Artificial Intelligence · Computer Science 2022-07-15 Josep Alos , Carlos Ansotegui , Eduard Torres

Enabling efficient and accurate deep neural network (DNN) inference on microcontrollers is non-trivial due to the constrained on-chip resources. Current methodologies primarily focus on compressing larger models yet at the expense of model…

Machine Learning · Computer Science 2024-03-15 Xiao Ma , Shengfeng He , Hezhe Qiao , Dong Ma

DNN structures are continuously developing and achieving high performances in classification problems. Also, it is observed that success rates obtained with DNNs are higher than those obtained with traditional neural networks. In addition,…

Machine Learning · Computer Science 2022-01-02 Tamer Ölmez , Zümray Dokur

Given a weighted, ordered query set $Q$ and a partition of $Q$ into classes, we study the problem of computing a minimum-cost decision tree that, given any query $q$ in $Q$, uses equality tests and less-than comparisons to determine the…

Data Structures and Algorithms · Computer Science 2025-01-28 Marek Chrobak , Neal E. Young

Uncertainty of decisions in safety-critical engineering applications can be estimated on the basis of the Bayesian Markov Chain Monte Carlo (MCMC) technique of averaging over decision models. The use of decision tree (DT) models assists…

Artificial Intelligence · Computer Science 2010-12-03 Vitaly Schetinin , Jonathan Fieldsend , Derek Partridge , Wojtek Krzanowski , Richard Everson , Trevor Bailey , Adolfo Hernandez

Reinforcement learning techniques leveraging deep learning have made tremendous progress in recent years. However, the complexity of neural networks prevents practitioners from understanding their behavior. Decision trees have gained…

Machine Learning · Computer Science 2024-08-22 Daniël Vos , Sicco Verwer

The uncertainty of classification outcomes is of crucial importance for many safety critical applications including, for example, medical diagnostics. In such applications the uncertainty of classification can be reliably estimated within a…

Artificial Intelligence · Computer Science 2007-05-23 V. Schetinin , J. E. Fieldsend , D. Partridge , W. J. Krzanowski , R. M. Everson , T. C. Bailey , A. Hernandez

We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total…

Formal Languages and Automata Theory · Computer Science 2017-01-30 Helmut Seidl , Sebastian Maneth , Gregor Kemper