Cover Image

Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	van der Linden, Jacobus G. M., Vos, Daniël, de Weerdt, Mathijs M., Verwer, Sicco, Demirović, Emir
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming
by: van der Linden, Jacobus G. M., et al.
Published: (2023)

Optimal Decision Tree Policies for Markov Decision Processes
by: Vos, Daniël, et al.
Published: (2023)

Optimizing Interpretable Decision Tree Policies for Reinforcement Learning
by: Vos, Daniël, et al.
Published: (2024)

Optimal Survival Trees: A Dynamic Programming Approach
by: Huisman, Tim, et al.
Published: (2024)

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
by: Brita, Catalin E., et al.
Published: (2025)

SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration
by: Arslan, Elif, et al.
Published: (2025)

EXPObench: Benchmarking Surrogate-based Optimisation Algorithms on Expensive Black-box Functions
by: Bliek, Laurens, et al.
Published: (2021)

PDFA Distillation via String Probability Queries
by: Baumgartner, Robert, et al.
Published: (2024)

PAC learning PDFA from data streams
by: Baumgartner, Robert, et al.
Published: (2026)

In Search of Trees: Decision-Tree Policy Synthesis for Black-Box Systems via Search
by: Demirović, Emir, et al.
Published: (2024)

FlexFringe: Modeling Software Behavior by Learning Probabilistic Automata
by: Verwer, Sicco, et al.
Published: (2022)

How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization
by: Sidorov, Konstantin, et al.
Published: (2024)

State Frequency Estimation for Anomaly Detection
by: Cao, Clinton, et al.
Published: (2024)

To the Max: Reinventing Reward in Reinforcement Learning
by: Veviurko, Grigorii, et al.
Published: (2024)

ENCODE: Encoding NetFlows for Network Anomaly Detection
by: Cao, Clinton, et al.
Published: (2022)

You Shall Pass: Dealing with the Zero-Gradient Problem in Predict and Optimize for Convex Optimization
by: Veviurko, Grigorii, et al.
Published: (2023)

Learning From Scenarios for Stochastic Repairable Scheduling
by: Houten, Kim van den, et al.
Published: (2023)

Bayesian Meta-Reinforcement Learning with Laplace Variational Recurrent Networks
by: de Vries, Joery A., et al.
Published: (2025)

VariBASed: Variational Bayes-Adaptive Sequential Monte-Carlo Planning for Deep Reinforcement Learning
by: de Vries, Joery A., et al.
Published: (2026)

Revisiting Randomization in Greedy Model Search
by: Chen, Xin, et al.
Published: (2025)

Optimal Decision Tree Pruning Revisited: Algorithms and Complexity
by: Harviainen, Juha, et al.
Published: (2025)

Optimal Recourse Summaries via Bi-Objective Decision Tree Learning
by: Chatzis, Ioannis, et al.
Published: (2026)

Breiman meets Bellman: Non-Greedy Decision Trees with MDPs
by: Kohler, Hector, et al.
Published: (2023)

Treatment Effect Estimation for Optimal Decision-Making
by: Frauen, Dennis, et al.
Published: (2025)

NOCTA: Non-Greedy Objective Cost-Tradeoff Acquisition for Longitudinal Data
by: Dinh, Dzung, et al.
Published: (2025)

Revisiting Landmarks: Learning from Previous Plans to Generalize over Problem Instances
by: Hanou, Issa, et al.
Published: (2025)

Automated Test-Case Generation for REST APIs Using Model Inference Search Heuristic
by: Cao, Clinton, et al.
Published: (2024)

Database-assisted automata learning
by: Walinga, Hielke, et al.
Published: (2024)

Decision Tree Induction Through LLMs via Semantically-Aware Evolution
by: Liu, Tennison, et al.
Published: (2025)

Accelerating Matrix Diagonalization through Decision Transformers with Epsilon-Greedy Optimization
by: Bhatta, Kshitij, et al.
Published: (2024)

Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization
by: Lee, Deokjae, et al.
Published: (2024)

DQN Performance with Epsilon Greedy Policies and Prioritized Experience Replay
by: Perkins, Daniel, et al.
Published: (2025)

Objective Matters: Fine-Tuning Objectives Shape Safety, Robustness, and Persona Drift
by: Vennemeyer, Daniel, et al.
Published: (2026)

Tuning Sequential Monte Carlo Samplers via Greedy Incremental Divergence Minimization
by: Kim, Kyurae, et al.
Published: (2025)

RIE-Greedy: Regularization-Induced Exploration for Contextual Bandits
by: Li, Tong, et al.
Published: (2026)

Beyond Greedy Exits: Improved Early Exit Decisions for Risk Control and Reliability
by: Bajpai, Divya Jyoti, et al.
Published: (2025)

LLMs are Greedy Agents: Effects of RL Fine-tuning on Decision-Making Abilities
by: Schmied, Thomas, et al.
Published: (2025)

Privacy Constrained Fairness Estimation for Decision Trees
by: van der Steen, Florian, et al.
Published: (2023)

Globally-Optimal Greedy Experiment Selection for Active Sequential Estimation
by: Li, Xiaoou, et al.
Published: (2024)

Interpretable Quantile Regression by Optimal Decision Trees
by: Lemaire, Valentin, et al.
Published: (2026)