Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research advances the computational efficiency of mixed-effects models by replacing standard Cholesky decompositions with scalable Krylov subspace methods, offering significant speedups for high-dimensional crossed random effects. The work provides critical theoretical and empirical validation for stochastic Lanczos quadrature and conjugate gradient approaches, directly addressing bottlenecks in large-scale statistical modeling workflows.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

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

arXiv2 min read

arXiv:2505.09552v4 Announce Type: replace-cross 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.

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.

Methodology (stat.ME); Machine Learning (cs.LG); Machine Learning (stat.ML)

arXiv:2505.09552 [stat.ME]

(or arXiv:2505.09552v4 [stat.ME] for this version)

https://doi.org/10.48550/arXiv.2505.09552 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 216 words

Related coverage