paper-with-me

Papers

Interpretable Machine Learning based on Functional ANOVA Framework: Algorithms and Comparisons

2023-05-25 · Linwei Hu, Vijayan N. Nair, Agus Sudjianto, Aijun Zhang, Jie Chen

In the early days of machine learning (ML), the emphasis was on developing complex algorithms to achieve best predictive performance. To understand and explain the model results, one had to rely on post hoc explainability techniques, which are known to have limitations. Recently, with the recognition that interpretability is just as important, researchers are compromising on small increases in predictive performance to develop algorithms that are inherently interpretable. While doing so, the ML community has rediscovered the use of low-order functional ANOVA (fANOVA) models that have been known in the statistical literature for some time. This paper starts with a description of challenges with post hoc explainability and reviews the fANOVA framework with a focus on main effects and second-order interactions. This is followed by an overview of two recently developed techniques: Explainable Boosting Machines or EBM (Lou et al., 2013) and GAMI-Net (Yang et al., 2021b). The paper proposes a new algorithm, called GAMI-Lin-T, that also uses trees like EBM, but it does linear fits instead of piecewise constants within the partitions. There are many other differences, including the development of a new interaction filtering algorithm. Finally, the paper uses simulated and real datasets to compare selected ML algorithms. The results show that GAMI-Lin-T and GAMI-Net have comparable performances, and both are generally better than EBM.

📄 PDF Abstract BibTeX arXiv:2305.15670

Code (0)

등록된 구현이 없습니다.

Tasks

Interpretable Machine Learning

Methods 이 논문이 사용한 방법론

EBM 설명 없음
HOC 설명 없음
Focus 설명 없음

Similar Papers 제목 키워드 기반

Using Model-Based Trees with Boosting to Fit Low-Order Functional ANOVA Models

2022-07-14 · Linwei Hu, Jie Chen, Vijayan N. Nair

Low-order functional ANOVA (fANOVA) models have been rediscovered in the machine learning (ML) community under the guise of inherently interpretable machine learning. Explainable Boosting Machines or EBM (Lou et al. 2013…

BIG-bench Machine LearningInterpretable Machine Learning

Tensor Product Neural Networks for Functional ANOVA Model

2025-02-21 · Seokhun Park, Insung Kong, Yongchan Choi, Chanmoo Park 외

Interpretability for machine learning models is becoming more and more important as machine learning models become more complex. The functional ANOVA model, which decomposes a high-dimensional function into a sum of lowe…

model

META-ANOVA: Screening interactions for interpretable machine learning

2024-08-02 · Yongchan Choi, Seokhun Park, Chanmoo Park, Dongha Kim 외

There are two things to be considered when we evaluate predictive models. One is prediction accuracy,and the other is interpretability. Over the recent decades, many prediction models of high performance, such as ensembl…

Interpretable Machine LearningPrediction

Bayesian Neural Networks for Functional ANOVA model

2025-10-01 · Seokhun Park, Choeun Kim, Jihu Lee, Yunseop Shin 외 arxiv

With the increasing demand for interpretability in machine learning, functional ANOVA decomposition has gained renewed attention as a principled tool for breaking down high-dimensional function into low-dimensional compo…

Bayesian Inference

Unifying Feature-Based Explanations with Functional ANOVA and Cooperative Game Theory

2024-12-22 · Fabian Fumagalli, Maximilian Muschalik, Eyke Hüllermeier, Barbara Hammer 외

Feature-based explanations, using perturbations or gradients, are a prevalent tool to understand decisions of black box machine learning models. Yet, differences between these methods still remain mostly unknown, which l…