{"list":"other","total":54,"rows":[{"id":"1711.00399","title":"Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPR","created":"2017-11-01","cited_by_count":1089},{"id":"1905.07697","title":"Explaining Machine Learning Classifiers through Diverse Counterfactual Explanations","created":"2019-05-19","cited_by_count":614},{"id":"1809.06514","title":"Actionable Recourse in Linear Classification","created":"2018-09-18","cited_by_count":328},{"id":"1506.06980","title":"Strategic Classification","created":"2015-06-23","cited_by_count":257},{"id":"2002.06278","title":"Algorithmic Recourse: from Counterfactual Explanations to Interventions","created":"2020-02-14","cited_by_count":250},{"id":"1909.09369","title":"FACE: Feasible and Actionable Counterfactual Explanations","created":"2019-09-20","cited_by_count":233},{"id":"1905.11190","title":"Model-Agnostic Counterfactual Explanations for Consequential Decisions","created":"2019-05-27","cited_by_count":204},{"id":"1705.08475","title":"Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulation","created":"2017-05-23","cited_by_count":185},{"id":"1906.09208","title":"Mitigating Bias in Algorithmic Hiring: Evaluating Claims and Practices","created":"2019-06-21","cited_by_count":174},{"id":"2010.10596","title":"Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Review","created":"2020-10-20","cited_by_count":174},{"id":"1912.03277","title":"Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifiers","created":"2019-12-06","cited_by_count":144},{"id":"2006.06831","title":"Algorithmic recourse under imperfect causal knowledge: a probabilistic approach","created":"2020-06-11","cited_by_count":140},{"id":"1907.09615","title":"Towards Realistic Individual Recourse and Actionable Explanations in Black-Box Decision Making Systems","created":"2019-07-22","cited_by_count":131},{"id":"1710.07887","title":"Strategic Classification from Revealed Preferences","created":"2017-10-22","cited_by_count":128},{"id":"2010.04050","title":"A survey of algorithmic recourse: definitions, formulations, solutions, and prospects","created":"2020-10-08","cited_by_count":118},{"id":"1912.04930","title":"The Hidden Assumptions Behind Counterfactual Explanations and Principal Reasons","created":"2019-12-10","cited_by_count":115},{"id":"1901.04909","title":"Efficient Search for Diverse Coherent Explanations","created":"2019-01-02","cited_by_count":111},{"id":"1808.08460","title":"The Social Cost of Strategic Classification","created":"2018-08-25","cited_by_count":105},{"id":"2102.13620","title":"Towards Robust and Reliable Algorithmic Recourse","created":"2021-02-26","cited_by_count":102},{"id":"1910.10362","title":"Strategic Classification is Causal Modeling in Disguise","created":"2019-10-23","cited_by_count":92},{"id":"1807.05307","title":"How Do Classifiers Induce Agents To Invest Effort Strategically?","created":"2018-07-13","cited_by_count":83},{"id":"2106.00545","title":"Counterfactual Invariance to Spurious Correlations: Why and How to Pass Stress Tests","created":"2021-05-31","cited_by_count":77},{"id":"1706.06691","title":"Interpretable Predictions of Tree-based Ensembles via Actionable Feature Tweaking","created":"2017-06-20","cited_by_count":76},{"id":"2010.06529","title":"On the Fairness of Causal Algorithmic Recourse","created":"2020-10-13","cited_by_count":70},{"id":"2102.11592","title":"Strategic Classification in the Dark","created":"2021-02-23","cited_by_count":66},{"id":"2002.10066","title":"Causal Strategic Linear Regression","created":"2020-02-24","cited_by_count":65},{"id":"2103.01826","title":"Strategic Classification Made Practical","created":"2021-03-02","cited_by_count":59},{"id":"2112.11313","title":"On the Adversarial Robustness of Causal Algorithmic Recourse","created":"2021-12-21","cited_by_count":56},{"id":"1909.03166","title":"Equalizing Recourse across Groups","created":"2019-09-07","cited_by_count":55},{"id":"2105.06422","title":"Causally motivated Shortcut Removal Using Auxiliary Labels","created":"2021-05-13","cited_by_count":55},{"id":"1903.01209","title":"On the Long-term Impact of Algorithmic Decision Policies: Effort Unfairness and Feature Segregation through Social Learning","created":"2019-03-04","cited_by_count":49},{"id":"1509.07892","title":"Evasion and Hardening of Tree Ensemble Classifiers","created":"2015-09-25","cited_by_count":44},{"id":"2008.08353","title":"DECE: Decision Explorer with Counterfactual Explanations for Machine Learning Models","created":"2020-08-19","cited_by_count":38},{"id":"2012.11788","title":"Algorithmic Recourse in the Wild: Understanding the Impact of Data and Model Shifts","created":"2020-12-22","cited_by_count":36},{"id":"2106.06631","title":"Optimal Counterfactual Explanations in Tree Ensembles","created":"2021-06-11","cited_by_count":36},{"id":"2106.03827","title":"Stateful Strategic Regression","created":"2021-06-07","cited_by_count":32},{"id":"2302.04262","title":"Algorithmic Collective Action in Machine Learning","created":"2023-02-08","cited_by_count":31},{"id":"2012.10438","title":"Efficient Training of Robust Decision Trees Against Adversarial Examples","created":"2020-12-18","cited_by_count":24},{"id":"2106.03962","title":"Amortized Generation of Sequential Algorithmic Recourses for Black-box Models","created":"2021-06-07","cited_by_count":24},{"id":"1910.00057","title":"Synthesizing Action Sequences for Modifying Model Decisions","created":"2019-09-30","cited_by_count":22},{"id":"2210.15709","title":"Improvement-Focused Causal Recourse (ICR)","created":"2022-10-27","cited_by_count":20},{"id":"1807.00905","title":"Learning under selective labels in the presence of expert consistency","created":"2018-07-02","cited_by_count":18},{"id":"2011.06146","title":"Learning Models for Actionable Recourse","created":"2020-11-12","cited_by_count":18},{"id":"2208.13058","title":"Adversarial Robustness for Tabular Data through Cost and Utility Awareness","created":"2022-08-27","cited_by_count":15},{"id":"1711.07356","title":"Evaluating Robustness of Neural Networks with Mixed Integer Programming","created":"2017-11-20","cited_by_count":14},{"id":"2112.06283","title":"Bayesian Persuasion for Algorithmic Recourse","created":"2021-12-12","cited_by_count":14},{"id":"1907.01197","title":"Treant: Training Evasion-Aware Decision Trees","created":"2019-07-02","cited_by_count":12},{"id":"2305.05840","title":"Achieving Diversity in Counterfactual Explanations: a Review and Discussion","created":"2023-05-10","cited_by_count":11},{"id":"2111.01235","title":"Low-Cost Algorithmic Recourse for Users With Uncertain Cost Functions","created":"2021-11-01","cited_by_count":10},{"id":"2207.09768","title":"Learning Counterfactually Invariant Predictors","created":"2022-07-20","cited_by_count":10},{"id":"2302.14165","title":"GAM Coach: Towards Interactive and User-centered Algorithmic Recourse","created":"2023-02-27","cited_by_count":9},{"id":"2308.08187","title":"Endogenous Macrodynamics in Algorithmic Recourse","created":"2023-08-16","cited_by_count":9},{"id":"2302.11213","title":"Feasible Recourse Plan via Diverse Interpolation","created":"2023-02-22","cited_by_count":6},{"id":"1902.02979","title":"Fair Decisions Despite Imperfect Predictions","created":"2019-02-08","cited_by_count":1}],"next_cursor":null}