{"total":19,"rows":[{"id":"2305.03515","title":"GradTree: Learning Axis-Aligned Decision Trees with Gradient Descent","created":"2023-05-05","cited_by_count":11,"area":null},{"id":"2409.12788","title":"Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance","created":"2024-09-19","cited_by_count":9,"area":null},{"id":"2502.15988","title":"Near Optimal Decision Trees in a SPLIT Second","created":"2025-02-21","cited_by_count":8,"area":null},{"id":"2310.13841","title":"Fast hyperboloid decision tree algorithms","created":"2023-10-20","cited_by_count":7,"area":null},{"id":"2511.03344","title":"SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration","created":"2025-11-05","cited_by_count":6,"area":null},{"id":"2503.06985","title":"Learning Decision Trees as Amortized Structure Inference","created":"2025-03-10","cited_by_count":2,"area":null},{"id":"2601.14765","title":"Anytime Optimal Decision Tree Learning with Continuous Features","created":"2026-01-21","cited_by_count":2,"area":null},{"id":"2503.01455","title":"Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules","created":"2025-03-03","cited_by_count":1,"area":null},{"id":"2510.20621","title":"Towards the Formalization of a Trustworthy AI for Mining Interpretable Models explOiting Sophisticated Algorithms","created":"2025-10-23","cited_by_count":1,"area":null},{"id":"2602.02173","title":"Generalized Optimal Classification Trees: A Mixed-Integer Programming Approach","created":"2026-02-02","cited_by_count":1,"area":null},{"id":"2306.06777","title":"Improving the Validity of Decision Trees as Explanations","created":"2023-06-11","cited_by_count":0,"area":null},{"id":"2311.13695","title":"BackboneLearn: A Library for Scaling Mixed-Integer Optimization-Based Machine Learning","created":"2023-11-22","cited_by_count":0,"area":null},{"id":"2408.01297","title":"Optimal Mixed Integer Linear Optimization Trained Multivariate Classification Trees","created":"2024-08-02","cited_by_count":0,"area":null},{"id":"2509.12057","title":"Optimal hypersurface decision trees","created":"2025-09-15","cited_by_count":0,"area":null},{"id":"2607.28170","title":"Search Strategies for Optimal Classification and Regression Trees","created":"2026-07-30","cited_by_count":0,"area":null},{"id":"2608.04310","title":"ArborEnum: Decision Tree Rashomon Sets over Continuous Features","created":"2026-08-05","cited_by_count":0,"area":null},{"id":"2609.05826","title":"Scaling Optimal Classification Trees via Adaptive Feature and Sample Reduction","created":"2026-09-05","cited_by_count":0,"area":null},{"id":"2609.24741","title":"An Exact Junction-Tree Extended Formulation for Optimal Classification Trees","created":"2026-09-21","cited_by_count":0,"area":null},{"id":"2609.38194","title":"A Moving-Horizon Approximate Branch-and-Reduce Method for Deep Classification Trees","created":"2026-09-18","cited_by_count":0,"area":null}],"next_cursor":null}