Searcharxiv⌕ Search

arXiv subjects

Håvard Rue

Publications and source records attributed to Håvard Rue.

At least 19 recordsLinked to original sources

A Proper Random Walk Spline Model for Bayesian Smoothing

We introduce the Proper Random Walk (PRW) family of spline models with a particular focus on the Second-Order Proper Random Walk (PRW2), a proper stationary alternative to the standard random walk of order 2 (RW2) spline. The PRW2 retains the computational strengths and spline-like smoothing of the RW2 while providing uniform marginal variance and stable uncertainty behavior. The PRW2 model is governed by a range parameter that controls correlation decay: in the infinite-range limit, it recovers RW2. In addition to its discrete representation, we show that the PRW2 model admits a continuous-time formulation as the critically damped Matérn model with smoothness $ν=3/2$, which provides an interpretable parameterization and enables construction through a Galerkin finite-element approximation on general grids. To mitigate edge distortions on bounded domains, we propose a local boundary correction that enforces the stationary joint law while preserving sparsity and $O(n)$ factorization. Finally, we develop penalized complexity priors for the model hyperparameters, enabling principled shrinkage toward the RW2 limit. The model is applied to simulated and real data to illustrate its properties and advantages.

stat.ME↗

Implementation and Workflows for INLA-Based Approximate Bayesian Structural Equation Modelling

Bayesian structural equation modelling (BSEM) offers many advantages such as principled uncertainty quantification, small-sample regularisation, and flexible model specification. However, the Markov chain Monte Carlo (MCMC) methods on which it relies can be slow for the iterative cycle of specification, criticism, and refinement that careful psychometric practice demands. We present INLAvaan, an R package for fast, approximate Bayesian SEM built around the Integrated Nested Laplace Approximation (INLA) framework for structural equation models developed by Jamil and Rue (2026, arXiv:2603.25690). This paper serves as a companion manuscript that describes the architectural decisions and computational strategies underlying the package. Two substantive applications -- a 256-parameter bifactor circumplex model and a multilevel mediation model with full-information missing-data handling -- demonstrate how INLAvaan makes the iterative Bayesian workflow feasible in applied psychometric work.

stat.CO↗

Coherent Information Deletion: Bayesian, Generalized Bayesian and Possibilistic Unlearning

Bayes' theorem admits an information processing interpretation due to Zellner (1988): under the Shannon information criterion, the posterior is the unique rule that processes prior and data information without information loss. We revisit these ideas from the perspective of information deletion. Given a posterior based on a complete dataset, what distribution should replace it when a subset of the data is removed? For ordinary Bayesian inference, we show that the corresponding information deletion objective is uniquely minimized by the leave-data-out posterior. We then extend the framework beyond likelihood-based inference from Bayes to the generalized Bayesian updating of Bissiri et al.(2016} based on loss functions. Requiring deletion to be coherent under sequential removal of loss contributions yields a deletion rule that exactly recovers the generalized posterior based only on the retained information. We further develop an axiomatic theory, beyond probabilistic inference, for possibilistic deletion and show that the same information-deletion perspective leads to a principled rule for exact possibilistic unlearning. Finally, restricting these exact deletion principles to tractable families leads naturally to variational Bayesian, generalized Bayesian, and maxitive possibilistic unlearning.

stat.ME↗

ISBO: Scalable Spatio-Temporal Bayesian Optimization with Log Gaussian Cox Process Models via the INLA-SPDE Approach

Bayesian Optimization (BO) is a popular method for efficiently optimizing expensive black-box objectives. However, BO utilizing standard Gaussian Processes is ill-suited for doubly stochastic Cox Processes that are often used in spatio-temporal problem spaces. We introduce INLA-SPDE Spatio-Temporal Bayesian Optimization (ISBO): the first scalable BO framework for spatio-temporal data, that models the log-intensity with a Log-Gaussian Cox Process(LGCP) and performs inference via Integrated Nested Laplace Approximation and Stochastic Partial Differential Equations (INLA-SPDE) approach. Using a Matern field on meshes yields a sparse Gaussian Markov Random Field, where INLA provides fast and accurate posterior inference throughout sequential optimization. ISBO stably locates high-intensity regions and the peak of the latent intensity with minimal evaluations. A time-varying Upper Confidence Bound acquisition with masking avoids revisits, while penalized-complexity priors regularize early rounds. Experiments on synthetic and real-world spatio-temporal datasets show accurate peak discovery, intensity recovery, and substantial speedups over an RKHS-based baseline, positioning ISBO as a practical choice for BO with point-process data.

