English

Curve Your Enthusiasm: Concurvity Regularization in Differentiable Generalized Additive Models

Machine Learning 2025-11-11 v3 Machine Learning

Abstract

Generalized Additive Models (GAMs) have recently experienced a resurgence in popularity due to their interpretability, which arises from expressing the target value as a sum of non-linear transformations of the features. Despite the current enthusiasm for GAMs, their susceptibility to concurvity - i.e., (possibly non-linear) dependencies between the features - has hitherto been largely overlooked. Here, we demonstrate how concurvity can severly impair the interpretability of GAMs and propose a remedy: a conceptually simple, yet effective regularizer which penalizes pairwise correlations of the non-linearly transformed feature variables. This procedure is applicable to any differentiable additive model, such as Neural Additive Models or NeuralProphet, and enhances interpretability by eliminating ambiguities due to self-canceling feature contributions. We validate the effectiveness of our regularizer in experiments on synthetic as well as real-world datasets for time-series and tabular data. Our experiments show that concurvity in GAMs can be reduced without significantly compromising prediction quality, improving interpretability and reducing variance in the feature importances.

Keywords

Cite

@article{arxiv.2305.11475,
  title  = {Curve Your Enthusiasm: Concurvity Regularization in Differentiable Generalized Additive Models},
  author = {Julien Siems and Konstantin Ditschuneit and Winfried Ripken and Alma Lindborg and Maximilian Schambach and Johannes S. Otterbach and Martin Genzel},
  journal= {arXiv preprint arXiv:2305.11475},
  year   = {2025}
}
R2 v1 2026-06-28T10:38:57.745Z