{"total":101,"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":"2201.00382","title":"ECOD: Unsupervised Outlier Detection Using Empirical Cumulative Distribution Functions","created":"2022-01-02","cited_by_count":153,"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":"2207.01018","title":"Symbolic Regression is NP-hard","created":"2022-07-03","cited_by_count":71,"area":null},{"id":"2202.00734","title":"Framework for Evaluating Faithfulness of Local Explanations","created":"2022-02-01","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":"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":"2103.15965","title":"Strong Optimal Classification Trees","created":"2021-03-29","cited_by_count":28,"area":null},{"id":"2204.10806","title":"A Taxonomy of Human and ML Strengths in Decision-Making to Investigate Human-ML Complementarity","created":"2022-04-22","cited_by_count":23,"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":"2310.14034","title":"Tree Prompting: Efficient Task Adaptation without Fine-Tuning","created":"2023-10-21","cited_by_count":18,"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":"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":"2306.01744","title":"Disproving XAI Myths with Formal Methods -- Initial Results","created":"2023-05-13","cited_by_count":12,"area":null},{"id":"2109.03857","title":"Robust Optimal Classification Trees Against Adversarial Examples","created":"2021-09-08","cited_by_count":11,"area":null},{"id":"2110.03195","title":"Coresets for Decision Trees of Signals","created":"2021-10-07","cited_by_count":10,"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":"2401.03451","title":"Optimization Over Trained Neural Networks: Taking a Relaxing Walk","created":"2024-01-07","cited_by_count":10,"area":null},{"id":"2406.03059","title":"Efficient Exploration of the Rashomon Set of Rule Set Models","created":"2024-06-05","cited_by_count":10,"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":"2205.09569","title":"Provably Precise, Succinct and Efficient Explanations for Decision Trees","created":"2022-05-19","cited_by_count":8,"area":null},{"id":"2410.06352","title":"Tree-Based Leakage Inspection and Control in Concept Bottleneck Models","created":"2024-10-08","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":"2102.01904","title":"A Scalable Two Stage Approach to Computing Optimal Decision Sets","created":"2021-02-03","cited_by_count":7,"area":null},{"id":"2210.10567","title":"Margin Optimal Classification Trees","created":"2022-10-19","cited_by_count":7,"area":null},{"id":"2406.01098","title":"Learning Decision Trees and Forests with Algorithmic Recourse","created":"2024-06-03","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":"2203.01900","title":"Sparse Bayesian Optimization","created":"2022-03-03","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":"2303.04437","title":"Learning Hybrid Interpretable Models: Theory, Taxonomy, and Methods","created":"2023-03-08","cited_by_count":5,"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":"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":"2104.10751","title":"Rule Generation for Classification: Scalability, Interpretability, and Fairness","created":"2021-04-21","cited_by_count":4,"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":"2410.11449","title":"Conditional Density Estimation with Histogram Trees","created":"2024-10-15","cited_by_count":4,"area":null},{"id":"2601.12913","title":"Actionable Interpretability Must Be Defined in Terms of Symmetries","created":"2026-01-19","cited_by_count":4,"area":null},{"id":"2108.07307","title":"Synthesizing Pareto-Optimal Interpretations for Black-Box Models","created":"2021-08-16","cited_by_count":3,"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":"2407.18482","title":"Practical Attribution Guidance for Rashomon Sets","created":"2024-07-26","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":"2110.13854","title":"Interpretable Decision Trees Through MaxSAT","created":"2021-10-26","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":"2305.02093","title":"Efficient Online Decision Tree Learning with Active Feature Acquisition","created":"2023-05-03","cited_by_count":2,"area":null},{"id":"2308.10699","title":"Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach","created":"2023-08-21","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.06770","title":"Unique Rashomon Sets for Robust Active Learning","created":"2025-03-09","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":"2601.14765","title":"Anytime Optimal Decision Tree Learning with Continuous Features","created":"2026-01-21","cited_by_count":2,"area":null},{"id":"2602.11944","title":"Using predictive multiplicity to measure individual performance within the AI Act","created":"2026-02-12","cited_by_count":2,"area":null},{"id":"2105.05019","title":"Learning Optimal Decision Making for an Industrial Truck Unloading Robot using Minimal Simulator Runs","created":"2021-03-13","cited_by_count":1,"area":null},{"id":"2201.03092","title":"Uncovering the Source of Machine Bias","created":"2022-01-09","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":"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":"2305.05827","title":"Inclusive FinTech Lending via Contrastive Learning and Domain Adaptation","created":"2023-05-10","cited_by_count":1,"area":null},{"id":"2401.09918","title":"Probabilistic Truly Unordered Rule Sets","created":"2024-01-18","cited_by_count":1,"area":null},{"id":"2501.05942","title":"Soft regression trees: a model variant and a decomposition training algorithm","created":"2025-01-10","cited_by_count":1,"area":null},{"id":"2502.09502","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","created":"2025-02-13","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":"2511.20189","title":"Learning Subgroups with Maximum Treatment Effects without Causal Heuristics","created":"2025-11-25","cited_by_count":1,"area":null},{"id":"2603.22750","title":"REALITrees: Rashomon Ensemble Active Learning for Interpretable Trees","created":"2026-03-24","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":"2103.01926","title":"Slow-Growing Trees","created":"2021-03-02","cited_by_count":0,"area":null},{"id":"2206.15363","title":"Why we do need Explainable AI for Healthcare","created":"2022-06-30","cited_by_count":0,"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":"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":"2306.11481","title":"Learning Locally Interpretable Rule Ensemble","created":"2023-06-20","cited_by_count":0,"area":null},{"id":"2311.01994","title":"Distributionally Robust Regularization of Sparse Integer Programming Trained Learning Models","created":"2023-11-03","cited_by_count":0,"area":null},{"id":"2401.04282","title":"Efficient Constrained Graph Search for Post-hoc Error Correction in Binary Classifiers","created":"2024-01-08","cited_by_count":0,"area":null},{"id":"2408.12304","title":"OPTDTALS: Approximate Logic Synthesis via Optimal Decision Trees Approach","created":"2024-08-22","cited_by_count":0,"area":null},{"id":"2411.13376","title":"ODTE -- An ensemble of multi-class SVM-based oblique decision trees","created":"2024-11-20","cited_by_count":0,"area":null},{"id":"2503.17855","title":"A novel gradient-based method for decision trees optimizing arbitrary differential loss functions","created":"2025-03-22","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":"2507.10546","title":"Disentangling Neural Disjunctive Normal Form Models","created":"2025-07-14","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.07832","title":"Surrogate Graph Partitioning for Spatial Prediction","created":"2025-10-09","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":"2512.07578","title":"$\\phi$-Table: A Statistical Explanation for Global SHAP","created":"2025-12-08","cited_by_count":0,"area":null},{"id":"2607.13874","title":"Relevance-Aware Rule: Structural Deletion of Irrelevant Conditions in Decision Trees","created":"2026-07-15","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.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.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}],"next_cursor":"100"}