Scalable Krylov Subspace Methods for Generalized Mixed-Effects Models with Crossed Random Effects

Mixed-effects models are widely used to model data with complex grouping structures and high-cardinality categorical predictor variables. However, for high-dimensional crossed random effects, current standard computations relying on Cholesky decompositions can become prohibitively slow. In this work, we present Krylov subspace-based methods that address existing computational bottlenecks, and we analyze them both theoretically and empirically. In particular, we derive new results on the convergence and accuracy of the preconditioned stochastic Lanczos quadrature and conjugate gradient methods for mixed-effects models, and we develop scalable methods for calculating predictive variances. In experiments with simulated and real-world data, the proposed methods yield speedups of several orders of magnitude and are more computationally robust than Cholesky-based computations, while maintaining essentially the same accuracy.

Authors

Institutions

Publication Details

Journal
Journal of Computational and Graphical Statistics
Published
2026-11-09
DOI
https://doi.org/10.1080/10618600.2026.2759707
Citations
2
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
4.80

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Scalable Krylov Subspace Methods for Generalized Mixed-Effects Models with Crossed Random Effects

Fabio Sigrist, Pascal Kündig
2 citations
Journal of Computational and Graphical Statistics
Matrix Theory and Algorithms
4.80
article

Scalable Krylov Subspace Methods for Generalized Mixed-Effects Models with Crossed Random Effects

Fabio Sigrist, Pascal Kündig
article en
2 citations

Abstract

Mixed-effects models are widely used to model data with complex grouping structures and high-cardinality categorical predictor variables. However, for high-dimensional crossed random effects, current standard computations relying on Cholesky decompositions can become prohibitively slow. In this work, we present Krylov subspace-based methods that address existing computational bottlenecks, and we analyze them both theoretically and empirically. In particular, we derive new results on the convergence and accuracy of the preconditioned stochastic Lanczos quadrature and conjugate gradient methods for mixed-effects models, and we develop scalable methods for calculating predictive variances. In experiments with simulated and real-world data, the proposed methods yield speedups of several orders of magnitude and are more computationally robust than Cholesky-based computations, while maintaining essentially the same accuracy.

Journal of Computational and Graphical Statistics
University of Basel (CH), ETH Zurich (CH), Seminar for Statistics (CH), Lucerne University of Applied Sciences and Arts (CH)
Innosuisse - Schweizerische Agentur für Innovationsförderung
Openalex Percentile: Top 9%
Matrix Theory and Algorithms
4.80
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon