{"type":"ScholarlyArticle","title":"DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization","authors":[{"name":"Kentaro Kanamori","slug":"kentaro-kanamori","given":"Kentaro","family":"Kanamori","affiliation":"Hokkaido University"},{"name":"Takuya Takagi","slug":"takuya-takagi","given":"Takuya","family":"Takagi","affiliation":"Fujitsu Laboratories Ltd ."},{"name":"Ken Kobayashi","slug":"ken-kobayashi","given":"Ken","family":"Kobayashi","affiliation":"Fujitsu Laboratories Ltd .; Tokyo Institute of Technology"},{"name":"Hiroki Arimura","slug":"hiroki-arimura","given":"Hiroki","family":"Arimura","affiliation":"Hokkaido University"}],"abstract":"Counterfactual Explanation (CE) is one of the post-hoc explanation methods that provides a perturbation vector so as to alter the prediction result obtained from a classifier. Users can directly interpret the perturbation as an \"action\" for obtaining their desired decision results. However, an action extracted by existing methods often becomes unrealistic for users because they do not adequately care about the characteristics corresponding to the empirical data distribution such as feature-correlations and outlier risk. To suggest an executable action for users, we propose a new framework of CE for extracting an action by evaluating its reality on the empirical data distribution. The key idea of our proposed method is to define a new cost function based on the Mahalanobis' distance and the local outlier factor. Then, we propose a mixed-integer linear optimization approach to extracting an optimal action by minimizing our cost function. By experiments on real datasets, we confirm the effectiveness of our method in comparison with existing methods for CE.","doi":"10.24963/ijcai.2020/395","url":"https://ijcai.org/proceedings/2020/395","pdf":"https://ijcai.org/proceedings/2020/0395.pdf","markdown":"https://ijcai.org/proceedings/2020/395.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/395","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Machine Learning","track":"Main track","number":395,"pages":{"first":2855,"last":2862},"keywords":["Machine Learning: Explainable Machine Learning","Machine Learning: Classification","Machine Learning: Interpretability"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24638/file_24638.m3u8","length_sec":283,"provider":"hls"}],"references":[{"position":1,"raw":"[Ballet et al., 2019] Vincent Ballet, Xavier Renard, Jonathan Aigrain, Thibault Laugel, Pascal Frossard, and Marcin De- tyniecki. Imperceptible adversarial attacks on tabular data. In NeurIPS 2019 Workshop on Robust AI in Financial Ser- vices: Data, Fairness, Explainability, Trustworthiness and Privacy, 2019.","title":"Imperceptible adversarial attacks on tabular data","authors":"Vincent Ballet, Xavier Renard, Jonathan Aigrain, Thibault Laugel, Pascal Frossard, Marcin Detyniecki","year":"2019","venue":"NeurIPS 2019 Workshop on Robust AI in Financial Services: Data, Fairness, Explainability, Trustworthiness and Privacy","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Breiman, 2001] Leo Breiman. Random forests. Machine Learning, 45(1):5-32, 2001.","title":"Leo Breiman. Random forests","authors":"Breiman","year":"2001","venue":"Machine Learning","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Breunig et al., 2000] Markus M. Breunig, Hans-Peter Kriegel, Raymond T. Ng, and Jörg Sander. LOF: Iden- tifying density-based local outliers. SIGMOD Rec., 29(2):93-104, 2000.","title":"LOF: Identifying density-based local outliers","authors":"Markus M Breunig, Hans-Peter Kriegel, Raymond T Ng, Jörg Sander","year":"2000","venue":"SIGMOD Rec","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chen and Guestrin, 2016] Tianqi Chen and Carlos Guestrin. XGBoost: A scalable tree boosting system. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, page 785-794, 2016.","title":"XGBoost: A scalable tree boosting system","authors":"Tianqi Chen, Carlos Guestrin","year":"2016","venue":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cui et al., 2015] Zhicheng Cui, Wenlin Chen, Yujie He, and Yixin Chen. Optimal action extraction for random forests and boosted trees. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discov- ery and Data Mining, page 179-188, 2015.","title":"Optimal action extraction for random forests and boosted trees","authors":"Zhicheng Cui, Wenlin Chen, Yujie He, Yixin Chen","year":"2015","venue":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Dhurandhar et al., 2018] Amit Dhurandhar, Pin-Yu Chen, Ronny Luss, Chun-Chen Tu, Paishun Ting, Karthikeyan Shanmugam, and Payel Das. Explanations based on the missing: Towards contrastive explanations with pertinent negatives. In Proceedings of the 32nd International Con- ference on Neural Information Processing Systems, page 590-601, 2018.","title":"Explanations based on the missing: Towards contrastive explanations with pertinent negatives","authors":"Amit Dhurandhar, Pin-Yu Chen, Ronny Luss, Chun-Chen Tu, Paishun Ting, Karthikeyan Shanmugam, Payel Das","year":"2018","venue":"Proceedings of the 32nd International Conference on Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Dua and Graff, 2017] Dheeru Dua and Casey Graff. UCI machine learning repository, 2017.","title":"Dheeru Dua and Casey Graff. UCI machine learning repository","authors":"Graff Dua","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[FICO et al., 2018] FICO, Google, Imperial College Lon- don, MIT, University of Oxford, UC Irvine, and UC Berkeley. Explainable Machine Learning Challenge, 2018.","title":"Explainable Machine Learning Challenge","authors":"Fico","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Friedman, 2000] Jerome H. Friedman. Greedy function ap- proximation: A gradient boosting machine. Annals of Statistics, 29:1189-1232, 2000.","title":"Greedy function approximation: A gradient boosting machine","authors":"Jerome H Friedman","year":"2000","venue":"Annals of Statistics","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Ghorbani et al., 2019] Amirata Ghorbani, Abubakar Abid, and James Y. Zou. Interpretation of neural networks is fragile. In Proceedings of the Thirty-Third AAAI Confer- ence on Artificial Intelligence, pages 3681-3688, 2019.","title":"Interpretation of neural networks is fragile","authors":"Ghorbani","year":"2019","venue":"Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Guidotti et al., 2018] Riccardo Guidotti, Anna Monreale, Salvatore Ruggieri, Franco Turini, Fosca Giannotti, and Dino Pedreschi. A survey of methods for explaining black box models. ACM Comput. Surv., 51(5), 2018.","title":"A survey of methods for explaining black box models","authors":"Riccardo Guidotti, Anna Monreale, Salvatore Ruggieri, Franco Turini, Fosca Giannotti, Dino Pedreschi","year":"2018","venue":"ACM Comput. Surv","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hastie et al., 2009] Trevor Hastie, Robert Tibshirani, and Jerome H. Friedman. The Elements of Statistical Learn- ing: Data Mining, Inference, and Prediction, 2nd Edition. Springer Series in Statistics. Springer, 2009.","title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","authors":"Trevor Hastie, Robert Tibshirani, Jerome H Friedman","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[IBM, 2018] IBM. CPLEX Optimizer -IBM. https://www. ibm.com/analytics/cplex-optimizer, 2018.","title":"IBM. CPLEX Optimizer -IBM","authors":null,"year":"2018","venue":null,"doi":null,"url":"https://www.ibm.com/analytics/cplex-optimizer,2018","internal_url":null},{"position":14,"raw":"[Ke et al., 2017] Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. LightGBM: A highly efficient gradient boosting decision tree. In Proceedings of the 31st Interna- tional Conference on Neural Information Processing Sys- tems, page 3149-3157, 2017.","title":"LightGBM: A highly efficient gradient boosting decision tree","authors":"Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, Tie-Yan Liu","year":"2017","venue":"Proceedings of the 31st International Conference on Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Koh and Liang, 2017] Pang Wei Koh and Percy Liang. Un- derstanding black-box predictions via influence functions. In Proceedings of the 34th International Conference on Machine Learning -Volume 70, page 1885-1894, 2017.","title":"Understanding black-box predictions via influence functions","authors":"Pang Wei, Koh, Percy Liang","year":"2017","venue":"Proceedings of the 34th International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kulis, 2013] Brian Kulis. Metric learning: A survey. Foun- dations and Trends in Machine Learning, 5(4):287-364, 2013.","title":"Metric learning: A survey","authors":"Brian Kulis","year":"2013","venue":"Foundations and Trends in Machine Learning","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lash et al., 2017] Michael T. Lash, Qihang Lin, W. Nick Street, Jennifer G. Robinson, and Jeffrey W. Ohlmann. Generalized inverse classification. In Proceedings of the 2017 SIAM International Conference on Data Mining, pages 162-170, 2017.","title":"Generalized inverse classification","authors":"T Michael, Qihang Lash, W Nick Lin, Jennifer G Street, Jeffrey W Robinson, Ohlmann","year":"2017","venue":"Proceedings of the 2017 SIAM International Conference on Data Mining","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Laugel et al., 2019a] Thibault Laugel, Marie-Jeanne Lesot, Christophe Marsala, and Marcin Detyniecki. Issues with post-hoc counterfactual explanations: a discussion. In 2019 ICML Workshop on Human in the Loop Learning, 2019.","title":"Issues with post-hoc counterfactual explanations: a discussion","authors":"Laugel","year":"2019","venue":"ICML Workshop on Human in the Loop Learning","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Laugel et al., 2019b] Thibault Laugel, Marie-Jeanne Lesot, Christophe Marsala, Xavier Renard, and Marcin De- tyniecki. The dangers of post-hoc interpretability: Unjus- tified counterfactual explanations. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, pages 2801-2807, 2019.","title":"The dangers of post-hoc interpretability: Unjustified counterfactual explanations","authors":"Laugel","year":"2019","venue":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2019/388"},{"position":20,"raw":"[Lundberg and Lee, 2017] Scott M Lundberg and Su-In Lee. A unified approach to interpreting model predictions. In Proceedings of the 31st International Conference on Neu- ral Information Processing Systems, pages 4765-4774, 2017.","title":"A unified approach to interpreting model predictions","authors":"Lee ; Lundberg, M Scott, Su-In Lundberg, Lee","year":"2017","venue":"Proceedings of the 31st International Conference on Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Maesschalck et al., 2000] R. De Maesschalck, D. Jouan- Rimbaud, and D.L. Massart. The mahalanobis dis- tance. Chemometrics and Intelligent Laboratory Systems, 50(1):1 -18, 2000.","title":"The mahalanobis distance","authors":"R De Maesschalck, D Jouan-Rimbaud, D L Massart","year":"2000","venue":"Chemometrics and Intelligent Laboratory Systems","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Mahalanobis, 1936] Prasanta Chandra Mahalanobis. On the generalized distance in statistics. Proceedings of the Na- tional Institute of Sciences, 2:49-55, 1936.","title":"On the generalized distance in statistics","authors":"Prasanta Chandra, Mahalanobis","year":"1936","venue":"Proceedings of the National Institute of Sciences","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Molnar, 2019] Christoph Molnar. Interpretable Machine Learning -A Guide for Making Black Box Models Explain- able. https://christophm.github.io/interpretable-ml-book/, 2019.","title":"Interpretable Machine Learning -A Guide for Making Black Box Models Explainable","authors":"Christoph Molnar","year":"2019","venue":null,"doi":null,"url":"https://christophm.github.io/interpretable-ml-book/","internal_url":null},{"position":24,"raw":"[Moore et al., 2019] Jonathan Moore, Nils Hammerla, and Chris Watkins. Explaining deep learning models with con- strained adversarial examples. In Proceedings of the 16th Pacific Rim International Conference on Artificial Intelli- gence, pages 43-56, 2019.","title":"Explaining deep learning models with constrained adversarial examples","authors":"Jonathan Moore, Nils Hammerla, Chris Watkins","year":"2019","venue":"Proceedings of the 16th Pacific Rim International Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Ribeiro et al., 2016] Marco Túlio Ribeiro, Sameer Singh, and Carlos Guestrin. \"Why Should I Trust You?\": Ex- plaining the predictions of any classifier. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, page 1135-1144, 2016.","title":"Why Should I Trust You?\": Explaining the predictions of any classifier","authors":"Marco Túlio Ribeiro, Sameer Singh, Carlos Guestrin","year":"2016","venue":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Ribeiro et al., 2018] Marco Túlio Ribeiro, Sameer Singh, and Carlos Guestrin. Anchors: High-precision model- agnostic explanations. In Proceedings of the Thirty- Second AAAI Conference on Artificial Intelligence, pages 1527-1535, 2018.","title":"Anchors: High-precision modelagnostic explanations","authors":"Marco Túlio Ribeiro, Sameer Singh, Carlos Guestrin","year":"2018","venue":"Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Rudin, 2019] Cynthia Rudin. Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nature Machine Intelligence, 1:206-215, 2019.","title":"Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead","authors":"Cynthia Rudin","year":"2019","venue":"Nature Machine Intelligence","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Russell, 2019] Chris Russell. Efficient search for diverse coherent explanations. In Proceedings of the Confer- ence on Fairness, Accountability, and Transparency, page 20-28, 2019.","title":"Efficient search for diverse coherent explanations","authors":"Chris Russell","year":"2019","venue":"Proceedings of the Conference on Fairness, Accountability, and Transparency","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Szegedy et al., 2014] Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Er- han, Ian J. Goodfellow, and Rob Fergus. Intriguing properties of neural networks. In Proceedings of the 2nd International Conference on Learning Representations, 2014.","title":"Intriguing properties of neural networks","authors":"Szegedy","year":"2014","venue":"Proceedings of the 2nd International Conference on Learning Representations","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Ustun et al., 2019] Berk Ustun, Alexander Spangher, and Yang Liu. Actionable recourse in linear classification. In Proceedings of the Conference on Fairness, Accountabil- ity, and Transparency, page 10-19, 2019.","title":"Actionable recourse in linear classification","authors":"Berk Ustun, Alexander Spangher, Yang Liu","year":"2019","venue":"Proceedings of the Conference on Fairness, Accountability, and Transparency","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Wachter et al., 2018] Sandra Wachter, Brent Mittelstadt, and Chris Russell. Counterfactual explanations without opening the black box: Automated decisions and the gdpr. Harvard journal of law & technology, 31:841-887, 2018.","title":"Counterfactual explanations without opening the black box: Automated decisions and the gdpr","authors":"Sandra Wachter, Brent Mittelstadt, Chris Russell","year":"2018","venue":"Harvard journal of law & technology","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}