{"total":39,"rows":[{"id":"2306.06123","title":"Adversarial attacks and defenses in explainable artificial intelligence: A survey","created":"2023-06-06","cited_by_count":48,"area":null},{"id":"2305.11997","title":"Robust Counterfactual Explanations for Neural Networks With Probabilistic Guarantees","created":"2023-05-19","cited_by_count":45,"area":null},{"id":"2402.01928","title":"Robust Counterfactual Explanations in Machine Learning: A Survey","created":"2024-02-02","cited_by_count":29,"area":null},{"id":"2309.12545","title":"Provably Robust and Plausible Counterfactual Explanations for Neural Networks via Robust Optimisation","created":"2023-09-22","cited_by_count":20,"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":"2312.06564","title":"Promoting Counterfactual Robustness through Diversity","created":"2023-12-11","cited_by_count":17,"area":null},{"id":"2304.12943","title":"Generating robust counterfactual explanations","created":"2023-04-24","cited_by_count":13,"area":null},{"id":"2309.06969","title":"Setting the Right Expectations: Algorithmic Recourse Over Time","created":"2023-09-13","cited_by_count":13,"area":null},{"id":"2408.04842","title":"Counterfactual Explanations with Probabilistic Guarantees on their Robustness to Model Change","created":"2024-08-09","cited_by_count":10,"area":null},{"id":"2401.16088","title":"Fairness in Algorithmic Recourse Through the Lens of Substantive Equality of Opportunity","created":"2024-01-29","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":"2410.08007","title":"Time Can Invalidate Algorithmic Recourse","created":"2024-10-10","cited_by_count":8,"area":null},{"id":"2410.22598","title":"Feature Responsiveness Scores: Model-Agnostic Explanations for Recourse","created":"2024-10-29","cited_by_count":8,"area":null},{"id":"2404.13736","title":"Interval Abstractions for Robust Counterfactual Explanations","created":"2024-04-21","cited_by_count":7,"area":null},{"id":"2407.07482","title":"Rigorous Probabilistic Guarantees for Robust Counterfactual Explanations","created":"2024-07-10","cited_by_count":6,"area":null},{"id":"2306.02786","title":"Navigating Explanatory Multiverse Through Counterfactual Path Geometry","created":"2023-06-05","cited_by_count":5,"area":null},{"id":"2312.10648","title":"Faithful Model Explanations through Energy-Constrained Conformal Counterfactuals","created":"2023-12-17","cited_by_count":5,"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":"2505.07351","title":"From Search To Sampling: Generative Models For Robust Algorithmic Recourse","created":"2025-05-12","cited_by_count":5,"area":null},{"id":"2308.07198","title":"Explaining Black-Box Models through Counterfactuals","created":"2023-08-14","cited_by_count":4,"area":null},{"id":"2402.11168","title":"Trust Regions for Explanations via Black-Box Probabilistic Certification","created":"2024-02-17","cited_by_count":4,"area":null},{"id":"2410.01580","title":"Learning-Augmented Robust Algorithmic Recourse","created":"2024-10-02","cited_by_count":4,"area":null},{"id":"2307.13885","title":"Characterizing Data Point Vulnerability via Average-Case Robustness","created":"2023-07-26","cited_by_count":3,"area":null},{"id":"2407.08497","title":"CE-QArg: Counterfactual Explanations for Quantitative Bipolar Argumentation Frameworks (Technical Report)","created":"2024-07-11","cited_by_count":3,"area":null},{"id":"2501.05795","title":"Robust Counterfactual Explanations under Model Multiplicity Using Multi-Objective Optimization","created":"2025-01-10","cited_by_count":3,"area":null},{"id":"2509.21293","title":"Optimal Robust Recourse with $L^p$-Bounded Model Change","created":"2025-09-25","cited_by_count":3,"area":null},{"id":"2304.14606","title":"Algorithmic Recourse with Missing Values","created":"2023-04-28","cited_by_count":2,"area":null},{"id":"2307.07764","title":"Explaining and visualizing black-box models through counterfactual paths","created":"2023-07-15","cited_by_count":2,"area":null},{"id":"2410.02273","title":"Perfect Counterfactuals in Imperfect Worlds: Modelling Noisy Implementation of Actions in Sequential Algorithmic Recourse","created":"2024-10-03","cited_by_count":2,"area":null},{"id":"2604.08030","title":"From Universal to Individualized Actionability: Revisiting Personalization in Algorithmic Recourse","created":"2026-04-09","cited_by_count":1,"area":null},{"id":"2607.28497","title":"The Role of Causality in Algorithmic Recourse","created":"2026-07-30","cited_by_count":1,"area":null},{"id":"2307.06941","title":"On the Connection between Game-Theoretic Feature Attributions and Counterfactual Explanations","created":"2023-07-13","cited_by_count":0,"area":null},{"id":"2502.08326","title":"Model-Free Counterfactual Subset Selection at Scale","created":"2025-02-12","cited_by_count":0,"area":null},{"id":"2507.02169","title":"Responsiveness Verification: Will Predictions Change? How Much? How Often?","created":"2025-07-02","cited_by_count":0,"area":null},{"id":"2604.09573","title":"Improving understanding and trust in AI: How users benefit from interval-based counterfactual explanations","created":"2026-02-22","cited_by_count":0,"area":null},{"id":"2606.16113","title":"RecourseBench: A Modular Framework for Reproducible Algorithmic Recourse Evaluation","created":"2026-06-15","cited_by_count":0,"area":null},{"id":"2606.18832","title":"Target-confidence Recourse Using tSeTlin machines: TRUST","created":"2026-06-17","cited_by_count":0,"area":null},{"id":"2609.12179","title":"Explanations-Driven Active Feature Acquisition for Algorithmic Recourse","created":"2026-09-10","cited_by_count":0,"area":null},{"id":"2609.39877","title":"Algorithmic Recourse Under Competition","created":"2026-09-30","cited_by_count":0,"area":null}],"next_cursor":null}