{"type":"ScholarlyArticle","title":"The Parameterized Complexity of Finding Concise Local Explanations","authors":[{"name":"Sebastian Ordyniak","slug":"sebastian-ordyniak","given":"Sebastian","family":"Ordyniak","affiliation":"University of Leeds , UK"},{"name":"Giacomo Paesani","slug":"giacomo-paesani","given":"Giacomo","family":"Paesani","affiliation":"University of Leeds , UK"},{"name":"Stefan Szeider","slug":"stefan-szeider","given":"Stefan","family":"Szeider","affiliation":"Algorithms and Complexity Group , TU Wien , Vienna , Austria"}],"abstract":"We consider the computational problem of finding a smallest local explanation (anchor) for classifying a given feature vector (example) by a black-box model.  After showing that the problem is NP-hard in general, we study various natural restrictions of the problem in terms of problem parameters to see whether these restrictions make the problem fixed-parameter tractable or not. We draw a detailed and systematic complexity landscape for combinations of parameters, including the size of the anchor, the size of the anchor's coverage, and parameters that capture structural aspects of the problem instance, including rank-width, twin-width, and maximum difference.","doi":"10.24963/ijcai.2023/369","url":"https://ijcai.org/proceedings/2023/369","pdf":"https://ijcai.org/proceedings/2023/0369.pdf","markdown":"https://ijcai.org/proceedings/2023/369.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/369","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":369,"pages":{"first":3312,"last":3320},"keywords":["Knowledge Representation and Reasoning: KRR: Computational complexity of reasoning","Machine Learning: ML: Explainable/Interpretable machine learning"],"videos":[],"references":[{"position":1,"raw":"[Angelino et al., 2017] Elaine Angelino, Nicholas Larus- Stone, Daniel Alabi, Margo I. Seltzer, and Cynthia Rudin. Learning certifiably optimal rule lists for categorical data. Journal of Machine Learning Research, 18(234):1-78, 2017.","title":"Learning certifiably optimal rule lists for categorical data","authors":"Elaine Angelino, Nicholas Larus-Stone, Daniel Alabi, Margo I Seltzer, Cynthia Rudin","year":"2017","venue":"Journal of Machine Learning Research","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Arnborg et al., 1991] Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2):308-340, 1991.","title":"Easy problems for tree-decomposable graphs","authors":"Stefan Arnborg, Jens Lagergren, Detlef Seese","year":"1991","venue":"Journal of Algorithms","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bang-Jensen and Gutin, 2009] Jørgen Bang-Jensen and Gregory Gutin. Digraphs. Springer Monographs in Mathematics. Springer-Verlag London Ltd., London, second edition, 2009.","title":"Digraphs. Springer Monographs in Mathematics","authors":"Bang-Jensen, Gutin","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Barceló et al., 2020] Pablo Barceló, Mikaël Monet, Jorge Pérez, and Bernardo Subercaseaux. Model interpretabil- ity through the lens of computational complexity. Proc. NeurIPS 2020, 2020.","title":"Model interpretability through the lens of computational complexity","authors":"Barceló","year":"2020","venue":"Proc. NeurIPS 2020","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bergougnoux et al., 2023] Benjamin Bergougnoux, Jan Dreier, and Lars Jaffke. A logic-based algorithmic meta- theorem for mim-width. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Flo- rence, Italy, January 22-25, 2023, pages 3282-3304.","title":"A logic-based algorithmic metatheorem for mim-width","authors":"Benjamin Bergougnoux, Jan Dreier, Lars Jaffke","year":"2023","venue":"Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bodlaender, 2007] Hans L. Bodlaender. Treewidth: Struc- ture and algorithms. Proc. SIROCCO 2007, 4474:11-25, 2007.","title":"Treewidth: Structure and algorithms","authors":"L Hans, Bodlaender","year":"2007","venue":"Proc. SIROCCO 2007","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bonnet et al., 2021a] Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant. Twin-width II: small classes. Proc. SODA 2021, pages 1977-1996, 2021.","title":"Twin-width II: small classes","authors":"Bonnet","year":"2021","venue":"Proc. SODA 2021","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bonnet et al., 2021b] Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant. Twin-width III: max independent set, min dominating set, and coloring. Proc. ICALP 2021, 198(35):1-20, 2021.","title":"Twin-width III: max independent set, min dominating set, and coloring","authors":"Bonnet","year":"2021","venue":"Proc. ICALP 2021","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bonnet et al., 2022a] Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, and Szymon Torunczyk. Twin-width IV: ordered graphs and matrices. Proc. STOC 2022, pages 924-937, 2022.","title":"Twin-width IV: ordered graphs and matrices","authors":"Bonnet","year":"2022","venue":"Proc. STOC 2022","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bonnet et al., 2022b] Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant. Twin-width I: tractable FO model checking. Journal of the ACM, 69(1):1-46, 2022.","title":"Twin-width I: tractable FO model checking","authors":"Bonnet","year":"2022","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bonnet et al., 2023] Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, and Stéphan Thomassé. Twin-width V: linear minors, modular counting, and matrix multiplication. Proc. STACS 2023, 254(15):1-16, 2023.","title":"Twin-width V: linear minors, modular counting, and matrix multiplication","authors":"Édouard Bonnet, Ugo Giocanti, Patrice Ossona De Mendez, Stéphan Thomassé","year":"2023","venue":"Proc. STACS 2023","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Cygan et al., 2015] Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parame- terized Algorithms. Springer, 2015.","title":"Parameterized Algorithms","authors":"Marek Cygan, V Fedor, Łukasz Fomin, Daniel Kowalik, Dániel Lokshtanov, Marcin Marx, Michał Pilipczuk, Saket Pilipczuk, Saurabh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Diestel, 2017] Reinhard Diestel. Graph Theory, volume 173 of Graduate Texts in Mathematics. Springer Verlag, New York, 5th edition, 2017.","title":"Graph Theory","authors":"Reinhard Diestel","year":"2017","venue":"Graduate Texts in Mathematics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Downey and Fellows, 2013] Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer Verlag, 2013.","title":"Fundamentals of Parameterized Complexity","authors":"Rodney G Downey, Michael R Fellows","year":"2013","venue":"Texts in Computer Science","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Ganian et al., 2018] Robert Ganian, Iyad Kanj, Sebastian Ordyniak, and Stefan Szeider. Parameterized algorithms for the matrix completion problem. Proc. ICML 2018, pages 1642-1651, 2018.","title":"Parameterized algorithms for the matrix completion problem","authors":"Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider","year":"2018","venue":"Proc. ICML 2018","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gurski and Wanke, 2005] Frank Gurski and Egon Wanke. Minimizing NLC-width is NP-complete. Graph-theoretic concepts in computer science, 3787:69-80, 2005.","title":"Minimizing NLC-width is NP-complete","authors":"Wanke Gurski, Frank Gurski, Egon Wanke","year":"2005","venue":"Graph-theoretic concepts in computer science","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hu et al., 2019] Xiyang Hu, Cynthia Rudin, and Margo Seltzer. Optimal sparse decision trees. Proc. NeurIPS 2019, pages 7265-7273, 2019.","title":"Optimal sparse decision trees","authors":"Xiyang Hu, Cynthia Rudin, Margo Seltzer","year":"2019","venue":"Proc. NeurIPS 2019","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Ignatiev et al., 2021] Alexey Ignatiev, João Marques-Silva, Nina Narodytska, and Peter J. Stuckey. Reasoning-based learning of interpretable ML models. Proc. IJCAI 2021, pages 4458-4465, 2021.","title":"Reasoning-based learning of interpretable ML models","authors":"Alexey Ignatiev, João Marques-Silva, Nina Narodytska, Peter J Stuckey","year":"2021","venue":"Proc. IJCAI 2021","doi":null,"url":null,"internal_url":"/proceedings/2021/608"},{"position":19,"raw":"[Kobourov et al., 2022] Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, and Jules Wulms. The influence of dimensions on the complexity of comput- ing decision trees. CoRR, 2022.","title":"The influence of dimensions on the complexity of computing decision trees","authors":"G Stephen, Maarten Kobourov, Fabrizio Löffler, Marcin Montecchiani, Ignaz Pilipczuk, Raimund Rutter, Manuel Seidel, Jules Sorge, Wulms","year":"2022","venue":"CoRR","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lewis, 1978] Harry R. Lewis. Renaming a set of clauses as a Horn set. Journal of the ACM, 25(1):134-135, January 1978.","title":"Renaming a set of clauses as a Horn set","authors":"R Harry, Lewis","year":"1978","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lundberg and Lee, 2017] Scott M. Lundberg and Su-In Lee. A unified approach to interpreting model predictions. Proc. NIPS 2017, pages 4765-4774, 2017.","title":"A unified approach to interpreting model predictions","authors":"M Scott, Su-In Lundberg, Lee","year":"2017","venue":"Proc. NIPS 2017","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Ordyniak and Szeider, 2021] Sebastian Ordyniak and Ste- fan Szeider. Parameterized complexity of small decision tree learning. Proc. AAAI 2021, pages 6454-6462, 2021.","title":"Parameterized complexity of small decision tree learning","authors":"Sebastian Ordyniak, Stefan Szeider","year":"2021","venue":"Proc. AAAI 2021","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Oum and Seymour, 2006] Sang-il Oum and Paul D. Sey- mour. Approximating clique-width and branch-width. Journal of Combinatorial Theory, 96(4):514-528, 2006.","title":"Sang-il Oum and Paul D. Seymour. Approximating clique-width and branch-width","authors":"Seymour Oum","year":"2006","venue":"Journal of Combinatorial Theory","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Oum, 2005] Sang-il Oum. Rank-width and vertex-minors. Journal of Combinatorial Theory, 95(1):79-100, 2005.","title":"Rank-width and vertex-minors","authors":"Sang-Il Oum","year":"2005","venue":"Journal of Combinatorial Theory","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?\": Explain- ing the predictions of any classifier. Proc. KDD 2016, pages 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":"Proc. KDD 2016","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. Proc. AAAI 2018, pages 1527- 1535, 2018.","title":"Anchors: High-precision modelagnostic explanations","authors":"Marco Túlio Ribeiro, Sameer Singh, Carlos Guestrin","year":"2018","venue":"Proc. AAAI 2018","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(5):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":"[Shrikumar et al., 2017] Avanti Shrikumar, Peyton Green- side, and Anshul Kundaje. Learning important features through propagating activation differences. Proc. ICML 2017, 70:3145-3153, 2017.","title":"Avanti Shrikumar, Peyton Greenside, and Anshul Kundaje. Learning important features through propagating activation differences","authors":"Shrikumar","year":"2017","venue":"Proc. ICML 2017","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Shrotri et al., 2022] Aditya A. Shrotri, Nina Narodytska, Alexey Ignatiev, Kuldeep S. Meel, João Marques-Silva, and Moshe Y. Vardi. Constraint-driven explanations for black-box ML models. Proc. AAAI 2022, pages 8304- 8314, 2022.","title":"Constraint-driven explanations for black-box ML models","authors":"Aditya A Shrotri, Nina Narodytska, Alexey Ignatiev, Kuldeep S Meel, João Marques-Silva, Moshe Y Vardi","year":"2022","venue":"Proc. AAAI 2022","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Simonov et al., 2019] Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, and Fahad Panolan. Refined complexity of PCA with outliers. Proc. ICML 2019, 97:5818-5826, 2019.","title":"Refined complexity of PCA with outliers","authors":"Kirill Simonov, V Fedor, Petr A Fomin, Fahad Golovach, Panolan","year":"2019","venue":"Proc. ICML 2019","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Wanke, 1994] Egon Wanke. k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics, 54(2):251- 266, 1994.","title":"k-NLC graphs and polynomial algorithms","authors":"Egon Wanke, Wanke","year":"1994","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}