{"list":"other","total":62,"rows":[{"id":"1610.02391","title":"Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localization","created":"2016-10-07","cited_by_count":6733},{"id":"1705.07874","title":"A Unified Approach to Interpreting Model Predictions","created":"2017-05-22","cited_by_count":6555},{"id":"1706.06083","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","created":"2017-06-19","cited_by_count":6415},{"id":"1602.04938","title":"\"Why Should I Trust You?\": Explaining the Predictions of Any Classifier","created":"2016-02-16","cited_by_count":5070},{"id":"1703.01365","title":"Axiomatic Attribution for Deep Networks","created":"2017-03-04","cited_by_count":3384},{"id":"2106.01946","title":"Convex optimization","created":"2021-06-03","cited_by_count":2515},{"id":"1610.02413","title":"Equality of Opportunity in Supervised Learning","created":"2016-10-07","cited_by_count":2007},{"id":"1703.04730","title":"Understanding Black-box Predictions via Influence Functions","created":"2017-03-14","cited_by_count":1741},{"id":"1802.00420","title":"Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examples","created":"2018-02-01","cited_by_count":1268},{"id":"1706.03825","title":"SmoothGrad: removing noise by adding noise","created":"2017-06-12","cited_by_count":1109},{"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":"1711.00851","title":"Provable defenses against adversarial examples via the convex outer adversarial polytope","created":"2017-11-02","cited_by_count":567},{"id":"2108.04884","title":"Retiring Adult: New Datasets for Fair Machine Learning","created":"2021-08-10","cited_by_count":449},{"id":"1809.06514","title":"Actionable Recourse in Linear Classification","created":"2018-09-18","cited_by_count":328},{"id":"2002.06673","title":"Performative Prediction","created":"2020-02-16","cited_by_count":327},{"id":"1703.09207","title":"Fairness in Criminal Justice Risk Assessments: The State of the Art","created":"2017-03-27","cited_by_count":315},{"id":"1907.02584","title":"Interpretable Counterfactual Explanations Guided by Prototypes","created":"2019-07-03","cited_by_count":223},{"id":"1905.11190","title":"Model-Agnostic Counterfactual Explanations for Consequential Decisions","created":"2019-05-27","cited_by_count":204},{"id":"1802.05399","title":"Competitive caching with machine learned advice","created":"2018-02-15","cited_by_count":195},{"id":"1712.01208","title":"The Case for Learned Index Structures","created":"2017-12-04","cited_by_count":188},{"id":"1909.06677","title":"Predictive Multiplicity in Classification","created":"2019-09-14","cited_by_count":166},{"id":"2006.09123","title":"Algorithms with Predictions","created":"2020-06-16","cited_by_count":153},{"id":"1910.09398","title":"Learning Model-Agnostic Counterfactual Explanations for Tabular Data","created":"2019-10-21","cited_by_count":146},{"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":"2112.08304","title":"On the Convergence and Robustness of Adversarial Training","created":"2021-12-15","cited_by_count":130},{"id":"1912.04930","title":"The Hidden Assumptions Behind Counterfactual Explanations and Principal Reasons","created":"2019-12-10","cited_by_count":115},{"id":"2106.02666","title":"Counterfactual Explanations Can Be Manipulated","created":"2021-06-04","cited_by_count":113},{"id":"2102.13620","title":"Towards Robust and Reliable Algorithmic Recourse","created":"2021-02-26","cited_by_count":102},{"id":"2209.08040","title":"Exploring the Whole Rashomon Set of Sparse Decision Trees","created":"2022-09-16","cited_by_count":81},{"id":"2407.17712","title":"Improving Online Algorithms via ML Predictions","created":"2024-07-25","cited_by_count":66},{"id":"1602.08610","title":"Scalable Bayesian Rule Lists","created":"2016-02-27","cited_by_count":64},{"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":"2106.09992","title":"Exploring Counterfactual Explanations Through the Lens of Adversarial Examples: A Theoretical and Empirical Analysis","created":"2021-06-18","cited_by_count":52},{"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":"2207.02739","title":"Robust Counterfactual Explanations for Tree-Based Ensembles","created":"2022-07-06","cited_by_count":49},{"id":"2103.01028","title":"Information Discrepancy in Strategic Learning","created":"2021-03-01","cited_by_count":48},{"id":"2102.10618","title":"Towards the Unification and Robustness of Perturbation and Gradient Based Explanations","created":"2021-02-21","cited_by_count":47},{"id":"2305.11997","title":"Robust Counterfactual Explanations for Neural Networks With Probabilistic Guarantees","created":"2023-05-19","cited_by_count":45},{"id":"2203.06768","title":"Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recourse","created":"2022-03-13","cited_by_count":40},{"id":"2110.03109","title":"Consistent Counterfactuals for Deep Models","created":"2021-10-06","cited_by_count":37},{"id":"2402.01928","title":"Robust Counterfactual Explanations in Machine Learning: A Survey","created":"2024-02-02","cited_by_count":29},{"id":"2012.10438","title":"Efficient Training of Robust Decision Trees Against Adversarial Examples","created":"2020-12-18","cited_by_count":24},{"id":"2208.14137","title":"On the Trade-Off between Actionable Explanations and the Right to be Forgotten","created":"2022-08-30","cited_by_count":20},{"id":"2204.01120","title":"Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location","created":"2022-04-03","cited_by_count":19},{"id":"2206.10833","title":"Robust Bayesian Recourse","created":"2022-06-22","cited_by_count":18},{"id":"2312.06564","title":"Promoting Counterfactual Robustness through Diversity","created":"2023-12-11","cited_by_count":17},{"id":"2312.15097","title":"Recourse under Model Multiplicity via Argumentative Ensembling (Technical Report)","created":"2023-12-22","cited_by_count":15},{"id":"1911.04681","title":"On Robustness to Adversarial Examples and Polynomial Optimization","created":"2019-11-12","cited_by_count":14},{"id":"2210.06732","title":"Equal Improvability: A New Fairness Notion Considering the Long-term Impact","created":"2022-10-13","cited_by_count":13},{"id":"2309.06969","title":"Setting the Right Expectations: Algorithmic Recourse Over Time","created":"2023-09-13","cited_by_count":13},{"id":"2302.11211","title":"Distributionally Robust Recourse Action","created":"2023-02-22","cited_by_count":12},{"id":"2109.03857","title":"Robust Optimal Classification Trees Against Adversarial Examples","created":"2021-09-08","cited_by_count":11},{"id":"2206.00700","title":"RoCourseNet: Distributionally Robust Training of a Prediction Aware Recourse Model","created":"2022-06-01","cited_by_count":11},{"id":"2401.16088","title":"Fairness in Algorithmic Recourse Through the Lens of Substantive Equality of Opportunity","created":"2024-01-29","cited_by_count":9},{"id":"2306.00497","title":"The Risks of Recourse in Binary Classification","created":"2023-06-01","cited_by_count":8},{"id":"2205.11313","title":"Mechanism Design with Predictions","created":"2022-05-23","cited_by_count":7},{"id":"2405.18875","title":"Counterfactual Metarules for Local and Global Recourse","created":"2024-05-29","cited_by_count":7},{"id":"2406.01098","title":"Learning Decision Trees and Forests with Algorithmic Recourse","created":"2024-06-03","cited_by_count":7},{"id":"2210.11222","title":"Learning-Augmented Private Algorithms for Multiple Quantile Release","created":"2022-10-20","cited_by_count":5},{"id":"2102.03785","title":"Robust Explanations for Private Support Vector Machines","created":"2021-02-07","cited_by_count":4}],"next_cursor":null}