paper-with-me

Papers

LoRMIkA: Local rule-based model interpretability with k-optimal associations

2019-08-11 · Dilini Rajapaksha, Christoph Bergmeir, Wray Buntine

As we rely more and more on machine learning models for real-life decision-making, being able to understand and trust the predictions becomes ever more important. Local explainer models have recently been introduced to explain the predictions of complex machine learning models at the instance level. In this paper, we propose Local Rule-based Model Interpretability with k-optimal Associations (LoRMIkA), a novel model-agnostic approach that obtains k-optimal association rules from a neighbourhood of the instance to be explained. Compared with other rule-based approaches in the literature, we argue that the most predictive rules are not necessarily the rules that provide the best explanations. Consequently, the LoRMIkA framework provides a flexible way to obtain predictive and interesting rules. It uses an efficient search algorithm guaranteed to find the k-optimal rules with respect to objectives such as confidence, lift, leverage, coverage, and support. It also provides multiple rules which explain the decision and counterfactual rules, which give indications for potential changes to obtain different outputs for given instances. We compare our approach to other state-of-the-art approaches in local model interpretability on three different datasets and achieve competitive results in terms of local accuracy and interpretability.

📄 PDF Abstract BibTeX arXiv:1908.03840

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningcounterfactualDecision Making

Methods 이 논문이 사용한 방법론

Interpretability 설명 없음

Similar Papers 제목 키워드 기반

LCS-DIVE: An Automated Rule-based Machine Learning Visualization Pipeline for Characterizing Complex Associations in Classification

2021-04-26 · Robert Zhang, Rachael Stolzenberg-Solomon, Shannon M. Lynch, Ryan J. Urbanowicz

Machine learning (ML) research has yielded powerful tools for training accurate prediction models despite complex multivariate associations (e.g. interactions and heterogeneity). In fields such as medicine, improved inte…

BIG-bench Machine LearningClusteringFairnessFeature Importance

Rule Generation for Classification: Scalability, Interpretability, and Fairness

2021-04-21 · Tabea E. Röber, Adia C. Lumadjeng, M. Hakan Akyüz, Ş. İlker Birbil

We introduce a new rule-based optimization method for classification with constraints. The proposed method leverages column generation for linear programming, and hence, is scalable to large datasets. The resulting prici…

ClassificationFairnessGeneral Classification

Learning Locally Interpretable Rule Ensemble

2023-06-20 · Kentaro Kanamori

This paper proposes a new framework for learning a rule ensemble model that is both accurate and interpretable. A rule ensemble is an interpretable model based on the linear combination of weighted rules. In practice, we…

Locally Interpretable Individualized Treatment Rules for Black-Box Decision Models

2026-02-12 · Yasin Khadem Charvadeh, Katherine S. Panageas, Yuan Chen arxiv

Individualized treatment rules (ITRs) aim to optimize healthcare by tailoring treatment decisions to patient-specific characteristics. Existing methods typically rely on either interpretable but inflexible models or high…

Neural auto-association with optimal Bayesian learning

2024-12-24 · Andreas Knoblauch

Neural associative memories are single layer perceptrons with fast synaptic learning typically storing discrete associations between pairs of neural activity patterns. Previous works have analyzed the optimal networks un…

Retrieval