{"total":37,"rows":[{"id":"2209.08040","title":"Exploring the Whole Rashomon Set of Sparse Decision Trees","created":"2022-09-16","cited_by_count":81,"area":null},{"id":"2407.04846","title":"Amazing Things Come From Having Many Good Models","created":"2024-07-05","cited_by_count":55,"area":null},{"id":"2206.11844","title":"Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features","created":"2022-06-23","cited_by_count":20,"area":null},{"id":"2211.14980","title":"Optimal Sparse Regression Trees","created":"2022-11-28","cited_by_count":13,"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":"2309.12701","title":"Breiman meets Bellman: Non-Greedy Decision Trees with MDPs","created":"2023-09-22","cited_by_count":6,"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":"2312.04311","title":"Finding Interpretable Class-Specific Patterns through Efficient Neural Search","created":"2023-12-07","cited_by_count":5,"area":null},{"id":"2206.04857","title":"Mixed integer linear optimization formulations for learning optimal binary classification trees","created":"2022-06-10","cited_by_count":4,"area":null},{"id":"2307.15691","title":"ODTlearn: A Package for Learning Optimal Decision Trees for Prediction and Prescription","created":"2023-07-28","cited_by_count":2,"area":null},{"id":"2310.01551","title":"Harnessing the Power of Choices in Decision Tree Learning","created":"2023-10-02","cited_by_count":2,"area":null},{"id":"2502.01375","title":"Compact Rule-Based Classifier Learning via Gradient Descent","created":"2025-02-03","cited_by_count":2,"area":null},{"id":"2508.16448","title":"Beyond Interpretability: Exploring the Comprehensibility of Adaptive Video Streaming through Large Language Models","created":"2025-08-22","cited_by_count":2,"area":null},{"id":"2210.06825","title":"Fast Optimization of Weighted Sparse Decision Trees for use in Optimal Treatment Regimes and Optimal Policy Design","created":"2022-10-13","cited_by_count":1,"area":null},{"id":"2211.09894","title":"Supervised Feature Compression based on Counterfactual Analysis","created":"2022-11-17","cited_by_count":1,"area":null},{"id":"2503.03576","title":"Optimal Decision Tree Pruning Revisited: Algorithms and Complexity","created":"2025-03-05","cited_by_count":1,"area":null},{"id":"2507.03884","title":"Leo Breiman, the Rashomon Effect, and the Occam Dilemma","created":"2025-07-05","cited_by_count":1,"area":null},{"id":"2605.07598","title":"Optimal Recourse Summaries via Bi-Objective Decision Tree Learning","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2212.06312","title":"Policy learning for many outcomes of interest: Combining optimal policy trees with multi-objective Bayesian optimisation","created":"2022-12-13","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":"2410.20483","title":"Improving Decision Sparsity","created":"2024-10-27","cited_by_count":0,"area":null},{"id":"2412.13439","title":"Rare Event Detection in Imbalanced Multi-Class Datasets Using an Optimal MIP-Based Ensemble Weighting Approach","created":"2024-12-18","cited_by_count":0,"area":null},{"id":"2507.22556","title":"VAR: Visual Analysis for Rashomon Set of Machine Learning Models' Performance","created":"2025-07-30","cited_by_count":0,"area":null},{"id":"2510.23901","title":"RS-ORT: A Reduced-Space Branch-and-Bound Algorithm for Optimal Regression Trees","created":"2025-10-27","cited_by_count":0,"area":null},{"id":"2511.21799","title":"The Double-Edged Nature of the Rashomon Set for Trustworthy Machine Learning","created":"2025-11-26","cited_by_count":0,"area":null},{"id":"2512.11616","title":"A Fast Interpretable Fuzzy Tree Learner","created":"2025-12-12","cited_by_count":0,"area":null},{"id":"2603.02620","title":"Same Error, Different Function: The Optimizer as an Implicit Prior in Financial Time Series","created":"2026-03-03","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":"2608.10400","title":"Do Judges Behave Like Algorithms?","created":"2026-08-11","cited_by_count":0,"area":null},{"id":"2608.20258","title":"DICS: Data-Informed Centroid Splitting for Decision Tree Classifiers","created":"2026-08-20","cited_by_count":0,"area":null},{"id":"2609.01430","title":"Learning Sparse Decision Trees via Transformer Variational Auto-Encoders","created":"2026-09-01","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.23780","title":"Falling Trees: A Model Class for Interpretable Risk Prioritization","created":"2026-09-20","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}