SearcharxivSearch

arXiv · 2412.10038

Stochastic Variational Inference for Structured Additive Distributional Regression

Abstract

Structured additive distributional regression extends generalized additive models by allowing all parameters of a response distribution to depend on structured additive predictors. Bayesian formulations regularize these models through prior distributions that enforce smoothness or shrinkage, but Markov chain Monte Carlo methods, the standard computational tool, scale poorly with sample size and require substantial runtime. We develop a scalable stochastic variational inference framework for approximate Bayesian inference in structured additive distributional regression. Our key contribution is a variational family for the regression coefficients that is amortized over covariates, responses, and smoothing parameters. This construction allows the variational location and precision to adapt locally to the data, which leads to substantially higher ELBO values in markedly less computational time compared to existing approaches. To balance accuracy and scalability, we consider a block-structured variant that constrains the precision matrix but preserves essential dependence across smooth components. Both approaches are compared with a state-of-the-art dense variational approximation and with the widely used Integrated Nested Laplace Approximation (INLA). We establish theoretical results on posterior propriety and local asymptotic Gaussianity that motivate the proposed Gaussian approximations, assess their performance in simulation studies involving logistic and gamma distributional regression, and demonstrate their scalability in an application to modeling injury counts in motor vehicle crashes in New York City with more than 200,000 observations. Across all settings, incorporating covariates, responses, and smoothing parameters into the construction of the variational distribution yields higher ELBO values in substantially less computational time compared with existing variational approaches.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gianmarco Callegher, Thomas Kneib, Johannes Söding, Paul Wiemann. 2024-12-13. Stochastic Variational Inference for Structured Additive Distributional Regression. https://arxiv.org/abs/2412.10038

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO