{"total":97,"rows":[{"id":"2103.11251","title":"Interpretable Machine Learning: Fundamental Principles and 10 Grand Challenges","created":"2021-03-20","cited_by_count":367,"area":null},{"id":"2209.08040","title":"Exploring the Whole Rashomon Set of Sparse Decision Trees","created":"2022-09-16","cited_by_count":81,"area":null},{"id":"2209.04012","title":"From Shapley Values to Generalized Additive Models and back","created":"2022-09-08","cited_by_count":60,"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":"2211.00541","title":"Logic-Based Explainability in Machine Learning","created":"2022-10-24","cited_by_count":48,"area":null},{"id":"2205.09971","title":"On Tackling Explanation Redundancy in Decision Trees","created":"2022-05-20","cited_by_count":44,"area":null},{"id":"2109.15103","title":"Scalable Rule-Based Representation Learning for Interpretable Classification","created":"2021-09-30","cited_by_count":40,"area":null},{"id":"2112.00798","title":"Fast Sparse Decision Tree Optimization via Reference Ensembles","created":"2021-12-01","cited_by_count":38,"area":null},{"id":"2209.11799","title":"Augmenting Interpretable Models with LLMs during Training","created":"2022-09-23","cited_by_count":38,"area":null},{"id":"2310.19726","title":"A Path to Simpler Models Starts With Noise","created":"2023-10-30","cited_by_count":33,"area":null},{"id":"2309.13775","title":"The Rashomon Importance Distribution: Getting RID of Unstable, Single Model-based Variable Importance","created":"2023-09-24","cited_by_count":29,"area":null},{"id":"2103.15965","title":"Strong Optimal Classification Trees","created":"2021-03-29","cited_by_count":28,"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":"2202.00858","title":"Hierarchical Shrinkage: improving the accuracy and interpretability of tree-based methods","created":"2022-02-02","cited_by_count":19,"area":null},{"id":"2307.05506","title":"Data-Driven Design for Metamaterials and Multiscale Systems: A Review","created":"2023-07-01","cited_by_count":17,"area":null},{"id":"2102.07048","title":"Connecting Interpretability and Robustness in Decision Trees through Separation","created":"2021-02-14","cited_by_count":16,"area":null},{"id":"2310.14336","title":"Learning Interpretable Rules for Scalable Data Representation and Classification","created":"2023-10-22","cited_by_count":14,"area":null},{"id":"2201.11931","title":"Fast Interpretable Greedy-Tree Sums","created":"2022-01-28","cited_by_count":13,"area":null},{"id":"2206.03718","title":"Learning Interpretable Decision Rule Sets: A Submodular Optimization Approach","created":"2022-06-08","cited_by_count":13,"area":null},{"id":"2209.09227","title":"TimberTrek: Exploring and Curating Sparse Decision Trees with Interactive Visualization","created":"2022-09-19","cited_by_count":13,"area":null},{"id":"2211.14980","title":"Optimal Sparse Regression Trees","created":"2022-11-28","cited_by_count":13,"area":null},{"id":"2305.03515","title":"GradTree: Learning Axis-Aligned Decision Trees with Gradient Descent","created":"2023-05-05","cited_by_count":11,"area":null},{"id":"2111.08466","title":"Interpretable and Fair Boolean Rule Sets via Column Generation","created":"2021-11-16","cited_by_count":10,"area":null},{"id":"2407.04168","title":"Learning Interpretable Differentiable Logic Networks","created":"2024-07-04","cited_by_count":10,"area":null},{"id":"2110.09626","title":"A cautionary tale on fitting decision trees to data from additive models: generalization lower bounds","created":"2021-10-18","cited_by_count":9,"area":null},{"id":"2302.06812","title":"Scalable Optimal Multiway-Split Decision Trees with Constraints","created":"2023-02-14","cited_by_count":9,"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":"2402.14474","title":"Data Science with LLMs and Interpretable Models","created":"2024-02-22","cited_by_count":8,"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":"2210.10567","title":"Margin Optimal Classification Trees","created":"2022-10-19","cited_by_count":7,"area":null},{"id":"2310.13841","title":"Fast hyperboloid decision tree algorithms","created":"2023-10-20","cited_by_count":7,"area":null},{"id":"2111.08674","title":"Multiclass Optimal Classification Trees with SVM-splits","created":"2021-11-16","cited_by_count":6,"area":null},{"id":"2304.11749","title":"Missing Values and Imputation in Healthcare Data: Can Interpretable Machine Learning Help?","created":"2023-04-23","cited_by_count":6,"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":"2401.14512","title":"Who Are We Missing? A Principled Approach to Characterizing the Underrepresented Population","created":"2024-01-25","cited_by_count":6,"area":null},{"id":"2402.03774","title":"Learning a Decision Tree Algorithm with Transformers","created":"2024-02-06","cited_by_count":6,"area":null},{"id":"2503.14217","title":"Decision Tree Induction Through LLMs via Semantically-Aware Evolution","created":"2025-03-18","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":"2309.15312","title":"MAPTree: Beating \"Optimal\" Decision Trees with Bayesian Decision Trees","created":"2023-09-26","cited_by_count":5,"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":"2401.04489","title":"Optimal Survival Trees: A Dynamic Programming Approach","created":"2024-01-09","cited_by_count":5,"area":null},{"id":"2401.15330","title":"Optimal Sparse Survival Trees","created":"2024-01-27","cited_by_count":5,"area":null},{"id":"2403.05652","title":"\"What is Different Between These Datasets?\" A Framework for Explaining Data Distribution Shifts","created":"2024-03-08","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":"2205.15263","title":"bsnsing: A decision tree induction method based on recursive optimal boolean rule composition","created":"2022-05-30","cited_by_count":3,"area":null},{"id":"2404.06403","title":"Online Learning of Decision Trees with Thompson Sampling","created":"2024-04-09","cited_by_count":3,"area":null},{"id":"2405.15911","title":"Learning accurate and interpretable tree-based models","created":"2024-05-24","cited_by_count":3,"area":null},{"id":"2110.00392","title":"Tree in Tree: from Decision Trees to Decision Graphs","created":"2021-10-01","cited_by_count":2,"area":null},{"id":"2211.10502","title":"A Mathematical Programming Approach to Optimal Classification Forests","created":"2022-11-18","cited_by_count":2,"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":"2309.09917","title":"Evaluation of Human-Understandability of Global Model Explanations using Decision Tree","created":"2023-09-18","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":"2503.06985","title":"Learning Decision Trees as Amortized Structure Inference","created":"2025-03-10","cited_by_count":2,"area":null},{"id":"2505.23615","title":"Learning Interpretable Differentiable Logic Networks for Tabular Regression","created":"2025-05-29","cited_by_count":2,"area":null},{"id":"2204.07235","title":"Harnessing Interpretable Machine Learning for Holistic Inverse Design of Origami","created":"2022-04-12","cited_by_count":1,"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":"2304.00731","title":"An Interpretable Loan Credit Evaluation Method Based on Rule Representation Learner","created":"2023-04-03","cited_by_count":1,"area":null},{"id":"2304.10830","title":"Rolling Lookahead Learning for Optimal Classification Trees","created":"2023-04-21","cited_by_count":1,"area":null},{"id":"2502.19502","title":"Models That Are Interpretable But Not Transparent","created":"2025-02-26","cited_by_count":1,"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":"2507.03884","title":"Leo Breiman, the Rashomon Effect, and the Occam Dilemma","created":"2025-07-05","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":"2603.15321","title":"CASHomon Sets: Efficient Rashomon Sets Across Multiple Model Classes and their Hyperparameters","created":"2026-03-16","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":"2101.08656","title":"Dive into Decision Trees and Forests: A Theoretical Demonstration","created":"2021-01-20","cited_by_count":0,"area":null},{"id":"2106.11389","title":"Robust and Heterogenous Odds Ratio: Estimating Price Sensitivity for Unbought Items","created":"2021-06-21","cited_by_count":0,"area":null},{"id":"2205.15135","title":"Group Probability-Weighted Tree Sums for Interpretable Modeling of Heterogeneous Data","created":"2022-05-30","cited_by_count":0,"area":null},{"id":"2305.07959","title":"A Novel Memetic Strategy for Optimized Learning of Classification Trees","created":"2023-05-13","cited_by_count":0,"area":null},{"id":"2306.00857","title":"Loss-Optimal Classification Trees: A Generalized Framework and the Logistic Case","created":"2023-06-01","cited_by_count":0,"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":"2405.15314","title":"Output-Constrained Decision Trees","created":"2024-05-24","cited_by_count":0,"area":null},{"id":"2406.10213","title":"Selecting Interpretability Techniques for Healthcare Machine Learning models","created":"2024-06-14","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":"2504.06927","title":"RO-FIGS: Efficient and Expressive Tree-Based Ensembles for Tabular Data","created":"2025-04-09","cited_by_count":0,"area":null},{"id":"2505.02224","title":"Enhanced Outsourced and Secure Inference for Tall Sparse Decision Trees","created":"2025-05-04","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":"2509.17774","title":"Efficient & Correct Predictive Equivalence for Decision Trees","created":"2025-09-22","cited_by_count":0,"area":null},{"id":"2510.19040","title":"Empowering Decision Trees via Shape Function Branching","created":"2025-10-21","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.04000","title":"Towards Scalable Meta-Learning of near-optimal Interpretable Models via Synthetic Model Generations","created":"2025-11-06","cited_by_count":0,"area":null},{"id":"2512.07578","title":"$\\phi$-Table: A Statistical Explanation for Global SHAP","created":"2025-12-08","cited_by_count":0,"area":null},{"id":"2603.07606","title":"TT-Sparse: Learning Sparse Rule Models with Differentiable Truth Tables","created":"2026-03-08","cited_by_count":0,"area":null},{"id":"2607.02069","title":"Algebraic Model Counting for Global Analysis of Optimal Decision Trees","created":"2026-07-02","cited_by_count":0,"area":null},{"id":"2607.14318","title":"Counterfactual Optimal Action Trees (COAT): Interpretable Prescriptive Policies from Observational Data","created":"2026-07-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":"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":"2608.29262","title":"Adaptive Multi-Branching for Shallow Decision Tree Induction","created":"2026-08-29","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},{"id":"2610.04385","title":"Largest Rashomon sets of decision trees for robust contextual optimization","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}