stat.ML↗

Dense Matrices Are Alike; Sparse Matrices Are Sparse in Their Own Way: A Structure-Adaptive Tile Cholesky Factorization

Sparse direct Cholesky solvers fix one data structure for an entire matrix, but symmetric positive definite systems range from nearly dense to irregular, sometimes mixing both within one matrix. We let the data structure follow the sparsity structure, across matrices and across tiles within a matrix. Before numerical work starts, a lightweight selector captures the sparsity pattern of the Cholesky factor and routes the matrix, on one static shared-memory schedule, to one of three regimes: dense, sparse, or an intermediate semisparse regime. Dense tiles are stored in full; the semisparse regime uses a new active-column tile that keeps only the columns the factorization will touch, so banded or arrowhead-shaped structures common in spatial models still reach BLAS-3 efficiency. The approach suits the integrated nested Laplace approximation (INLA): one sparsity pattern factorized thousands of times with different values, so the one-time analysis cost is amortized and every factorization saving compounds. We evaluate the technique on 60 SPD matrices, comparing against MUMPS, PaStiX, CHOLMOD, symPACK, and Intel oneMKL PARDISO on Intel Xeon and AMD EPYC nodes; the selector alone achieves the lowest total factorization time in every regime. Summed over the suite, it beats the best fixed single-structure mode by 1.6 to 2.6x, and every alternative by 1.8 to 12.5x on Intel and 2.6 to 10.1x on AMD, with the largest gains on the most expensive factorizations. It trades more one-time analysis for less time per factorization, pulling ahead by the third factorization of a given pattern. As a first GPU extension, the dense route on one NVIDIA A100, with the factor resident on the device, runs 1.2 to 6.3x faster than on the faster CPU node, the margin widening with factor size. Solver, Python/R/Julia interfaces, benchmark suite, and results are open at https://github.com/esmail-abdulfattah/sTiles.

cs.PF↗

Approximate Bayesian Inference for Structural Equation Models using Integrated Nested Laplace Approximations

Markov chain Monte Carlo (MCMC) methods remain the mainstay of Bayesian estimation of structural equation models (SEM), though they often incur a high computational cost. We present a bespoke approximate Bayesian approach to SEM, drawing on ideas from the integrated nested Laplace approximation (INLA; Rue et al., 2009, J. R. Stat. Soc., B: Stat. Methodol.) framework. After analytically integrating out the latent variables, we implement a simplified Laplace approximation that profiles the posterior using an efficient gradient-based volume correction, allowing for parametric skew-normal estimation of the marginals. A variational Bayes correction further refines the centre of the joint Gaussian approximation; marginal profiling implicitly recovers the same location correction to leading order. Essential quantities, including factor scores and model-fit indices, are obtained via a Gaussian copula sampling scheme. On a benchmark SEM, inference completes in seconds with close agreement to MCMC. A simulation study stresses the approximation along sample size, identification, boundary proximity, and model dimension. Accuracy remains high across the examined sample sizes and model dimensions, with degradation concentrated in weakly identified settings and in the lower tails of variances near the zero boundary.

stat.ME↗

Cross Validation for the log Gaussian Cox Process

The log Gaussian Cox Process (LGCP) is one of the most widely used models for the analysis of spatial point patterns. Although Bayesian methods and software for fitting LGCPs are now well established, practical tools for model criticism, predictive assessment, and model comparison remain comparatively underdeveloped. This paper develops a practical Bayesian cross-validation framework for LGCPs while placing it within a broader framework for Bayesian model assessment. Our approach is motivated by the conceptual and computational challenges that arise when defining predictive validation for point processes, including the choice of holdout data, prediction task, scoring rule, and computational strategy. We propose a leave-region-out cross-validation framework in which the fundamental unit of prediction is a bounded spatial region rather than an individual event. Predictive performance is assessed through the logarithmic scoring rule for joint probabilistic forecasts, while computational efficiency is achieved by combining a new likelihood approximation with a Bayesian unlearning strategy and Laplace approximations to obtain leave-region-out predictive distributions without repeated model refitting. We validate the proposed approximations against Monte Carlo estimates obtained via brute-force refitting, demonstrate the methodology on simulated and real spatial point pattern datasets defined on Euclidean domains and networks, and provide implementations in the R-INLA, inlabru, and MetricGraph packages.

