paper-with-me

홈 › Papers

Learning outside the Black-Box: The pursuit of interpretable models

2020-11-17 · NeurIPS 2020 12 · Jonathan Crabbé, Yao Zhang, William Zame, Mihaela van der Schaar

Machine Learning has proved its ability to produce accurate models but the deployment of these models outside the machine learning community has been hindered by the difficulties of interpreting these models. This paper proposes an algorithm that produces a continuous global interpretation of any given continuous black-box function. Our algorithm employs a variation of projection pursuit in which the ridge functions are chosen to be Meijer G-functions, rather than the usual polynomial splines. Because Meijer G-functions are differentiable in their parameters, we can tune the parameters of the representation by gradient descent; as a consequence, our algorithm is efficient. Using five familiar data sets from the UCI repository and two familiar machine learning algorithms, we demonstrate that our algorithm produces global interpretations that are both highly accurate and parsimonious (involve a small number of terms). Our interpretations permit easy understanding of the relative importance of features and feature interactions. Our interpretation algorithm represents a leap forward from the previous state of the art.

📄 PDF Abstract BibTeX arXiv:2011.08596

Code (1)

JonathanCrabbe/Symbolic-Pursuit 공식 구현

Tasks

BIG-bench Machine Learning

Similar Papers 제목 키워드 기반

Towards a Research Community in Interpretable Reinforcement Learning: the InterpPol Workshop

2024-04-16 · Hector Kohler, Quentin Delfosse, Paul Festor, Philippe Preux

Embracing the pursuit of intrinsically explainable reinforcement learning raises crucial questions: what distinguishes explainability from interpretability? Should explainable and interpretable agents be developed outsid…

reinforcement-learningReinforcement Learning

An $\mathbf{L^*}$ Algorithm for Deterministic Weighted Regular Languages

2024-11-09 · Clemente Pasti, Talu Karagöz, Anej Svete, Franz Nowak 외

Extracting finite state automata (FSAs) from black-box models offers a powerful approach to gaining interpretable insights into complex model behaviors. To support this pursuit, we present a weighted variant of Angluin's…

In Pursuit of Interpretable, Fair and Accurate Machine Learning for Criminal Recidivism Prediction

2020-05-08 · Caroline Wang, Bin Han, Bhrij Patel, Cynthia Rudin

Objectives: We study interpretable recidivism prediction using machine learning (ML) models and analyze performance in terms of prediction ability, sparsity, and fairness. Unlike previous works, this study trains interpr…

BIG-bench Machine LearningFairnessInterpretable Machine Learning

Isometry pursuit

2024-11-27 · Samson Koelle, Marina Meila

Isometry pursuit is a convex algorithm for identifying orthonormal column-submatrices of wide matrices. It consists of a novel normalization method followed by multitask basis pursuit. Applied to Jacobians of putative co…

Multimodal Concept Bottleneck Models

2026-06-18 · Tongqing Shi, Ge Yan, Tuomas Oikarinen, Tsui-Wei Weng arxiv

Concept Bottleneck Models (CBMs) enhance the interpretability of deep learning networks by aligning the features extracted from images with natural concepts. However, existing CBMs are constrained in their ability to gen…

Image Retrieval