Fetching the paper…
Reading the bibliography…
As predictive models are increasingly being deployed in high-stakes decision-making, there has been a lot of interest in developing algorithms which can provide recourses to affected individuals.
Rank analysis of incomplete block designs: I. the method of paired comparisons
Ralph Allan Bradley and Milton E. Terry · 1952
Earlier work this paper cites.
Individual choice behavior: a theoretical analysis
R.D. Luce · 1959
Earlier work this paper cites.
The budgeted maximum coverage problem
Samir Khuller, Anna Moss, and Joseph Seffi Naor · 1999
Earlier work this paper cites.
Mm algorithms for generalized bradley-terry models
David R. Hunter · 2004
Earlier work this paper cites.
Non-monotone submodular maximization under matroid and knapsack constraints
Jon Lee, Vahab S Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko · 2009
Earlier work this paper cites.
Efficient bayesian inference for generalized bradley—terry models
François Caron and Arnaud Doucet · 2012
Earlier work this paper cites.
Deep inside convolutional networks: Visualising image classification models and saliency maps
Karen Simonyan, Andrea Vedaldi, and Andrew Zisserman · 2013
Earlier work this paper cites.
How much is 131 million dollars? putting numbers in perspective with compositional descriptions
Arun Tejasvi Chaganty and Percy Liang · 2016
Earlier work this paper cites.
Interpretable decision sets: A joint framework for description and prediction
Himabindu Lakkaraju, Stephen H Bach, and Jure Leskovec · 2016
Earlier work this paper cites.
How we analyzed the compas recidivism algorithm, May 2016
Jeff Larson, Surya Mattu, Lauren Kirchner, and Julia Angwin · 2016
Earlier work this paper cites.
" why should i trust you?" explaining the predictions of any classifier
Marco Tulio Ribeiro, Sameer Singh, and Carlos Guestrin · 2016
Earlier work this paper cites.
Interpretability via model extraction
Osbert Bastani, Carolyn Kim, and Hamsa Bastani · 2017
Earlier work this paper cites.
Towards a rigorous science of interpretable machine learning
Finale Doshi-Velez and Been Kim · 2017
Earlier work this paper cites.
UCI machine learning repository, 2017
Dheeru Dua and Casey Graff · 2017
Cited alongside, same era.
Understanding black-box predictions via influence functions
Pang Wei Koh and Percy Liang · 2017
Cited alongside, same era.
A unified approach to interpreting model predictions
Scott M Lundberg and Su-In Lee · 2017
Cited alongside, same era.
Grad-cam: Visual explanations from deep networks via gradient-based localization
Ramprasaath R Selvaraju, Michael Cogswell, Abhishek Das, Ramakrishna Vedantam, Devi Parikh, and Dhruv Batra · 2017
Cited alongside, same era.
Smoothgrad: removing noise by adding noise
Daniel Smilkov, Nikhil Thorat, Been Kim, Fernanda Viégas, and Martin Wattenberg · 2017
Cited alongside, same era.
Axiomatic attribution for deep networks
Mukund Sundararajan, Ankur Taly, and Qiqi Yan · 2017
Interpretable counterfactual explanations guided by prototypes, 2019
Arnaud Van Looveren and Janis Klaise · 2019
Later among the works it cites.
Actionable interpretability through optimizable counterfactual explanations for tree ensembles, 2019
Ana Lucic, Harrie Oosterhuis, Hinda Haned, and Maarten de Rijke · 2019
Later among the works it cites.
Generating counterfactual and contrastive explanations using shap, 2019
Shubham Rathi · 2019
Later among the works it cites.
Actionable recourse in linear classification
Berk Ustun, Alexander Spangher, and Yang Liu · 2019
Later among the works it cites.
The hidden assumptions behind counterfactual explanations and principal reasons
Solon Barocas, Andrew D. Selbst, and Manish Raghavan · 2020
Closest in time.
Multi-objective counterfactual explanations
Susanne Dandl, Christoph Molnar, Martin Binder, and Bernd Bischl · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Interpretable predictions of tree-based ensembles via actionable feature tweaking
Gabriele Tolomei, Fabrizio Silvestri, Andrew Haines, and Mounia Lalmas · 2017
Cited alongside, same era.
Anchors: High-precision model-agnostic explanations
Marco Tulio Ribeiro, Sameer Singh, and Carlos Guestrin · 2018
Cited alongside, same era.
Counterfactual explanations without opening the black box: automated decisions and the gdpr
S Wachter, BDM Mittelstadt, and C Russell · 2018
Cited alongside, same era.
Towards realistic individual recourse and actionable explanations in black-box decision making systems, 2019
Shalmali Joshi, Oluwasanmi Koyejo, Warut Vijitbenjaronk, Been Kim, and Joydeep Ghosh · 2019
Cited alongside, same era.
Model-agnostic counterfactual explanations for consequential decisions, 2019
Amir-Hossein Karimi, Gilles Barthe, Borja Balle, and Isabel Valera · 2019
Cited alongside, same era.
Faithful and customizable explanations of black box models
Himabindu Lakkaraju, Ece Kamar, Rich Caruana, and Jure Leskovec · 2019
Cited alongside, same era.
Closest in time.
Algorithmic recourse: from counterfactual explanations to interventions, 2020
Amir-Hossein Karimi, Bernhard Schölkopf, and Isabel Valera · 2020
Closest in time.
Explaining machine learning classifiers through diverse counterfactual explanations
Ramaravind K. Mothilal, Amit Sharma, and Chenhao Tan · 2020
Closest in time.
Learning model-agnostic counterfactual explanations for tabular data
Martin Pawelczyk, Klaus Broelemann, and Gjergji Kasneci · 2020
Closest in time.
Explaining groups of points in low-dimensional representations, 2020
Gregory Plumb, Jonathan Terhorst, Sriram Sankararaman, and Ameet Talwalkar · 2020
Closest in time.
Face: Feasible and actionable counterfactual explanations
Rafael Poyiadzi, Kacper Sokol, Raul Santos-Rodriguez, Tijl De Bie, and Peter Flach · 2020
Closest in time.
The philosophical basis of algorithmic recourse
Suresh Venkatasubramanian and Mark Alfano · 2020
Closest in time.