Stochastic Variational Inference for Vine Copula Distributional Regression

Gianmarco Callegher; Thomas Kneib

Home/Archive/arXiv

arXiv · 2609.37996

Stochastic Variational Inference for Vine Copula Distributional Regression

Gianmarco Callegher·Thomas Kneib

View original source ↗Read source document ↗Export metadata ↓

Abstract

Structured additive distributional regression flexibly relates all parameters of a conditional response distribution to covariates, but multivariate extensions remain challenging when dependence is complex. We propose a multivariate structured additive distributional regression model based on regular vine copulas. Different vine edges may use different pair-copula families, while every pair-copula parameter may vary with covariates through a structured additive predictor. The model therefore accommodates heterogeneous marginal distributions together with pair-specific asymmetric, tail-dependent, and covariate-dependent dependence structures. For scalable inference, we develop a tree-wise stochastic variational inference procedure based on component-specific Gaussian variational approximations. Marginal models are estimated first, followed by pair-copula regressions sequentially along the vine trees. We also adapt sequential vine selection by fitting candidate covariate-dependent pair-copula regressions and using information criteria based on effective degrees of freedom for both family and tree selection. In simulations, the tree-wise estimator remains close to an oracle using the true recursive conditional inputs, whereas global refinement yields more concentrated approximations and lower frequentist coverage for upstream components. An application to six-dimensional meteorological data from the Netherlands yields a vine combining Gaussian and non-Gaussian pair copulas, with pronounced nonlinear spatial and temporal variation in dependence.

Explore related subjects

stat.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Gianmarco Callegher, Thomas Kneib. 2026-09-29. Stochastic Variational Inference for Vine Copula Distributional Regression. https://arxiv.org/abs/2609.37996

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

KEEP EXPLORING

Related papers

arXiv2026

Particle Filtering for a Class of State-Space Models with Low and Degenerate Observational Noise

We consider the discrete-time filtering problem in scenarios where the observation noise is low or degenerate. We focus on the case where the observation equation is a linear function of the state and the data involve additive noise. However, we place minimal assumptions on the hidden state process. For such a class of models we derive new particle filters (PFs) with the key property that their performance is robust to the size of the observation noise. As a consequence, the developed PFs are well-defined in the limiting case of degenerate observation noise. Indicatively, we prove (under assumptions) that the PF applied in this low noise setting inherits the properties of the PF used in the degenerate case. We extend our framework to the case where the hidden states are drawn from a diffusion process. We illustrate our algorithms numerically on several examples.

stat.CO↗

arXiv2026

Prediction-Oriented Sequential Bayesian Design of Physical Experiments Informed by Computer Models

In many scientific and engineering domains, physical experiments are often costly, time-consuming, and limited to a certain number of design points. The Kennedy and O'Hagan (KOH) framework is widely used for combining simulator runs with limited experimental observations. Under a Bayesian implementation, simulator output, model discrepancy, and observation noise are jointly modeled by coupled Gaussian processes, followed by posterior inference and uncertainty quantification, thereby providing a probabilistic foundation for experimental design. Existing sequential design criteria mainly target better parameter estimation or global uncertainty reduction but may overlook the local structure of the predicted response. This work presents a sequential Bayesian experimental design (BED) framework aimed at improving the predictive performance of the KOH model. The framework introduces a mutual information (MI)-based criterion combined with a local complexity score that measures nonlinearity of the posterior predictive mean near each candidate point, leading to more efficient design decisions. To make the criterion computationally feasible in a fully Bayesian setting, we employ Gaussian mixture reduction with fast covariance update strategies. Through several challenging test problems and an example of the Duffing oscillator on a discrete design space, we demonstrate the effectiveness of the proposed method and illustrate its difference from conventional design baselines under sequential (offline) and adaptive (online) BED settings. The numerical results suggest that incorporating local response complexity into the MI criterion can substantially improve prediction-oriented design for physical experiments informed by computer models.

stat.CO↗

arXiv2026

Sequential Design for Simulators with Sharp Variations via Deep Gaussian Process Gradients

Deep Gaussian Processes (DGPs) compose Gaussian Process (GP) layers to warp inputs, improving the emulation of computer simulators with nonstationary input-output mappings. While gradient posteriors are analytically available for GPs, quantifying gradient uncertainty for DGPs is more challenging due to their hierarchical composition. In this paper, we propose an efficient approximation to the gradient distribution of a two-layer DGP emulator without requiring simulator gradients. Using the local linearization, we derive closed-form approximations for the gradient mean and covariance, enabling efficient gradient evaluation with uncertainty quantification (UQ). Empirical results show that the proposed approximation provides accurate gradient estimates and informative UQ on nonstationary examples. We then use the derived gradient uncertainty to guide sequential design for computer models with sharp variations. Specifically, we represent sharp-variation regions as super-level sets of the gradient norm and introduce an entropy-based acquisition rule that selects new samples where the estimated sharp-region is most uncertain. Experiments on synthetic benchmarks and a real-world application show that the resulting sequential design improves emulation accuracy for functions with sharp variations relative to existing design methods.

stat.CO↗