paper-with-me

홈 › Papers

LiD-GLM: Lipschitz-constrained Deep Generalized Linear Models

2026-08-17 · Tom Splittgerber, Niklas Koenen, Marvin N. Wright, Werner Brannath arxiv

The combination of traditional statistical models and neural network (NN) components into semi-structured hybrid models is an intriguing approach to construct models that, ideally, combine traditional interpretability with the unprecedented flexibility of NNs. In order to preserve interpretability, it is usually necessary to restrict the NN components to prevent them from dominating the model. However, existing methods that enforce structural constraints on their NN components severely limit their models' flexibility; in contrast, methods that only enforce weak, indirect constraints lose meaningful interpretability. The method we propose therefore leverages invertible residual neural networks (i-ResNets) to equip generalized linear models with both nonlinear parameter estimation and a flexible correction of their distributional assumptions while always retaining stochastic monotonicity of the modeled distribution in the (formerly linear) predictor. The i-ResNets correspond to a controlled deviation from identity and by constraining their Lipschitz constant one can rigorously limit and quantify how far the hybrid model deviates from its traditional counterpart. This enables a user-specifiable compromise between flexibility and interpretability without limiting the structure of nonlinear and interaction effects that can be learned. Furthermore, we develop specific inherent interpretation techniques for our model and enforce model identifiability through an adapted post-hoc orthogonalization.

📄 PDF Abstract BibTeX arXiv:2608.16340

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Dual optimization for convex constrained objectives without the gradient-Lipschitz assumption

2018-07-10 · Martin Bompaire, Emmanuel Bacry, Stéphane Gaïffas

The minimization of convex objectives coming from linear supervised learning problems, such as penalized generalized linear models, can be formulated as finite sums of convex functions. For such problems, a large set of …

Computational Efficiencyregression

LDLT $\mathcal{L}$-Lipschitz Network: Generalized Deep End-To-End Lipschitz Network Construction

2025-12-05 · Marius F. R. Juston, Ramavarapu S. Sreenivas, Dustin Nottage, Ahmet Soylemezoglu arxiv

Deep residual networks (ResNets) have demonstrated outstanding success in computer vision tasks, attributed to their ability to maintain gradient flow through deep architectures. Simultaneously, controlling the Lipschitz…

Adversarial Robustness

Improving Lipschitz-Constrained Neural Networks by Learning Activation Functions

2022-10-28 · Stanislas Ducotterd, Alexis Goujon, Pakshal Bohra, Dimitris Perdios 외

Lipschitz-constrained neural networks have several advantages over unconstrained ones and can be applied to a variety of problems, making them a topic of attention in the deep learning community. Unfortunately, it has be…

Approximation of Lipschitz Functions using Deep Spline Neural Networks

2022-04-13 · Sebastian Neumayer, Alexis Goujon, Pakshal Bohra, Michael Unser

Lipschitz-constrained neural networks have many applications in machine learning. Since designing and training expressive Lipschitz-constrained networks is very challenging, there is a need for improved methods and a bet…

Sorting out Lipschitz function approximation

2018-11-13 · Cem Anil, James Lucas, Roger Grosse

Training neural networks under a strict Lipschitz constraint is useful for provable adversarial robustness, generalization bounds, interpretable gradients, and Wasserstein distance estimation. By the composition property…

Adversarial RobustnessGeneralization Bounds