{"total":37,"rows":[{"id":"2112.00798","title":"Fast Sparse Decision Tree Optimization via Reference Ensembles","created":"2021-12-01","cited_by_count":38,"area":null},{"id":"2106.06631","title":"Optimal Counterfactual Explanations in Tree Ensembles","created":"2021-06-11","cited_by_count":36,"area":null},{"id":"2111.01576","title":"Provably efficient, succinct, and precise explanations","created":"2021-11-01","cited_by_count":32,"area":null},{"id":"2101.01576","title":"On the price of explainability for some clustering problems","created":"2021-01-05","cited_by_count":21,"area":null},{"id":"2205.14500","title":"Optimal Decision Diagrams for Classification","created":"2022-05-28","cited_by_count":10,"area":null},{"id":"2208.10930","title":"FS-BAN: Born-Again Networks for Domain Generalization Few-Shot Classification","created":"2022-08-23","cited_by_count":9,"area":null},{"id":"2210.06375","title":"Superpolynomial Lower Bounds for Decision Tree Learning and Testing","created":"2022-10-12","cited_by_count":9,"area":null},{"id":"2207.07072","title":"A Query-Optimal Algorithm for Finding Counterfactuals","created":"2022-07-14","cited_by_count":7,"area":null},{"id":"2301.10074","title":"Explainable Data-Driven Optimization: From Context to Decision and Back Again","created":"2023-01-24","cited_by_count":7,"area":null},{"id":"2406.10529","title":"A Theory of Interpretable Approximations","created":"2024-06-15","cited_by_count":7,"area":null},{"id":"2307.04093","title":"Properly Learning Decision Trees with Queries Is NP-Hard","created":"2023-07-09","cited_by_count":5,"area":null},{"id":"2408.16167","title":"Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles","created":"2024-08-28","cited_by_count":4,"area":null},{"id":"2206.07904","title":"Explainable Models via Compression of Tree Ensembles","created":"2022-06-16","cited_by_count":3,"area":null},{"id":"2302.05270","title":"Conceptual Views on Tree Ensemble Classifiers","created":"2023-02-10","cited_by_count":3,"area":null},{"id":"2306.04423","title":"On Computing Optimal Tree Ensembles","created":"2023-06-07","cited_by_count":3,"area":null},{"id":"2502.05325","title":"From Counterfactuals to Trees: Competitive Analysis of Model Extraction Attacks","created":"2025-02-07","cited_by_count":3,"area":null},{"id":"2207.06355","title":"Contextual Decision Trees","created":"2022-07-13","cited_by_count":2,"area":null},{"id":"2207.07690","title":"Support Vector Machines with the Hard-Margin Loss: Optimal Training via Combinatorial Benders' Cuts","created":"2022-07-15","cited_by_count":2,"area":null},{"id":"2302.07580","title":"Unboxing Tree Ensembles for interpretability: a hierarchical visualization tool and a multivariate optimal re-built tree","created":"2023-02-15","cited_by_count":2,"area":null},{"id":"2602.09128","title":"Counterfactual Maps: What They Are and How to Find Them","created":"2026-02-09","cited_by_count":2,"area":null},{"id":"2211.09894","title":"Supervised Feature Compression based on Counterfactual Analysis","created":"2022-11-17","cited_by_count":1,"area":null},{"id":"2212.07103","title":"Simplification of Forest Classifiers and Regressors","created":"2022-12-14","cited_by_count":1,"area":null},{"id":"2406.13427","title":"Are Logistic Models Really Interpretable?","created":"2024-06-19","cited_by_count":1,"area":null},{"id":"2407.00843","title":"A Unified Approach to Extract Interpretable Rules from Tree Ensembles via Integer Programming","created":"2024-06-30","cited_by_count":1,"area":null},{"id":"2409.03164","title":"RuleExplorer: A Scalable Matrix Visualization for Understanding Tree Ensemble Classifiers","created":"2024-09-05","cited_by_count":1,"area":null},{"id":"2507.22665","title":"Cluster-Based Random Forest Visualization and Interpretation","created":"2025-07-30","cited_by_count":1,"area":null},{"id":"2603.25466","title":"Residual-as-Teacher: Mitigating Bias Propagation in Student--Teacher Estimation","created":"2026-03-26","cited_by_count":1,"area":null},{"id":"2605.06278","title":"PACE: Prune-And-Compress Ensemble Models","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2106.02824","title":"Making CNNs Interpretable by Building Dynamic Sequential Decision Forests with Top-down Hierarchy Learning","created":"2021-06-05","cited_by_count":0,"area":null},{"id":"2206.14359","title":"TE2Rules: Explaining Tree Ensembles using Rules","created":"2022-06-29","cited_by_count":0,"area":null},{"id":"2211.06360","title":"Rethinking Log Odds: Linear Probability Modelling and Expert Advice in Interpretable Machine Learning","created":"2022-11-11","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":"2312.01884","title":"Correlation and Unintended Biases on Univariate and Multivariate Decision Trees","created":"2023-12-04","cited_by_count":0,"area":null},{"id":"2408.16321","title":"Minimising changes to audit when updating decision trees","created":"2024-08-29","cited_by_count":0,"area":null},{"id":"2510.18615","title":"A Rectification-Based Approach for Distilling Boosted Trees into Decision Trees","created":"2025-10-21","cited_by_count":0,"area":null},{"id":"2605.11841","title":"Minimax Rates and Spectral Distillation for Tree Ensembles","created":"2026-05-12","cited_by_count":0,"area":null},{"id":"2605.28068","title":"PINE: Pruning Boosted Tree Ensembles with Conformal In-Distribution Prediction Equivalence","created":"2026-05-27","cited_by_count":0,"area":null}],"next_cursor":null}