{"total":36,"rows":[{"id":"2305.17021","title":"GLOBE-CE: A Translation-Based Approach for Global Counterfactual Explanations","created":"2023-05-26","cited_by_count":27,"area":null},{"id":"2209.07740","title":"Computing Abductive Explanations for Boosted Trees","created":"2022-09-16","cited_by_count":23,"area":null},{"id":"2301.11113","title":"Finding Regions of Counterfactual Explanations via Robust Optimization","created":"2023-01-26","cited_by_count":19,"area":null},{"id":"2302.03225","title":"Efficient XAI Techniques: A Taxonomic Survey","created":"2023-02-07","cited_by_count":14,"area":null},{"id":"2305.05840","title":"Achieving Diversity in Counterfactual Explanations: a Review and Discussion","created":"2023-05-10","cited_by_count":11,"area":null},{"id":"2402.19232","title":"Trained Random Forests Completely Reveal your Dataset","created":"2024-02-29","cited_by_count":11,"area":null},{"id":"2204.06917","title":"Global Counterfactual Explanations: Investigations, Implementations and Improvements","created":"2022-04-14","cited_by_count":9,"area":null},{"id":"2310.12822","title":"Generating collective counterfactual explanations in score-based classification via mathematical optimization","created":"2023-10-19","cited_by_count":9,"area":null},{"id":"2306.00497","title":"The Risks of Recourse in Binary Classification","created":"2023-06-01","cited_by_count":8,"area":null},{"id":"2211.01498","title":"On the Safety of Interpretable Machine Learning: A Maximum Deviation Approach","created":"2022-11-02","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.01098","title":"Learning Decision Trees and Forests with Algorithmic Recourse","created":"2024-06-03","cited_by_count":7,"area":null},{"id":"2401.14086","title":"Generating Likely Counterfactuals Using Sum-Product Networks","created":"2024-01-25","cited_by_count":6,"area":null},{"id":"2503.07934","title":"Counterfactual Explanations for Model Ensembles Using Entropic Risk Measures","created":"2025-03-11","cited_by_count":5,"area":null},{"id":"2303.02883","title":"Very fast, approximate counterfactual explanations for decision forests","created":"2023-03-06","cited_by_count":4,"area":null},{"id":"2308.12820","title":"Prediction without Preclusion: Recourse Verification with Reachable Sets","created":"2023-08-24","cited_by_count":4,"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":"2502.05325","title":"From Counterfactuals to Trees: Competitive Analysis of Model Extraction Attacks","created":"2025-02-07","cited_by_count":3,"area":null},{"id":"2202.07356","title":"Realistic Counterfactual Explanations with Learned Relations","created":"2022-02-15","cited_by_count":2,"area":null},{"id":"2205.14116","title":"Don't Explain Noise: Robust Counterfactuals for Randomized Ensembles","created":"2022-05-27","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":"2304.14606","title":"Algorithmic Recourse with Missing Values","created":"2023-04-28","cited_by_count":2,"area":null},{"id":"2402.09473","title":"One-for-many Counterfactual Explanations by Column Generation","created":"2024-02-12","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":"2605.06278","title":"PACE: Prune-And-Compress Ensemble Models","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2605.06561","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2209.14568","title":"Local and Regional Counterfactual Rules: Summarized and Robust Recourses","created":"2022-09-29","cited_by_count":0,"area":null},{"id":"2211.02151","title":"Decomposing Counterfactual Explanations for Consequential Decision Making","created":"2022-11-03","cited_by_count":0,"area":null},{"id":"2309.08945","title":"Inverse classification with logistic and softmax classifiers: efficient optimization","created":"2023-09-16","cited_by_count":0,"area":null},{"id":"2311.07797","title":"Explainable History Distillation by Marked Temporal Point Process","created":"2023-11-13","cited_by_count":0,"area":null},{"id":"2405.13740","title":"Mining Action Rules for Defect Reduction Planning","created":"2024-05-22","cited_by_count":0,"area":null},{"id":"2511.20236","title":"Actionable and diverse counterfactual explanations incorporating domain knowledge and plausibility constraints","created":"2025-11-25","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},{"id":"2605.30901","title":"Density-Guided Robust Counterfactual Explanations on Tabular Data under Model Multiplicity","created":"2026-05-29","cited_by_count":0,"area":null},{"id":"2608.19127","title":"Leaf Values as Coordinates: Exact Contrastive Explanation for Gradient-Boosted Ensembles","created":"2026-08-19","cited_by_count":0,"area":null}],"next_cursor":null}