stat.ME↗

Beyond Laplace: Closed-form wrapped Gaussian posterior approximations on statistical manifolds

In Bayesian statistics, the Laplace approximation provides a computationally efficient approximation to posterior distributions. However, its Gaussian form restricts it to elliptical shapes, limiting its ability to capture important posterior features such as skewness, heavy tails, and narrow high-probability regions. Recent work has addressed this limitation by exploiting Riemannian geometry to push forward Gaussian distributions from the tangent space to a chosen manifold, referred to wrapped Gaussians. While offering greater flexibility, they introduce substantial computational challenges. Sampling requires solving geodesic equations through the exponential map and density evaluation additionally depends on the logarithmic map and Jacobi fields, involving costly differential equation solvers alongside full matrices inverse operations, Christoffel symbols and curvature tensors. To overcome these limitations, we employ the theory of contrast functions to derive tractable approximations of the logarithmic and exponential maps on statistical manifolds endowed with the Fisher--Rao metric and the prior distribution geometry. The resulting methodology bypass the need to compute these geometric quantities and numerical solvers thereby removing the principal computational bottlenecks of existing wrapped Gaussian approaches. Empirical results across a range of models demonstrate that the proposed approximation captures complex posterior geometries while remaining orders of magnitude faster than current geometric state-of-the-art approximation.

stat.ME↗

Deterministic Leave-One-Cluster-Out Cross-Validation for Multilevel Bayesian Structural Equation Models

We introduce a closed-form, refit-free procedure for leave-one-cluster-out (LOCO) cross-validation in multilevel Gaussian Bayesian structural equation models (SEMs), together with predictive scoring of every nested submodel. Conditional independence of clusters given the parameters expresses the cluster-deleted posterior as a functional of the full posterior. The LOCO predictive density is then a harmonic mean of the cluster likelihood, computable from a single fit in INLAvaan, the integrated nested Laplace approximation package for Bayesian SEM. We evaluate the harmonic-mean expectation in closed form through a fully exponential Laplace approximation of the reciprocal cluster likelihood under a Gaussian posterior; candidate structural restrictions follow by Gaussian conditioning of the same Laplace summary. The resulting Taylor elpd (expected log predictive density) scores are fully deterministic, requiring neither refitting nor Monte Carlo sampling, so the variance pathology of the naive harmonic-mean estimator does not arise. A direct-sum decomposition of the compound-symmetric cluster covariance makes the cost independent of cluster size, orders of magnitude below brute-force refitting. We validate against brute-force refits and Markov chain Monte Carlo in simulation, and illustrate the procedure on school-safety climate in PISA 2022 and on 16 candidate structures linking personality and well-being in the MIDUS sibling sample.

stat.ME↗

Distributed and recursive Bayesian inference for Big Data and complex spatio-temporal models

The rapid growth of massive and complex datasets in fields such as econometrics, environmental sciences, risk management, and public policy has reshaped statistical modeling while introducing significant computational and methodological challenges. These challenges arise not only from data scale and model complexity, but also from the sequential or streaming nature of modern applications and from data-privacy constraints that prevent sharing raw data and thus limit joint analysis. To address these challenges, we introduce a novel and comprehensive Bayesian framework for distributed and recursive inference, grounded in the Integrated Nested Laplace Approximations (INLA) methodology and implemented using the R-INLA software. Our contributions include the partitioning both data and structured model components, reducing computational complexity while preserving accuracy relative to centralized full-data inference. We demonstrate the effectiveness of the proposed framework through case studies that highlight its applicability in large-scale, streaming, and privacy-sensitive settings. By integrating distributed, federated, and recursive paradigms, this work offers scalable, adaptive, and generalizable tools for modern Bayesian inference.

stat.ME↗

Informative Distance-Based Priors for Correlation Matrices Centred on a Target Reference

