{"type":"ScholarlyArticle","title":"On Translations between ML Models for XAI Purposes","authors":[{"name":"Alexis de Colnet","slug":"alexis-de-colnet","given":"Alexis","family":"de Colnet","affiliation":"Algorithms and Complexity Group , TU Wien , Vienna , Austria"},{"name":"Pierre Marquis","slug":"pierre-marquis","given":"Pierre","family":"Marquis","affiliation":"Univ. Artois , CNRS , Centre de Recherche en Informatique de Lens (CRIL) , F-62300 Lens , France; Institut Universitaire de France"}],"abstract":"In this paper, the succinctness of various ML models is studied. To be more precise, the existence of polynomial-time and polynomial-space translations between representation languages for classifiers is investigated. The languages that are considered include decision trees, random forests, several types of boosted trees, binary neural networks, Boolean multilayer perceptrons, and various logical representations of  binary classifiers. We provide a complete map indicating for every pair of languages C, C' whether or not a polynomial-time / polynomial-space translation exists from C to C'. We also explain how to take advantage of the resulting map for XAI purposes.","doi":"10.24963/ijcai.2023/352","url":"https://ijcai.org/proceedings/2023/352","pdf":"https://ijcai.org/proceedings/2023/0352.pdf","markdown":"https://ijcai.org/proceedings/2023/352.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/352","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":352,"pages":{"first":3158,"last":3166},"keywords":["Knowledge Representation and Reasoning: KRR: Knowledge representation languages","Knowledge Representation and Reasoning: KRR: Knowledge compilation"],"videos":[],"references":[{"position":1,"raw":"[Adadi and Berrada, 2018] A. Adadi and M. Berrada. Peek- ing Inside the Black-Box: A Survey on Explainable Ar- tificial Intelligence (XAI). IEEE Access, 6:52138-52160, 2018.","title":"Peeking Inside the Black-Box: A Survey on Explainable Artificial Intelligence (XAI)","authors":"A Adadi, M Berrada","year":"2018","venue":"IEEE Access","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Anthony, 2001] M. Anthony. Discrete Mathematics of Neu- ral Networks: Selected Topics. SIAM Monographs on Dis- crete Mathematics and Applications, 2001.","title":"Discrete Mathematics of Neural Networks: Selected Topics","authors":"M Anthony","year":"2001","venue":"SIAM Monographs on Discrete Mathematics and Applications","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Arrieta et al., 2020] A. Barredo Arrieta, N. Díaz R., J. Del Ser, A. Bennetot, S. Tabik, A. Barbado, S. García, S. Gil- Lopez, D. Molina, R. Benjamins, R. Chatila, and F. Her- rera. Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward respon- sible AI. Inf. Fusion, 58:82-115, 2020.","title":"Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI","authors":"A Barredo Arrieta, N Díaz, R, J Del, A Ser, S Bennetot, A Tabik, S Barbado, S García, D Gil-Lopez, R Molina, R Benjamins, F Chatila","year":"2020","venue":"Inf. Fusion","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Audemard et al., 2020] Gilles Audemard, Frédéric Koriche, and Pierre Marquis. On Tractable XAI Queries based on Compiled Representations. In Proc. of KR'20, pages 838- 849, 2020.","title":"On Tractable XAI Queries based on Compiled Representations","authors":"Gilles Audemard, Frédéric Koriche, Pierre Marquis","year":"2020","venue":"Proc. of KR'20","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Audemard et al., 2021] Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, and Pierre Marquis. On the Computational Intelligibility of Boolean Classifiers. In Proc. of KR'21, pages 74-86, 2021.","title":"On the Computational Intelligibility of Boolean Classifiers","authors":"Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis","year":"2021","venue":"Proc. of KR'21","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Audemard et al., 2022] Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, and Pierre Marquis. Trading Complexity for Sparsity in Random Forest Explanations. In Proc. of AAAI'22, pages 5461-5469. AAAI Press, 2022.","title":"Trading Complexity for Sparsity in Random Forest Explanations","authors":"Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis","year":"2022","venue":"Proc. of AAAI'22","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Barceló et al., 2020] P. Barceló, M. Monet, J. Pérez, and B. Subercaseaux. Model Interpretability through the lens of Computational Complexity. In Proc. of NeurIPS'20, 2020.","title":"Model Interpretability through the lens of Computational Complexity","authors":"P Barceló, M Monet, J Pérez, B Subercaseaux","year":"2020","venue":"Proc. of NeurIPS'20","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bova et al., 2014] Simone Bova, Florent Capelli, Stefan Mengel, and Friedrich Slivovsky. Expander CNFs have Exponential DNNF Size. CoRR, abs/1411.1995, 2014.","title":"Expander CNFs have Exponential DNNF Size","authors":"Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bova et al., 2016] Simone Bova, Florent Capelli, Stefan Mengel, and Friedrich Slivovsky. Knowledge Compilation Meets Communication Complexity. In Proc. of IJCAI'16, pages 1008-1014, 2016.","title":"Knowledge Compilation Meets Communication Complexity","authors":"Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky","year":"2016","venue":"Proc. of IJCAI'16","doi":null,"url":null,"internal_url":"/proceedings/2016/147"},{"position":10,"raw":"[Breiman et al., 1984] L. Breiman, J. H. Friedman, R. A. Ol- shen, and C. J. Stone. Classification and Regression Trees. Wadsworth, 1984.","title":"Classification and Regression Trees","authors":"L Breiman, J H Friedman, R A Olshen, C J Stone","year":"1984","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Breiman, 2001] L. Breiman. Random Forests. Machine Learning, 45(1):5-32, 2001.","title":"Random Forests","authors":"L Breiman","year":"2001","venue":"Machine Learning","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bryant, 1986] Randal E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-692, 1986.","title":"Graph-based algorithms for Boolean function manipulation","authors":"Randal E Bryant","year":"1986","venue":"IEEE Transactions on Computers, C","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Caruana et al., 2020] R. Caruana, S. M. Lundberg, M. Túlio Ribeiro, H. Nori, and S. Jenkins. Intelligible and Explain- able Machine Learning: Best Practices and Practical Chal- lenges. In Proc. of KDD'20, pages 3511-3512. ACM, 2020.","title":"Intelligible and Explainable Machine Learning: Best Practices and Practical Challenges","authors":"R Caruana, S M Lundberg, M Túlio Ribeiro, H Nori, S Jenkins","year":"2020","venue":"Proc. of KDD'20","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Chen and Guestrin, 2016] T. Chen and C. Guestrin. XG- Boost: A Scalable Tree Boosting System. In Proc. of KDD'16, page 785-794, 2016.","title":"XG-Boost: A Scalable Tree Boosting System","authors":"T Chen, C Guestrin","year":"2016","venue":"Proc. of KDD'16","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Darwiche and Hirth, 2020] A. Darwiche and A. Hirth. On the Reasons Behind Decisions. In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI'20), pages 712-720, 2020.","title":"On the Reasons Behind Decisions","authors":"Hirth Darwiche, A Darwiche, A Hirth","year":"2020","venue":"Proceedings of the 24th European Conference on Artificial Intelligence (ECAI'20)","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Darwiche and Ji, 2022] Adnan Darwiche and Chunxi Ji. On the Computation of Necessary and Sufficient Explana- tions. In Proc. of AAAI'22, pages 5582-5591, 2022.","title":"On the Computation of Necessary and Sufficient Explanations","authors":"Ji ; Darwiche, Adnan Darwiche, Chunxi Ji","year":"2022","venue":"Proc. of AAAI'22","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Darwiche and Marquis, 2002] Adnan Darwiche and Pierre Marquis. A Knowledge Compilation Map. J. Artif. Intell. Res., 17:229-264, 2002.","title":"A Knowledge Compilation Map","authors":"Adnan Darwiche, Pierre Marquis","year":"2002","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Darwiche and Marquis, 2021] Adnan Darwiche and Pierre Marquis. On Quantifying Literals in Boolean Logic and its Applications to Explainable AI. J. Artif. Intell. Res., 72:285-328, 2021.","title":"On Quantifying Literals in Boolean Logic and its Applications to Explainable AI","authors":"Adnan Darwiche, Pierre Marquis","year":"2021","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Darwiche, 2001] Adnan Darwiche. Decomposable negation normal form. Journal of the Association for Computing Machinery, 48(4):608-647, 2001.","title":"Decomposable negation normal form","authors":"Adnan Darwiche","year":"2001","venue":"Journal of the Association for Computing Machinery","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Darwiche, 2011] A. Darwiche. SDD: A New Canonical Representation of Propositional Knowledge Bases. In Proc. of IJCAI'11, pages 819-826, 2011.","title":"SDD: A New Canonical Representation of Propositional Knowledge Bases","authors":"A Darwiche","year":"2011","venue":"Proc. of IJCAI'11","doi":null,"url":null,"internal_url":"/proceedings/2011/143"},{"position":21,"raw":"[de Colnet and Marquis, 2022] Alexis de Colnet and Pierre Marquis. On the Complexity of Enumerating Prime Impli- cants from Decision-DNNF Circuits. In Proc. of IJCAI'22, pages 2583-2590, 2022.","title":"Alexis de Colnet and Pierre Marquis. On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits","authors":"Colnet De, Marquis","year":"2022","venue":"Proc. of IJCAI'22","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Du et al., 2020] Mengnan Du, Ninghao Liu, and Xia Hu. Techniques for interpretable machine learning. Commun. ACM, 63(1):68-77, 2020.","title":"Techniques for interpretable machine learning","authors":"Du","year":"2020","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Freund and Schapire, 1997] Y. Freund and R.E. Schapire. A Decision-Theoretic Generalization of On-Line Learn- ing and an Application to Boosting. J. Comput. Syst. Sci., 55(1):119-139, 1997.","title":"A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting","authors":"Y Freund, R E Schapire","year":"1997","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Goldmann et al., 1992] Mikael Goldmann, Johan Håstad, and Alexander A. Razborov. Majority Gates VS. General Weighted Threshold Gates. Comput. Complex., 2:277- 300, 1992.","title":"Majority Gates VS. General Weighted Threshold Gates","authors":"Mikael Goldmann, Johan Håstad, Alexander A Razborov","year":"1992","venue":"Comput. Complex","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Goldmann, 1997] Mikael Goldmann. On the Power of a Threshold Gate at the Top. Inf. Process. Lett., 63(6):287- 293, 1997.","title":"On the Power of a Threshold Gate at the Top","authors":"Mikael Goldmann","year":"1997","venue":"Inf. Process. Lett","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Goodman and Flaxman, 2017] Bryce Goodman and Seth Flaxman. European union regulations on algorithmic decision-making and a \"right to explanation\". AI Maga- zine, 38(3):50-57, Oct. 2017.","title":"European union regulations on algorithmic decision-making and a \"right to explanation","authors":"Flaxman Goodman, Bryce Goodman, Seth Flaxman","year":"2017","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Guidotti et al., 2019] R. Guidotti, A. Monreale, S. Ruggieri, F. Turini, F. Giannotti, and D. Pedreschi. A Survey of Methods for Explaining Black Box Models. ACM Com- puting Surveys, 51(5):93:1-93:42, 2019.","title":"A Survey of Methods for Explaining Black Box Models","authors":"R Guidotti, A Monreale, S Ruggieri, F Turini, F Giannotti, D Pedreschi","year":"2019","venue":"ACM Computing Surveys","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Guidotti, 2022] R. Guidotti. Counterfactual explanations and how to find them: literature review and benchmark- ing. Data Mining and Knowledge Discovery, 2022.","title":"Counterfactual explanations and how to find them: literature review and benchmarking","authors":"R Guidotti","year":"2022","venue":"Data Mining and Knowledge Discovery","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Gunning, 2019] D. Gunning. DARPA's explainable artifi- cial intelligence (XAI) program. In Proc. of IUI'19, 2019.","title":"DARPA's explainable artificial intelligence (XAI) program","authors":"D Gunning","year":"2019","venue":"Proc. of IUI'19","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Håstad et al., 1995] Johan Håstad, Stasys Jukna, and Pavel Pudlák. Top-Down Lower Bounds for Depth-Three Cir- cuits. Comput. Complex., 5(2):99-112, 1995.","title":"Pavel Pudlák. Top-Down Lower Bounds for Depth-Three Circuits","authors":"Håstad","year":"1995","venue":"Comput. Complex","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Huang and Darwiche, 2005] Jinbo Huang and Adnan Dar- wiche. DPLL with a Trace: From SAT to Knowledge Compilation. In Proc. of IJCAI'05, pages 156-162, 2005.","title":"DPLL with a Trace: From SAT to Knowledge Compilation","authors":"Darwiche Huang","year":"2005","venue":"Proc. of IJCAI'05","doi":null,"url":null,"internal_url":"/proceedings/2005/98"},{"position":32,"raw":"[Huang et al., 2022] Xuanxiang Huang, Yacine Izza, Alexey Ignatiev, Martin C. Cooper, Nicholas Asher, and João Marques-Silva. Tractable Explanations for d-DNNF Clas- sifiers. In Proc. of AAAI'22, pages 5719-5728, 2022.","title":"Tractable Explanations for d-DNNF Classifiers","authors":"Huang","year":"2022","venue":"Proc. of AAAI'22","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Hubara et al., 2016] Itay Hubara, Matthieu Courbariaux, Daniel Soudry, Ran El-Yaniv, and Yoshua Bengio. Bina- rized Neural Networks. In Advances in Neural Information Processing Systems 29 (NeurIPS'16), pages 4107-4115, 2016.","title":"Binarized Neural Networks","authors":"Itay Hubara, Matthieu Courbariaux, Daniel Soudry, Ran El-Yaniv, Yoshua Bengio","year":"2016","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Ignatiev et al., 2019] A. Ignatiev, N. Narodytska, and J. Marques-Silva. On Validating, Repairing and Refining Heuristic ML Explanations. CoRR, abs/1907.02509, 2019.","title":"On Validating, Repairing and Refining Heuristic ML Explanations","authors":"A Ignatiev, N Narodytska, J Marques-Silva","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Ignatiev, 2020] A. Ignatiev. Towards Trustable Explainable AI. In Proc. of IJCAI'20, pages 5154-5158, 2020.","title":"Towards Trustable Explainable AI","authors":"A Ignatiev","year":"2020","venue":"Proc. of IJCAI'20","doi":null,"url":null,"internal_url":"/proceedings/2020/726"},{"position":36,"raw":"[Jukna, 2014] Stasys Jukna. Boolean Function Complexity Advances and Frontiers. Bull. EATCS, 113, 2014.","title":"Stasys Jukna. Boolean Function Complexity Advances and Frontiers","authors":"Jukna","year":"2014","venue":"Bull. EATCS","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Ke et al., 2017] G. Ke, Q. Meng, Th. Finley, T. Wang, W. Chen, W. Ma, Q. Ye, and T. Liu. LightGBM: A Highly Efficient Gradient Boosting Decision Tree. In Proc. of NeurIPS'17, pages 3146-3154, 2017.","title":"LightGBM: A Highly Efficient Gradient Boosting Decision Tree","authors":"G Ke, Q Meng, Th, T Finley, W Wang, W Chen, Q Ma, T Ye, Liu","year":"2017","venue":"Proc. of NeurIPS'17","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Lundberg and Lee, 2017] S. Lundberg and S-I. Lee. A Uni- fied Approach to Interpreting Model Predictions. In Proc. of NIPS'17, pages 4765-4774, 2017.","title":"A Unified Approach to Interpreting Model Predictions","authors":"S Lundberg, S-I Lee","year":"2017","venue":"Proc. of NIPS'17","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Lundberg et al., 2020] S. M. Lundberg, G. G. Erion, H. Chen, A. J. DeGrave, J. M. Prutkin, B. Nair, R. Katz, J. Himmelfarb, N. Bansal, and S. Lee. From local explana- tions to global understanding with explainable AI for trees. Nat. Mach. Intell., 2(1):56-67, 2020.","title":"From local explanations to global understanding with explainable AI for trees","authors":"S M Lundberg, G G Erion, H Chen, A J Degrave, J M Prutkin, B Nair, R Katz, J Himmelfarb, N Bansal, S Lee","year":"2020","venue":"Nat. Mach. Intell","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Marques-Silva and Ignatiev, 2022] J. Marques-Silva and A. Ignatiev. Delivering Trustworthy AI through Formal XAI. In Proc. of AAAI'22, pages 12342-12350, 2022.","title":"Delivering Trustworthy AI through Formal XAI","authors":"Marques-Silva Ignatiev, ; ] J Marques-Silva, A Ignatiev","year":"2022","venue":"Proc. of AAAI'22","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Marques-Silva, 2022] João Marques-Silva. Logic- Based Explainability in Machine Learning. CoRR, abs/2211.00541, 2022.","title":"Logic-Based Explainability in Machine Learning","authors":"João Marques-Silva","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Miller, 2019] Tim Miller. Explanation in artificial intelli- gence: Insights from the social sciences. Artificial Intelli- gence, 267:1-38, 2019.","title":"Explanation in artificial intelligence: Insights from the social sciences","authors":"Tim Miller, Miller","year":"2019","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Molnar, 2019] Christoph Molnar. Interpretable Machine Learning -A Guide for Making Black Box Models Explain- able. Leanpub, 2019.","title":"Interpretable Machine Learning -A Guide for Making Black Box Models Explainable","authors":"Christoph Molnar, Molnar","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Narodytska et al., 2018] Nina Narodytska, Shiva Prasad Kasiviswanathan, Leonid Ryzhyk, Mooly Sagiv, and Toby Walsh. Verifying Properties of Binarized Deep Neural Networks. In Proc. of AAAI'18, pages 6615-6624, 2018.","title":"Verifying Properties of Binarized Deep Neural Networks","authors":"Nina Narodytska, Shiva Prasad Kasiviswanathan, Leonid Ryzhyk, Mooly Sagiv, Toby Walsh","year":"2018","venue":"Proc. of AAAI'18","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[O'Donnell, 2014] Ryan O'Donnell. Analysis of Boolean Functions. Cambridge University Press, 2014.","title":"Analysis of Boolean Functions","authors":"O' Ryan, Donnell","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Parmentier and Vidal, 2021] A. Parmentier and T. Vidal. Optimal Counterfactual Explanations in Tree Ensembles. In Proc. of ICML'21, volume 139 of Proceedings of Ma- chine Learning Research, pages 8422-8431, 2021.","title":"Optimal Counterfactual Explanations in Tree Ensembles","authors":"A Parmentier, T Vidal","year":"2021","venue":"Proceedings of Machine Learning Research","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Prokhorenkova et al., 2018] L. O. Prokhorenkova, G. Gu- sev, A. Vorobev, A. V. Dorogush, and A. Gulin. CatBoost: unbiased boosting with categorical features. In Proc. of NeurIPS'18, pages 6639-6649, 2018.","title":"CatBoost: unbiased boosting with categorical features","authors":"L O Prokhorenkova, G Gusev, A Vorobev, A V Dorogush, A Gulin","year":"2018","venue":"Proc. of NeurIPS'18","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Quinlan, 1986] J. R. Quinlan. Induction of Decision Trees. Machine Learning, 1(1):81-106, 1986.","title":"Induction of Decision Trees","authors":"J R Quinlan","year":"1986","venue":"Machine Learning","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Ribeiro et al., 2016] M. T. Ribeiro, S. Singh, and C. Guestrin. \"Why Should I Trust You?\": Explain- ing the Predictions of Any Classifier. In Proc. of KDD'16, pages 1135-1144, 2016.","title":"Why Should I Trust You?\": Explaining the Predictions of Any Classifier","authors":"M T Ribeiro, S Singh, C Guestrin","year":"2016","venue":"Proc. of KDD'16","doi":null,"url":null,"internal_url":null},{"position":50,"raw":"[Ribeiro et al., 2018] M. T. Ribeiro, S. Singh, and C. Guestrin. Anchors: High-Precision Model-Agnostic Explanations. In Proc. of AAAI'18, pages 1527-1535, 2018.","title":"Anchors: High-Precision Model-Agnostic Explanations","authors":"M T Ribeiro, S Singh, C Guestrin","year":"2018","venue":"Proc. of AAAI'18","doi":null,"url":null,"internal_url":null},{"position":51,"raw":"[Rudin et al., 2021] C. Rudin, C. Chen, Z. Chen, H. Huang, L. Semenova, and C. Zhong. Interpretable Machine Learn- ing: Fundamental Principles and 10 Grand Challenges. CoRR, abs/2103.11251, 2021.","title":"Interpretable Machine Learning: Fundamental Principles and 10 Grand Challenges","authors":"C Rudin, C Chen, Z Chen, H Huang, L Semenova, C Zhong","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":52,"raw":"[Samek et al., 2019] W. Samek, G. Montavon, A. Vedaldi, L.K. Hansen, and K.R. Müller. Explainable AI: Interpret- ing, Explaining and Visualizing Deep Learning. Springer, 2019.","title":"Explainable AI: Interpreting, Explaining and Visualizing Deep Learning","authors":"W Samek, G Montavon, A Vedaldi, L K Hansen, K R Müller","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":53,"raw":"[Schapire and Freund, 2014] R.E. Schapire and Y. Freund. Boosting: Foundations and Algorithms. MIT Press, 2014.","title":"Boosting: Foundations and Algorithms","authors":"R E Schapire, Y Freund","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":54,"raw":"[Shi et al., 2020] W. Shi, A. Shih, A. Darwiche, and A. Choi. On Tractable Representations of Binary Neural Networks. In Proc. of KR'20, pages 882-892, 2020.","title":"On Tractable Representations of Binary Neural Networks","authors":"W Shi, A Shih, A Darwiche, A Choi","year":"2020","venue":"Proc. of KR'20","doi":null,"url":null,"internal_url":null},{"position":55,"raw":"[Shih et al., 2018] Andy Shih, Arthur Choi, and Adnan Dar- wiche. Formal verification of Bayesian network classifiers. In Proc. of PGM'18, pages 427-438, 2018.","title":"Formal verification of Bayesian network classifiers","authors":"Andy Shih, Arthur Choi, Adnan Darwiche","year":"2018","venue":"Proc. of PGM'18","doi":null,"url":null,"internal_url":null},{"position":56,"raw":"[Shih et al., 2019] Andy Shih, Arthur Choi, and Adnan Dar- wiche. Compiling Bayesian Networks into Decision Graphs. In Proc. of AAAI'19, pages 7966-7974, 2019.","title":"Compiling Bayesian Networks into Decision Graphs","authors":"Andy Shih, Arthur Choi, Adnan Darwiche","year":"2019","venue":"Proc. of AAAI'19","doi":null,"url":null,"internal_url":null},{"position":57,"raw":"[Srinivasan and Chander, 2020] R. Srinivasan and A. Chan- der. Explanation Perspectives from the Cognitive Sciences -A Survey. In Proc. of IJCAI'20, pages 4812-4818, 2020.","title":"Explanation Perspectives from the Cognitive Sciences -A Survey","authors":"R Srinivasan, A Chander","year":"2020","venue":"Proc. of IJCAI'20","doi":null,"url":null,"internal_url":"/proceedings/2020/670"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}