{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T05:07:57Z","timestamp":1761541677163,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031440632"},{"type":"electronic","value":"9783031440649"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-44064-9_12","type":"book-chapter","created":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T04:19:19Z","timestamp":1698553159000},"page":"195-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SAC-FACT: Soft Actor-Critic Reinforcement Learning for\u00a0Counterfactual Explanations"],"prefix":"10.1007","author":[{"given":"Fatima","family":"Ezzeddine","sequence":"first","affiliation":[]},{"given":"Omran","family":"Ayoub","sequence":"additional","affiliation":[]},{"given":"Davide","family":"Andreoletti","sequence":"additional","affiliation":[]},{"given":"Silvia","family":"Giordano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,30]]},"reference":[{"issue":"6245","key":"12_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1126\/science.aaa8415","volume":"349","author":"MI Jordan","year":"2015","unstructured":"Jordan, M.I., Mitchell, T.M.: Machine learning: trends, perspectives, and prospects. Science 349(6245), 255\u2013260 (2015)","journal-title":"Science"},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/3236386.3241340","volume":"16","author":"ZC Lipton","year":"2018","unstructured":"Lipton, Z.C.: The mythos of model interpretability: in machine learning, the concept of interpretability is both important and slippery. Queue 16(3), 31\u201357 (2018)","journal-title":"Queue"},{"issue":"4","key":"12_CR3","volume":"9","author":"A Holzinger","year":"2019","unstructured":"Holzinger, A., Langs, G., Denk, H., Zatloukal, K., M\u00fcller, H.: Causability and explainability of artificial intelligence in medicine. Wiley Interdisc. Rev.: Data Min. Knowl. Disc. 9(4), e1312 (2019)","journal-title":"Wiley Interdisc. Rev.: Data Min. Knowl. Disc."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: Why should i trust you? explaining the predictions of any classifier. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1135\u20131144 (2016)","DOI":"10.1145\/2939672.2939778"},{"key":"12_CR5","unstructured":"Alvarez-Melis, D., Jaakkola, T.S.: On the robustness of interpretability methods. arXiv preprint arXiv:1806.08049 (2018)"},{"key":"12_CR6","unstructured":"Samek, W., Wiegand, T., M\u00fcller, K.-R.: Explainable artificial intelligence: Understanding, visualizing and interpreting deep learning models. arXiv preprint arXiv:1708.08296 (2017)"},{"key":"12_CR7","first-page":"841","volume":"31","author":"S Wachter","year":"2017","unstructured":"Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: automated decisions and the GDPR. Harv. JL Tech. 31, 841 (2017)","journal-title":"Harv. JL Tech."},{"issue":"12","key":"12_CR8","doi-asserted-by":"publisher","first-page":"3197","DOI":"10.1007\/s10115-022-01756-8","volume":"64","author":"X Li","year":"2022","unstructured":"Li, X., et al.: Interpretable deep learning: interpretation, interpretability, trustworthiness, and beyond. Knowl. Inf. Syst. 64(12), 3197\u20133234 (2022)","journal-title":"Knowl. Inf. Syst."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Do\u0161ilovi\u0107, F.K., Br\u010di\u0107, M., Hlupi\u0107, N.: Explainable artificial intelligence: a survey. In: 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), pp. 0210\u20130215. IEEE (2018)","DOI":"10.23919\/MIPRO.2018.8400040"},{"key":"12_CR10","unstructured":"H\u00f6ltgen, B., Schut, L., Brauner, J. M., Gal, Y.: Deduce: generating counterfactual explanations efficiently. arXiv preprint arXiv:2111.15639 (2021)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Mothilal, R.K., Sharma, A., Tan, C.: Explaining machine learning classifiers through diverse counterfactual explanations. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, pp. 607\u2013617 (2020)","DOI":"10.1145\/3351095.3372850"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Kanamori, K., Takagi, T., Kobayashi, K., Ike, Y., Uemura, K., Arimura, H.: Ordered counterfactual explanation by mixed-integer linear optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 13, pp. 11564\u201311574 (2021)","DOI":"10.1609\/aaai.v35i13.17376"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Sharma, S., Henderson, J., Ghosh, J.: Certifai: Counterfactual explanations for robustness, transparency, interpretability, and fairness of artificial intelligence models. arXiv preprint arXiv:1905.07857 (2019)","DOI":"10.1145\/3375627.3375812"},{"key":"12_CR14","unstructured":"Hashemi, M., Fathi, A.: Permuteattack: Counterfactual explanation of machine learning credit scorecards. arXiv preprint arXiv:2008.10138 (2020)"},{"key":"12_CR15","unstructured":"Chen, Z., Silvestri, F., Tolomei, G., Zhu, H., Wang, J., Ahn, H.: Relace: reinforcement learning agent for counterfactual explanations of arbitrary predictive models. arXiv preprint arXiv:2110.11960 (2021)"},{"key":"12_CR16","unstructured":"Samoilescu, R.-F., Van Looveren, A., Klaise, J.: Model-agnostic and scalable counterfactual explanations via reinforcement learning. arXiv preprint arXiv:2106.02597 (2021)"},{"key":"12_CR17","unstructured":"Verma, S., Boonsanong, V., Hoang, M., Hines, K.E., Dickerson, J.P., Shah, C.: Counterfactual explanations and algorithmic recourses for machine learning: A review. arXiv preprint arXiv:2010.10596 (2020)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"52138","DOI":"10.1109\/ACCESS.2018.2870052","volume":"6","author":"A Adadi","year":"2018","unstructured":"Adadi, A., Berrada, M.: Peeking inside the black-box: a survey on explainable artificial intelligence (XAI). IEEE Access 6, 52138\u201352160 (2018)","journal-title":"IEEE Access"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Guidotti, R.: Counterfactual explanations and how to find them: literature review and benchmarking. Data Min. Knowl. Disc., 1\u201355 (2022)","DOI":"10.1007\/s10618-022-00831-6"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"11974","DOI":"10.1109\/ACCESS.2021.3051315","volume":"9","author":"I Stepin","year":"2021","unstructured":"Stepin, I., Alonso, J.M., Catala, A., Pereira-Fari\u00f1a, M.: A survey of contrastive and counterfactual explanation generation methods for explainable artificial intelligence. IEEE Access 9, 11974\u201312001 (2021)","journal-title":"IEEE Access"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.inffus.2019.12.012","volume":"58","author":"AB Arrieta","year":"2020","unstructured":"Arrieta, A.B., et al.: Explainable artificial intelligence (XAI): concepts, taxonomies, opportunities and challenges toward responsible AI. Inf. Fusion 58, 82\u2013115 (2020)","journal-title":"Inf. Fusion"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Selvaraju, R.R., Cogswell, M., Das, A., Vedantam, R., Parikh, D., Batra, D.: Grad-cam: visual explanations from deep networks via gradient-based localization. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 618\u2013626 (2017)","DOI":"10.1109\/ICCV.2017.74"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Wang, P., Vasconcelos, N.: Scout: self-aware discriminant counterfactual explanations. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 8981\u20138990 (2020)","DOI":"10.1109\/CVPR42600.2020.00900"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Stepin, I., Alonso, J. M., Catala, A., Pereira-Fari\u00f1a, M.: Generation and evaluation of factual and counterfactual explanations for decision trees and fuzzy rule-based classifiers. In: 2020 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pp. 1\u20138. IEEE (2020)","DOI":"10.1109\/FUZZ48607.2020.9177629"},{"issue":"5","key":"12_CR25","first-page":"5313","volume":"36","author":"A Lucic","year":"2022","unstructured":"Lucic, A., Oosterhuis, H., Haned, H., de Rijke, M.: Focus: flexible optimizable counterfactual explanations for tree ensembles. Proc. AAAI Conf. Artif. Intell. 36(5), 5313\u20135322 (2022)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Ustun, B., Spangher, A., Liu, Y.: Actionable recourse in linear classification. In: Proceedings of the Conference on Fairness, Accountability, and Transparency, pp. 10\u201319 (2019)","DOI":"10.1145\/3287560.3287566"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Tolomei, G., Silvestri, F., Haines, A., Lalmas, M.: Interpretable predictions of tree-based ensembles via actionable feature tweaking. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 465\u2013474 (2017)","DOI":"10.1145\/3097983.3098039"},{"key":"12_CR28","unstructured":"Dhurandhar, A., et al.: Explanations based on the missing: towards contrastive explanations with pertinent negatives. In: Advances in Neural Information Processing Systems, vol. 31 (2018)"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-030-29908-8_4","volume-title":"PRICAI 2019: Trends in Artificial Intelligence","author":"J Moore","year":"2019","unstructured":"Moore, J., Hammerla, N., Watkins, C.: Explaining deep learning models with constrained adversarial examples. In: Nayak, A.C., Sharma, A. (eds.) PRICAI 2019. LNCS (LNAI), vol. 11670, pp. 43\u201356. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29908-8_4"},{"key":"12_CR30","unstructured":"Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572 (2014)"},{"issue":"1","key":"12_CR31","doi-asserted-by":"publisher","first-page":"73","DOI":"10.25300\/MISQ\/2014\/38.1.04","volume":"38","author":"D Martens","year":"2014","unstructured":"Martens, D., Provost, F.: Explaining data-driven document classifications. MIS Q. 38(1), 73\u2013100 (2014)","journal-title":"MIS Q."},{"key":"12_CR32","unstructured":"Numeroso, D., Bacciu, D.: Explaining deep graph networks with molecular counterfactuals. arXiv preprint arXiv:2011.05134 (2020)"},{"key":"12_CR33","unstructured":"Nguyen, T.M., Quinn, T.P., Nguyen, T., Tran, T.: Counterfactual explanation with multi-agent reinforcement learning for drug target prediction. arXiv preprint arXiv:2103.12983 (2021)"},{"key":"12_CR34","unstructured":"Li, J., Monroe, W., Jurafsky, D.: Understanding neural networks through representation erasure. arXiv preprint arXiv:1612.08220 (2016)"},{"key":"12_CR35","volume-title":"Introduction to Reinforcement Learning","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G., et al.: Introduction to Reinforcement Learning, vol. 135. MIT press, Cambridge (1998)"},{"key":"12_CR36","unstructured":"Konda, V., Tsitsiklis, J.: Actor-critic algorithms. In: Advances in Neural Information Processing Systems, vol. 12 (1999)"},{"issue":"4","key":"12_CR37","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1137\/S0363012901385691","volume":"42","author":"VR Konda","year":"2003","unstructured":"Konda, V.R., Tsitsiklis, J.N.: Onactor-critic algorithms. SIAM J. Control. Optim. 42(4), 1143\u20131166 (2003)","journal-title":"SIAM J. Control. Optim."},{"key":"12_CR38","unstructured":"Lillicrap, T.P., et al.: Continuous control with deep reinforcement learning. arXiv preprint arXiv:1509.02971 (2015)"},{"key":"12_CR39","unstructured":"Sutton, R.S., McAllester, D., Singh, S., Mansour, Y.: Policy gradient methods for reinforcement learning with function approximation. In: Advances in Neural Information Processing Systems, vol. 12 (1999)"},{"key":"12_CR40","unstructured":"Haarnoja, T., Zhou, A., Abbeel, P., Levine, S.: Soft actor-critic: off-policy maximum entropy deep reinforcement learning with a stochastic actor. In: International Conference on Machine Learning, pp. 1861\u20131870. PMLR (2018)"},{"key":"12_CR41","unstructured":"Li, Y.: Deep reinforcement learning: An overview. arXiv preprint arXiv:1701.07274 (2017)"},{"key":"12_CR42","doi-asserted-by":"crossref","unstructured":"Liu, F.T., Ting, K.M., Zhou, Z.-H.: Isolation forest. In: 2008 Eighth IEEE International Conference on Data Mining, pp. 413\u2013422. IEEE (2008)","DOI":"10.1109\/ICDM.2008.17"},{"key":"12_CR43","unstructured":"Diabetes dataset. https:\/\/www.openml.org\/d\/37. Accessed 25 Apr 2023"},{"key":"12_CR44","unstructured":"Breast cancer dataset. https:\/\/archive.ics.uci.edu\/ml\/datasets\/Breast+Cancer+Coimbra. Accessed 25 Apr 2023"},{"key":"12_CR45","unstructured":"Climate dataset. https:\/\/archive.ics.uci.edu\/ml\/datasets\/Climate+Model+Simulation+Crashes. Accessed 25 Apr 2023"},{"key":"12_CR46","unstructured":"Biodeg dataset. https:\/\/openml.org\/d\/1494. Accessed 25 Apr 2023"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat., 1189\u20131232 (2001)","DOI":"10.1214\/aos\/1013203451"},{"key":"12_CR48","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: Xgboost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 785\u2013794 (2016)","DOI":"10.1145\/2939672.2939785"}],"container-title":["Communications in Computer and Information Science","Explainable Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44064-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T04:21:08Z","timestamp":1698553268000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44064-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031440632","9783031440649"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44064-9_12","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"xAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Conference on Explainable Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"xai2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/xaiworldconference.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"220","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}