Specifying a prior over the space of correlation matrices is a persistent challenge in Bayesian analysis. The space is a curved manifold whose dimension grows quadratically with the number of variables, making substantive prior beliefs difficult to encode.\\ We propose a distance-based prior that assigns mass decaying exponentially in the Fisher arc-length distance from a user-specified reference correlation matrix, enabling shrinkage toward any target correlation structure rather than being confined to the identity matrix. Formally, this is constructed as a Penalised Complexity prior, but its interpretation shifts accordingly: unless the chosen target represents a structurally simpler state, the shrinkage penalises deviation rather than complexity in the usual sense. To accommodate conditional independence constraints, we introduce a parameterisation that constructs the correlation matrix via the Cholesky factor of the inverse correlation matrix with respect to a user-supplied graph, thereby reducing the number of free parameters from one per variable pair to one per graph edge. The prior is proper for every positive value of its rate parameter, accommodates correlations of either sign under any graph structure, and reduces to a fully unstructured prior when the graph is complete. A direct sampling algorithm is provided, enabling prior predictive checks and sensitivity analysis, implemented within the \texttt{graphpcor} package.

stat.ME↗

ADELIA: Automatic Differentiation for Efficient Laplace Inference Approximations

Spatio-temporal Bayesian inference drives environmental and health sciences using latent Gaussian models. Integrated Nested Laplace Approximations (INLA) enable inference for these models at HPC scale but rely on derivative-based optimization over $d$ hyperparameters. State-of-the-art INLA implementations approximate derivatives via central finite differences (FD), requiring $2d{+}1$ evaluations. These evaluations are embarrassingly parallel, but total work and energy grow with $d$, limiting time-to-solution under fixed budgets. Reverse-mode automatic differentiation (AD) computes exact gradients independently of $d$, but its efficient application to INLA's structured-sparse kernels is an open challenge. We present ADELIA, the first AD-enabled INLA implementation with a structure-exploiting multi-GPU backward pass leveraging model sparsity. We evaluate ADELIA on ten benchmark models, including real-world air-pollution monitoring. We achieve $4.2$--$7.9\times$ per-gradient speedups and reliable convergence on production-scale models with up to 1.9M latent variables, where FD struggles. Even when scaled to 16--32 GPUs to match ADELIA's wall-clock time, FD consumes $5$--$8\times$ more energy.

cs.DC↗

Efficient Bayesian inference for non-linear association structures in joint models: A hierarchical approach via INLA

Joint models for longitudinal and time-to-event data are increasingly used in health research to characterize the association between biomarker trajectories and the risk of clinical events. However, these models usually assume a linear relationship between the longitudinal marker and the log-hazard of the event. This assumption is rarely verified and often fails to capture complex biological mechanisms, such as U-shaped risk profiles or plateau effects. In this paper, we propose a fast and stable hierarchical framework for non-linear association structures in joint models using Integrated Nested Laplace Approximations (INLA), implemented in the INLAjoint R package. Our approach builds upon a unified framework where the scaling effect of the marker is decomposed into a parametric baseline (constant and linear components) and a data-driven smooth deviation modeled via an orthogonal basis derived from a second-order random walk. This natural hierarchy allows researchers to adapt model flexibility directly and verify the linearity assumption using standard information criteria. Through simulation studies, we demonstrate that the proposed method accurately recovers complex non-linear trajectories. We illustrate the practical utility of our framework by analyzing the joint association of the current value and current slope of body mass index (BMI) with all-cause mortality in the Health and Retirement Study. This analysis reveals a U-shaped mortality risk for the BMI value, and a non-linear effect for the rate of weight change, where a declining weight trajectory is associated with higher mortality risk.

stat.ME↗

Penalizing complexity priors for Bayesian inference of circular models

Advancements in computational power and methodologies have enabled research on massive datasets. However, tools for analyzing data with directional or periodic characteristics, such as wind directions and customers' arrival time in 24-hour clock, remain underdeveloped. While statisticians have proposed circular distributions for such analyses, significant challenges persist in constructing circular statistical models, particularly in the context of Bayesian methods. These challenges stem from limited theoretical development and a lack of historical studies on prior selection for circular distribution parameters. In this article, we propose a framework for selecting hyperpriors that contracts to a simpler model in circular scenarios, especially when there is insufficient information to guide prior selection. We introduce well-examined Penalized Complexity (PC) priors for the most widely used circular distributions. Comprehensive comparisons with existing hyperpriors in the literature are conducted through simulation studies and a practical case study. Finally, we discuss the contributions and implications of our work, providing a foundation for further advancements in constructing Bayesian circular statistical models.

stat.ME↗

XGBoost meets INLA: a two-stage spatio-temporal forecasting of wildfires in Portugal

