PureGAM: Learning An Inherently Pure Additive Model - Microsoft

Trang chủ » Xingzhi Sun » PureGAM: Learning An Inherently Pure Additive Model - Microsoft

Có thể bạn quan tâm

Skip to main content pureGAM: Learning an Inherently Pure Additive Model
  • Xingzhi Sun ,
  • Ziyu Wang ,
  • Rui Ding ,
  • Shi Han ,
  • Dongmei Zhang

SIGKDD 2022 | August 2022

Organized by ACM

Download BibTex

Including pairwise or higher-order interactions among predictors of a Generalized Additive Model (GAM) is gaining increasing attention in the literature. However, existing models face an identifiability challenge. In this paper, we propose pureGAM, an inherently pure additive model of both main effects and higher-order interactions. By imposing the pureness condition to constrain each component function, pureGAM is proved to be identifiable without compromising accuracy. Furthermore, the pureness condition introduces additional interpretability in terms of simplicity. Practically, pureGAM is a unified model to support both numerical and categorical features with a novel learning procedure to achieve optimal performance. Evaluations show that pureGAM outperforms other GAMs and has very competitive performance even compared with opaque models, and its interpretability remarkably outperforms competitors in terms of pureness. We also share a successful adoption of pureGAM in one real-world application.

Publication
  • KDD 2022
  • Artificial intelligence
  • Microsoft Research Lab - Asia
  • Follow on X
  • Like on Facebook
  • Follow on LinkedIn
  • Subscribe on Youtube
  • Follow on Instagram
  • Subscribe to our RSS feed
  • Share on X
  • Share on Facebook
  • Share on LinkedIn
  • Share on Reddit

Từ khóa » Xingzhi Sun