SearcharxivSearch

arXiv · 2510.19722

Co-SIVI: A Correlated Semi-Implicit Variational Approach for Spatial Models

Abstract

We propose correlated semi-implicit variational inference (Co-SIVI), a scalable approach for full posterior approximation in large spatial models with exponential-family likelihoods. Co-SIVI incorporates dependence directly into the conditional variational distribution of spatial random effects through an iterative weighted least squares algorithm that accommodates both Gaussian process and nearest-neighbor Gaussian process (NNGP) priors. For large samples, we further propose reparameterizing the variational family for the covariance parameters to better capture posterior dependence. Co-SIVI addresses an important limitation of semi-implicit variational inference (SIVI), for which dependence induced through the mixing distribution may be insufficient when spatial random effects are explicitly included in the variational family. In simulations with Gaussian, Poisson, Gamma, and Bernoulli outcomes, Co-SIVI closely reproduces Hamiltonian Monte Carlo (HMC) results at substantially lower computational cost, while SIVI performs similarly for marginalized Gaussian models. We apply SIVI and Co-SIVI, both with NNGP priors, to two large-scale datasets: temperature data modeled with a Gaussian likelihood and housing price data modeled with a Gamma likelihood. Overall, Co-SIVI provides a scalable and flexible alternative to HMC for full posterior approximation in large non-Gaussian spatial models.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sébastien Garneau, Carlos T. P. Zanini, Alexandra M. Schmidt. 2025-10-22. Co-SIVI: A Correlated Semi-Implicit Variational Approach for Spatial Models. https://arxiv.org/abs/2510.19722

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