{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:47:20Z","timestamp":1787017640542,"version":"build-2736575974"},"reference-count":123,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T00:00:00Z","timestamp":1716940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,5,29]]},"abstract":"<jats:p>While counterfactuals have been extensively studied as an intuitive explanation of model predictions, they still have limited adoption in practice due to two obstacles: (a) They rely on excessive access to the model for explanation that the model owner may not provide; and (b) counterfactuals carry information that adversarial users can exploit to launch model extraction attacks. To address the challenges, we propose CPC, a data-driven approach to counterfactual. CPC works at the client side and gives full control and right-to-explain to model users, even when model owners opt not to. Moreover, CPC warrants that adversarial users cannot exploit counterfactuals to extract models. We formulate properties and fundamental problems underlying CPC, study their complexity and develop effective algorithms. Using real-world datasets and user study, we verify that CPC does prevent adversaries from exploiting counterfactuals for model extraction attacks, and is orders of magnitude faster than existing explainers, while maintaining comparable and often higher quality.<\/jats:p>","DOI":"10.1145\/3654933","type":"journal-article","created":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T09:44:53Z","timestamp":1717062293000},"page":"1-29","source":"Crossref","is-referenced-by-count":6,"title":["Counterfactual Explanation at Will, with Zero Privacy Leakage"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9309-7711","authenticated-orcid":false,"given":"Shuai","family":"An","sequence":"first","affiliation":[{"name":"University of Edinburgh, Edinburgh, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7984-3219","authenticated-orcid":false,"given":"Yang","family":"Cao","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,5,30]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"2020. Credit dataset. https:\/\/github.com\/DrIanGregory\/Kaggle-GiveMeSomeCredit."},{"key":"e_1_2_2_2_1","unstructured":"2022. Compas dataset. https:\/\/www.kaggle.com\/datasets\/danofer\/compass."},{"key":"e_1_2_2_3_1","unstructured":"2022. Kaggle. https:\/\/www.kaggle.com\/."},{"key":"e_1_2_2_4_1","unstructured":"2022. Loan dataset. https:\/\/www.kaggle.com\/datasets\/vikasukani\/loan-eligible-dataset."},{"key":"e_1_2_2_5_1","unstructured":"2022. UCI Machine Learning Repository. https:\/\/archive.ics.uci.edu\/ml\/index.php."},{"key":"e_1_2_2_6_1","unstructured":"2023. Amazon SageMaker. https:\/\/docs.aws.amazon.com\/sagemaker\/latest\/dg\/clarify-model-explainability.html."},{"key":"e_1_2_2_7_1","unstructured":"2023. Google cloud. https:\/\/cloud.google.com\/."},{"key":"e_1_2_2_8_1","unstructured":"2023. Microsoft Azure Machine Learning. https:\/\/azure.microsoft.com\/en-gb."},{"key":"e_1_2_2_9_1","unstructured":"2023. Upstart. https:\/\/www.upstart.com\/."},{"key":"e_1_2_2_10_1","unstructured":"2023. Zest AI. https:\/\/www.zest.ai\/."},{"key":"e_1_2_2_11_1","first-page":"1","article-title":"Improved Approximation and Scalability for Fair Max-Min Diversification","volume":"220","author":"Addanki Raghavendra","year":"2022","unstructured":"Raghavendra Addanki, Andrew McGregor, Alexandra Meliou, and Zafeiria Moumoulidou. 2022. Improved Approximation and Scalability for Fair Max-Min Diversification. In ICDT, Vol. 220. 7:1--7:21.","journal-title":"ICDT"},{"key":"e_1_2_2_12_1","volume-title":"Model extraction from counterfactual explanations. arXiv preprint arXiv:2009.01884","author":"A\u00efvodji Ulrich","year":"2020","unstructured":"Ulrich A\u00efvodji, Alexandre Bolot, and S\u00e9bastien Gambs. 2020. Model extraction from counterfactual explanations. arXiv preprint arXiv:2009.01884 (2020)."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0436-0"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3600211.3604676"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639263"},{"key":"e_1_2_2_16_1","volume-title":"Getting a clue: A method for explaining uncertainty estimates. arXiv preprint arXiv:2006.06848","author":"Antor\u00e1n Javier","year":"2020","unstructured":"Javier Antor\u00e1n, Umang Bhatt, Tameem Adel, Adrian Weller, and Jos\u00e9 Miguel Hern\u00e1ndez-Lobato. 2020. Getting a clue: A method for explaining uncertainty estimates. arXiv preprint arXiv:2006.06848 (2020)."},{"key":"e_1_2_2_17_1","volume-title":"Adrien Bennetot, Siham Tabik, Alberto Barbado, Salvador Garc\u00eda, Sergio Gil-L\u00f3pez, Daniel Molina, Richard Benjamins, et al.","author":"Arrieta Alejandro Barredo","year":"2020","unstructured":"Alejandro Barredo Arrieta, Natalia D\u00edaz-Rodr\u00edguez, Javier Del Ser, Adrien Bennetot, Siham Tabik, Alberto Barbado, Salvador Garc\u00eda, Sergio Gil-L\u00f3pez, Daniel Molina, Richard Benjamins, et al. 2020. Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI. Information fusion 58 (2020), 82--115."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.04.005"},{"key":"e_1_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Michael Barlow Christian Konrad and Charana Nandasena. 2021. Streaming Set Cover in Practice. In ALENEX. 181--192.","DOI":"10.1137\/1.9781611976472.14"},{"key":"e_1_2_2_20_1","volume-title":"Data privacy through optimal k-anonymization","author":"Bayardo Roberto J","unstructured":"Roberto J Bayardo and Rakesh Agrawal. 2005. Data privacy through optimal k-anonymization. In ICDE. IEEE, 217--228."},{"key":"e_1_2_2_21_1","unstructured":"Nicole Bidoit Melanie Herschel and Katerina Tzompanaki. 2016. Refining SQL Queries based on Why-Not Polynomials. In TAPP."},{"key":"e_1_2_2_22_1","volume-title":"Pattern recognition and machine learning","author":"Bishop C","year":"2006","unstructured":"C Bishop. 2006. Pattern recognition and machine learning. Springer google schola 2 (2006), 35--42."},{"key":"e_1_2_2_23_1","unstructured":"Rishi Bommasani Drew A. Hudson Ehsan Adeli Russ B. Altman Simran Arora Sydney von Arx Michael S. Bernstein Jeannette Bohg Antoine Bosselut Emma Brunskill Erik Brynjolfsson Shyamal Buch Dallas Card Rodrigo Castellon Niladri S. Chatterji Annie S. Chen Kathleen Creel Jared Quincy Davis Dorottya Demszky Chris Donahue Moussa Doumbouya Esin Durmus Stefano Ermon John Etchemendy Kawin Ethayarajh Li Fei-Fei Chelsea Finn Trevor Gale Lauren Gillespie Karan Goel Noah D. Goodman Shelby Grossman Neel Guha Tatsunori Hashimoto Peter Henderson John Hewitt Daniel E. Ho Jenny Hong Kyle Hsu Jing Huang Thomas Icard Saahil Jain Dan Jurafsky Pratyusha Kalluri Siddharth Karamcheti Geoff Keeling Fereshte Khani Omar Khattab Pang Wei Koh Mark S. Krass Ranjay Krishna Rohith Kuditipudi and et al. 2021. On the Opportunities and Risks of Foundation Models. CoRR abs\/2108.07258 (2021)."},{"key":"e_1_2_2_24_1","volume-title":"Hyun Chul Lee, and Yuli Ye","author":"Borodin Allan","year":"2012","unstructured":"Allan Borodin, Hyun Chul Lee, and Yuli Ye. 2012. Max-sum diversification, monotone submodular functions and dynamic updates. In SIGMOD. 155--166."},{"key":"e_1_2_2_25_1","first-page":"43","article-title":"Selecting representative data sets","volume":"12","author":"Borovicka Tomas","year":"2012","unstructured":"Tomas Borovicka, Marcel Jirina Jr, Pavel Kordik, and Marcel Jirina. 2012. Selecting representative data sets. In ICDM, Vol. 12. 43--70.","journal-title":"ICDM"},{"key":"e_1_2_2_26_1","volume-title":"Khaled AlAjmi, Jose Deodoro, Aquiles Farias, Ebru S Iskender, Mr Alin T Mirestean, and Rangachary Ravikumar.","author":"Boukherouaa El Bachir","year":"2021","unstructured":"El Bachir Boukherouaa, Mr Ghiath Shabsigh, Khaled AlAjmi, Jose Deodoro, Aquiles Farias, Ebru S Iskender, Mr Alin T Mirestean, and Rangachary Ravikumar. 2021. Powering the Digital Economy: Opportunities and Risks of Artificial Intelligence in Finance. International Monetary Fund."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1111\/1745-9133.12055"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0483-4"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904489"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415499"},{"key":"e_1_2_2_31_1","volume-title":"Nice: an algorithm for nearest instance counterfactual explanations. Data Mining and Knowledge Discovery","author":"Brughmans Dieter","year":"2023","unstructured":"Dieter Brughmans, Pieter Leyman, and David Martens. 2023. Nice: an algorithm for nearest instance counterfactual explanations. Data Mining and Knowledge Discovery (2023), 1--39."},{"key":"e_1_2_2_32_1","volume-title":"andWang Chiew Tan","author":"Buneman Peter","year":"2001","unstructured":"Peter Buneman, Sanjeev Khanna, andWang Chiew Tan. 2001. Why and Where: A Characterization of Data Provenance. In ICDT."},{"key":"e_1_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Peter Buneman and Wang Chiew Tan. 2007. Provenance in databases. In SIGMOD. ACM.","DOI":"10.1145\/1247480.1247646"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833649"},{"key":"e_1_2_2_35_1","unstructured":"Tianqi Chen Tong He Michael Benesty et al. 2015. Xgboost: extreme gradient boosting. R package version 0.4--2 1 4 (2015) 1--4."},{"key":"e_1_2_2_36_1","volume-title":"Extracting tree-structured representations of trained networks. Advances in neural information processing systems 8","author":"Craven Mark","year":"1995","unstructured":"Mark Craven and Jude Shavlik. 1995. Extracting tree-structured representations of trained networks. Advances in neural information processing systems 8 (1995)."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_31"},{"key":"e_1_2_2_38_1","volume-title":"Explanations based on the missing: Towards contrastive explanations with pertinent negatives. NeurIPS 31","author":"Dhurandhar Amit","year":"2018","unstructured":"Amit Dhurandhar, Pin-Yu Chen, Ronny Luss, Chun-Chen Tu, Paishun Ting, Karthikeyan Shanmugam, and Payel Das. 2018. Explanations based on the missing: Towards contrastive explanations with pertinent negatives. NeurIPS 31 (2018)."},{"key":"e_1_2_2_39_1","volume-title":"Machine learning in finance","author":"Dixon Matthew F","unstructured":"Matthew F Dixon, Igor Halperin, and Paul Bilokon. 2020. Machine learning in finance. Vol. 1170. Springer."},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3301275.3302310"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1791834.1791836"},{"key":"e_1_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Aaron Roth et al. 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science 9 3--4 (2014) 211--407.","DOI":"10.1561\/0400000042"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735467"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2957322"},{"key":"e_1_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Anna Fariha Suman Nath and Alexandra Meliou. 2020. Causality-guided adaptive interventional debugging. In SIGMOD. 431--446.","DOI":"10.1145\/3318464.3389694"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1015"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517864"},{"key":"e_1_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Sainyam Galhotra Amir Gilad Sudeepa Roy and Babak Salimi. 2022. HypeR: Hypothetical Reasoning With What-If and How-To Queries Using a Probabilistic Causal Approach. In SIGMOD.","DOI":"10.1145\/3514221.3526149"},{"key":"e_1_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Sainyam Galhotra Romila Pradhan and Babak Salimi. 2021. Explaining Black-Box Algorithms Using Probabilistic Contrastive Counterfactuals. In SIGMOD. ACM.","DOI":"10.1145\/3448016.3458455"},{"key":"e_1_2_2_50_1","volume-title":"Johnson","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680838817"},{"key":"e_1_2_2_52_1","unstructured":"Yash Goyal Ziyan Wu Jan Ernst Dhruv Batra Devi Parikh and Stefan Lee. 2019. Counterfactual visual explanations. In ICML. 2376--2384."},{"key":"e_1_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Todd J. Green Gregory Karvounarakis and Val Tannen. 2007. Provenance semirings. In PODS. ACM 31--40.","DOI":"10.1145\/1265530.1265535"},{"key":"e_1_2_2_54_1","volume-title":"Counterfactual explanations and how to find them: literature review and benchmarking. Data Mining and Knowledge Discovery","author":"Guidotti Riccardo","year":"2022","unstructured":"Riccardo Guidotti. 2022. Counterfactual explanations and how to find them: literature review and benchmarking. Data Mining and Knowledge Discovery (2022), 1--55."},{"key":"e_1_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Sariel Har-Peled Piotr Indyk Sepideh Mahabadi and Ali Vakilian. 2016. Towards tight bounds for the streaming set cover problem. In PODS. 371--383.","DOI":"10.1145\/2902251.2902287"},{"key":"e_1_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Johannes Haug Alexander Braun Stefan Z\u00fcrn and Gjergji Kasneci. 2022. Change Detection for Local Explainability in Evolving Data Streams. In CIKM. 706--716.","DOI":"10.1145\/3511808.3557257"},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2022.113910"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.2307\/2025977"},{"key":"e_1_2_2_59_1","doi-asserted-by":"crossref","unstructured":"Alexey Ignatiev Yacine Izza Peter J. Stuckey and Jo\u00e3o Marques-Silva. 2022. Using MaxSAT for Efficient Explanations of Tree Ensembles. In AAAI. 3776--3785.","DOI":"10.1609\/aaai.v36i4.20292"},{"key":"e_1_2_2_60_1","volume-title":"29th USENIX security symposium (USENIX Security 20). 1345--1362.","author":"Jagielski Matthew","unstructured":"Matthew Jagielski, Nicholas Carlini, David Berthelot, Alex Kurakin, and Nicolas Papernot. 2020. High accuracy and high fidelity extraction of neural networks. In 29th USENIX security symposium (USENIX Security 20). 1345--1362."},{"key":"e_1_2_2_61_1","volume-title":"Training deep models faster with robust, approximate importance sampling. NeurIPS 31","author":"Johnson Tyler B","year":"2018","unstructured":"Tyler B Johnson and Carlos Guestrin. 2018. Training deep models faster with robust, approximate importance sampling. NeurIPS 31 (2018)."},{"key":"e_1_2_2_62_1","volume-title":"Towards Realistic Individual Recourse and Actionable Explanations in Black-Box Decision Making Systems. CoRR","author":"Joshi Shalmali","year":"2019","unstructured":"Shalmali Joshi, Oluwasanmi Koyejo, Warut Vijitbenjaronk, Been Kim, and Joydeep Ghosh. 2019. Towards Realistic Individual Recourse and Actionable Explanations in Black-Box Decision Making Systems. CoRR (2019)."},{"key":"e_1_2_2_63_1","doi-asserted-by":"crossref","unstructured":"John Jumper Richard Evans Alexander Pritzel Tim Green Michael Figurnov Olaf Ronneberger Kathryn Tunyasuvunakool Russ Bates Augustin ?\u00eddek Anna Potapenko et al. 2021. Highly accurate protein structure prediction with AlphaFold. Nature 596 7873 (2021) 583--589.","DOI":"10.1038\/s41586-021-03819-2"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442188.3445899"},{"key":"e_1_2_2_65_1","volume-title":"Bernhard Sch\u00f6lkopf, and Isabel Valera.","author":"Karimi Amir-Hossein","year":"2020","unstructured":"Amir-Hossein Karimi, Julius Von K\u00fcgelgen, Bernhard Sch\u00f6lkopf, and Isabel Valera. 2020. Algorithmic recourse under imperfect causal knowledge: a probabilistic approach. Advances in neural information processing systems 33 (2020), 265--277."},{"key":"e_1_2_2_66_1","volume-title":"Giambattista Parascandolo, Moritz Hardt, Dominik Janzing, and Bernhard Sch\u00f6lkopf.","author":"Kilbertus Niki","year":"2017","unstructured":"Niki Kilbertus, Mateo Rojas Carulla, Giambattista Parascandolo, Moritz Hardt, Dominik Janzing, and Bernhard Sch\u00f6lkopf. 2017. Avoiding discrimination through causal reasoning. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_2_2_67_1","unstructured":"Ron Kohavi. 1996. Scaling Up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybrid. In SIGKDD. 202--207."},{"key":"e_1_2_2_68_1","volume-title":"Counterfactual Fairness. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017","author":"Kusner Matt J.","year":"2017","unstructured":"Matt J. Kusner, Joshua R. Loftus, Chris Russell, and Ricardo Silva. 2017. Counterfactual Fairness. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4--9, 2017, Long Beach, CA, USA. 4066--4076."},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103473"},{"key":"e_1_2_2_70_1","doi-asserted-by":"crossref","unstructured":"Thibault Laugel Marie-Jeanne Lesot Christophe Marsala Xavier Renard and Marcin Detyniecki. 2018. Comparisonbased inverse classification for interpretability in machine learning. In IPMU. 100--111.","DOI":"10.1007\/978-3-319-91473-2_9"},{"key":"e_1_2_2_71_1","doi-asserted-by":"crossref","unstructured":"Thai Le Suhang Wang and Dongwon Lee. 2020. Grace: generating concise and informative contrastive sample to explain neural network model's prediction. In SIGKDD. 238--248.","DOI":"10.1145\/3394486.3403066"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380760"},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389763"},{"key":"e_1_2_2_74_1","volume-title":"Lundberg and Su-In Lee","author":"Scott","year":"2017","unstructured":"Scott M. Lundberg and Su-In Lee. 2017. A Unified Approach to Interpreting Model Predictions. In NeurIPS. 4765--4774."},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.14778\/3641204.3641222"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-018-9878-x"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.14778\/1880172.1880176"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989376"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733070"},{"key":"e_1_2_2_80_1","first-page":"864","article-title":"Debating the Right to Explanation: An Autonomy-Based Analytical Framework","volume":"34","author":"Miao Michelle","year":"2022","unstructured":"Michelle Miao. 2022. Debating the Right to Explanation: An Autonomy-Based Analytical Framework. SAcLJ 34 (2022), 864.","journal-title":"SAcLJ"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300066"},{"key":"e_1_2_2_82_1","volume-title":"Explanation in artificial intelligence: Insights from the social sciences. Artificial intelligence 267","author":"Miller Tim","year":"2019","unstructured":"Tim Miller. 2019. Explanation in artificial intelligence: Insights from the social sciences. Artificial intelligence 267 (2019), 1--38."},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287560.3287562"},{"key":"e_1_2_2_84_1","unstructured":"Christoph Molnar. 2020. Interpretable machine learning. Lulu. com."},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372850"},{"key":"e_1_2_2_86_1","first-page":"1","article-title":"Diverse Data Selection under Fairness Constraints","volume":"186","author":"Moumoulidou Zafeiria","year":"2021","unstructured":"Zafeiria Moumoulidou, Andrew McGregor, and Alexandra Meliou. 2021. Diverse Data Selection under Fairness Constraints. In ICDT, Vol. 186. 13:1--13:25.","journal-title":"ICDT"},{"key":"e_1_2_2_87_1","unstructured":"Harsh Parikh Carlos Varjao Louise Xu and Eric Tchetgen Tchetgen. 2022. Validating causal inference methods. In ICML. 17346--17358."},{"key":"e_1_2_2_88_1","volume-title":"CARLA: A Python Library to Benchmark Algorithmic Recourse and Counterfactual Explanation Algorithms. In NeurIPS.","author":"Pawelczyk Martin","year":"2021","unstructured":"Martin Pawelczyk, Sascha Bielawski, Johannes van den Heuvel, Tobias Richter, and Gjergji Kasneci. 2021. CARLA: A Python Library to Benchmark Algorithmic Recourse and Counterfactual Explanation Algorithms. In NeurIPS."},{"key":"e_1_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380087"},{"key":"e_1_2_2_90_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 9680--9696","author":"Pawelczyk Martin","year":"2023","unstructured":"Martin Pawelczyk, Himabindu Lakkaraju, and Seth Neel. 2023. On the privacy risks of algorithmic recourse. In International Conference on Artificial Intelligence and Statistics. PMLR, 9680--9696."},{"key":"e_1_2_2_91_1","volume-title":"Cambridge, UK: CambridgeUniversityPress 19, 2","author":"Judea Pearl","year":"2000","unstructured":"Judea Pearl et al. 2000. Models, reasoning and inference. Cambridge, UK: CambridgeUniversityPress 19, 2 (2000), 3."},{"key":"e_1_2_2_92_1","volume-title":"Causal inference in statistics: A primer","author":"Pearl Judea","unstructured":"Judea Pearl, Madelyn Glymour, and Nicholas P Jewell. 2016. Causal inference in statistics: A primer. John Wiley & Sons."},{"key":"e_1_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375627.3375850"},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3522564"},{"key":"e_1_2_2_95_1","doi-asserted-by":"crossref","unstructured":"Romila Pradhan Jiongli Zhu Boris Glavic and Babak Salimi. 2022. Interpretable data-based explanations for fairness debugging. In SIGMOD. 247--261.","DOI":"10.1145\/3514221.3517886"},{"key":"e_1_2_2_96_1","doi-asserted-by":"crossref","unstructured":"Marco T\u00falio Ribeiro Sameer Singh and Carlos Guestrin. 2016. \"Why Should I Trust You?\": Explaining the Predictions of Any Classifier. In KDD. 1135--1144.","DOI":"10.1145\/2939672.2939778"},{"key":"e_1_2_2_97_1","volume-title":"Anchors: High-Precision Model-Agnostic Explanations. In AAAI. 1527--1535.","author":"Ribeiro Marco T\u00falio","year":"2018","unstructured":"Marco T\u00falio Ribeiro, Sameer Singh, and Carlos Guestrin. 2018. Anchors: High-Precision Model-Agnostic Explanations. In AAAI. 1527--1535."},{"key":"e_1_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856329"},{"key":"e_1_2_2_99_1","unstructured":"Sudeepa Roy and Babak Salimi. 2022. Causal Inference in Data Analysis with Applications to Fairness and Explanations. In Reasoning Web."},{"key":"e_1_2_2_100_1","doi-asserted-by":"crossref","unstructured":"Sudeepa Roy and Dan Suciu. 2014. A formal approach to finding explanations for database queries. In SIGMOD. 1579--1590.","DOI":"10.1145\/2588555.2588578"},{"key":"e_1_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375627.3375843"},{"key":"e_1_2_2_102_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236260"},{"key":"e_1_2_2_103_1","doi-asserted-by":"publisher","DOI":"10.1145\/3422648.3422657"},{"key":"e_1_2_2_104_1","volume-title":"conference on fairness, accountability and transparency. 48--48","author":"Selbst Andrew","year":"2018","unstructured":"Andrew Selbst and Julia Powles. 2018. ?Meaningful information\" and the right to explanation. In conference on fairness, accountability and transparency. 48--48."},{"key":"e_1_2_2_105_1","doi-asserted-by":"publisher","DOI":"10.1145\/3461702.3462533"},{"key":"e_1_2_2_106_1","unstructured":"Nina Spreitzer Hinda Haned and Ilse van der Linden. 2022. Evaluating the Practicality of Counterfactual Explanations. In NeurIPS."},{"key":"e_1_2_2_107_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.10.015"},{"key":"e_1_2_2_108_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745765"},{"key":"e_1_2_2_109_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00248"},{"key":"e_1_2_2_110_1","volume-title":"25th USENIX security symposium (USENIX Security 16). 601--618.","author":"Tram\u00e8r Florian","unstructured":"Florian Tram\u00e8r, Fan Zhang, Ari Juels, Michael K Reiter, and Thomas Ristenpart. 2016. Stealing machine learning models via prediction {APIs}. In 25th USENIX security symposium (USENIX Security 16). 601--618."},{"key":"e_1_2_2_111_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13283"},{"key":"e_1_2_2_112_1","volume-title":"Approximation algorithms","author":"Vazirani Vijay V","unstructured":"Vijay V Vazirani. 2001. Approximation algorithms. Vol. 1. Springer."},{"key":"e_1_2_2_113_1","volume-title":"Counterfactual explanations and algorithmic recourses for machine learning: A review. arXiv preprint arXiv:2010.10596","author":"Verma Sahil","year":"2020","unstructured":"Sahil Verma, Varich Boonsanong, Minh Hoang, Keegan E Hines, John P Dickerson, and Chirag Shah. 2020. Counterfactual explanations and algorithmic recourses for machine learning: A review. arXiv preprint arXiv:2010.10596 (2020)."},{"key":"e_1_2_2_114_1","first-page":"841","article-title":"Counterfactual explanations without opening the black box: Automated decisions and the GDPR","volume":"31","author":"Wachter Sandra","year":"2017","unstructured":"Sandra Wachter, Brent Mittelstadt, and Chris Russell. 2017. Counterfactual explanations without opening the black box: Automated decisions and the GDPR. Harv. JL & Tech. 31 (2017), 841.","journal-title":"Harv. JL & Tech."},{"key":"e_1_2_2_115_1","volume-title":"Proc. VLDB Endow.","author":"Wang Xiaolan","year":"2019","unstructured":"Xiaolan Wang and Alexandra Meliou. 2019. Explain3D: Explaining Disagreements in Disjoint Datasets. Proc. VLDB Endow. (2019)."},{"key":"e_1_2_2_116_1","doi-asserted-by":"crossref","unstructured":"Yongjie Wang Qinxu Ding Ke Wang Yue Liu Xingyu Wu Jinglong Wang Yong Liu and Chunyan Miao. 2021. The skyline of counterfactual explanations for machine learning decision models. In CIKM. 2030--2039.","DOI":"10.1145\/3459637.3482397"},{"key":"e_1_2_2_117_1","volume-title":"Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency. 1318--1329","author":"Qian Hangwei","year":"2022","unstructured":"YongjieWang, Hangwei Qian, and Chunyan Miao. 2022. Dualcf: Efficient model extraction attack from counterfactual explanations. In Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency. 1318--1329."},{"key":"e_1_2_2_118_1","volume-title":"Proceedings of the VLDB Endowment. International Conference on Very Large Data Bases","volume":"11","author":"Wen Yuhao","year":"2018","unstructured":"Yuhao Wen, Xiaodan Zhu, Sudeepa Roy, and Jun Yang. 2018. Interactive summarization and exploration of top aggregate query answers. In Proceedings of the VLDB Endowment. International Conference on Very Large Data Bases, Vol. 11. 2196."},{"key":"e_1_2_2_119_1","volume-title":"The what-if tool: Interactive probing of machine learning models","author":"Wexler James","year":"2019","unstructured":"James Wexler, Mahima Pushkarna, Tolga Bolukbasi, Martin Wattenberg, Fernanda Vi\u00e9gas, and Jimbo Wilson. 2019. The what-if tool: Interactive probing of machine learning models. IEEE transactions on visualization and computer graphics 26, 1 (2019), 56--65."},{"key":"e_1_2_2_120_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536356"},{"key":"e_1_2_2_121_1","volume-title":"Privacy risk in machine learning: Analyzing the connection to overfitting. In 2018 IEEE 31st computer security foundations symposium (CSF)","author":"Yeom Samuel","unstructured":"Samuel Yeom, Irene Giacomelli, Matt Fredrikson, and Somesh Jha. 2018. Privacy risk in machine learning: Analyzing the connection to overfitting. In 2018 IEEE 31st computer security foundations symposium (CSF). IEEE, 268--282."},{"key":"e_1_2_2_122_1","doi-asserted-by":"publisher","DOI":"10.14778\/3603581.3603602"},{"key":"e_1_2_2_123_1","volume-title":"Set coverage problems in a one-pass data stream","author":"Yu Huiwen","unstructured":"Huiwen Yu and Dayu Yuan. 2013. Set coverage problems in a one-pass data stream. In ICDM. SIAM, 758--766."}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654933","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3654933","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T14:36:55Z","timestamp":1755787015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,29]]},"references-count":123,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5,29]]}},"alternative-id":["10.1145\/3654933"],"URL":"https:\/\/doi.org\/10.1145\/3654933","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,29]]}}}