Wildfires pose a major threat to Portugal, with over 115,000 hectares burned annually on average during 1980-2024, and the country has faced devastating mega-fires such as those in 2017. Accurate forecasts of wildfire occurrence and burned area are therefore essential for firefighting resource allocation and emergency preparedness. In this study, we propose a novel two-stage ensemble that extends the widely used latent Gaussian modelling framework with integrated nested Laplace approximation (INLA) for spatio-temporal wildfire forecasting. Stage 1 applies a gradient boosting model (XGBoost) to environmental covariates and historical fire records to produce one-month-ahead point forecasts of fire counts and burned area. Stage 2 uses these predictions as external covariates in a latent Gaussian model with additional spatiotemporal random effects to generate probabilistic forecasts of monthly total fire counts and burned area at the council level. To capture both moderate and extreme events, we implement the extended generalised Pareto (eGP) likelihood (a sub-asymptotic distribution) within INLA, develop Penalised Complexity (PC) priors for its parameters, and compare the eGP likelihood with common alternatives (e.g., Gamma and Weibull). Our framework tackles the unavailability of future environmental covariates at prediction time and performs strongly for one-month-ahead forecasts.

stat.AP↗

Parallel Selected Inversion for Space-Time Gaussian Markov Random Fields

Performing Bayesian inference on large spatio-temporal models requires extracting inverse elements of large sparse precision matrices for marginal variances, as well as estimating model hyperparameters. Although direct matrix factorizations can be used for the inversion, such methods fail to scale well for distributed problems when run on large computing clusters. On the contrary, Krylov subspace methods for the selected inversion have been gaining traction. We propose a parallel hybrid approach based on domain decomposition, which extends the Rao-Blackwellized Monte Carlo estimator for distributed precision matrices. Our approach exploits the strength of Krylov subspace methods as global solvers and efficiency of direct factorizations as base case solvers to compute the marginal variances and the derivatives required for hyperparameter estimation using a divide-and-conquer strategy. By introducing subdomain overlaps, one can achieve greater accuracy at an increased computational effort with little to no additional communication. We demonstrate the speed improvements and efficient hyperparameter inference on both simulated models and a massive US daily temperature data.

stat.CO↗

Bayesian identification of early warning signals for long-range dependent climatic time series

Detecting early warning signals in climatic time series is essential for anticipating critical transitions and tipping points. Common statistical indicators include increased variance and lag-one autocorrelation prior to bifurcation points. However, these indicators are sensitive to observational noise, long-term mean trends, and long-memory dependence, all of which are prevalent in climatic time series. Such effects can easily obscure genuine signals or generate spurious detections. To address these challenges, we employ a flexible Bayesian framework for modelling time-varying autocorrelation in long-range dependent time series, also accounting for time-varying variance. The approach uses a mixture of two fractional Gaussian noise processes with a time-dependent weight function to represent fractional Gaussian noise with a time-varying Hurst exponent. Inference is performed via integrated nested Laplace approximation, enabling joint estimation of mean trends and handling of irregularly sampled observations. The strengths and limitations of detecting changes in the autocorrelation is investigated in extensive simulations. Applied to real climatic data sets, we find evidence of early warning signals in a reconstructed Atlantic multidecadal variability index, while dismissing such signals for paleoclimate records spanning the Dansgaard-Oeschger events.

stat.ME↗

Integrating Expert Knowledge and Recursive Bayesian Inference: A Framework for Spatial and Spatio-Temporal Data Challenges

Integrating heterogeneous data sources and expert knowledge is essential for overcoming data scarcity and enhancing estimation accuracy. Two main frameworks naturally arise to perform the integration of these multiple sources: sequential Bayesian inference and integrated models. The first one consists of updating posterior information in a sequential data analysis procedure, without the need to reanalyze previous data when new data become available. The second one consists of bringing together diverse sources of information in a joint inferential analysis through hierarchical Bayesian models. Within the context of the first framework, we propose a recursive inference method grounded in the methodological principles of INLA, designed to handle spatial and spatio-temporal problems, although its applicability is not limited to these cases, as the procedure is general in nature. Within the integrated models framework, we also present a comprehensive approach to address change of support issues that arise when combining heterogeneous information sources, developing a typology that classifies such changes as spatial, temporal, spatio-temporal, or categorical. Both frameworks can be combined, as there is neither a theoretical nor a practical incompatibility preventing their joint use. Finally, detailed examples are provided to illustrate clear and replicable procedures for combining heterogeneous data sources with change of support and recursive inference.

stat.ME↗