Matthias Katzfuss
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Matthias Katzfuss has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
Joseph Guinness
Department of Statistics and Data Science, Washington University in St. Louis, MO 63130 USA
8 shared publicationsFlorian Schäfer
School of Computational Science and Engineering Georgia Institute of Technology
4 shared publications- Binayak Prasad Mohanty
Biological and Agricultural Engineering Texas A&M University College Station TX USA
3 shared publications Daniel Zilber
Department of Statistics, Texas A&M University, College Station, USA
3 shared publications- Dhruva Kathuria
Biological and Agricultural Engineering Texas A&M University College Station TX USA
3 shared publications Jian Cao
Department of Statistics and Institute of Data Science, Texas A &M University, College Station, USA
3 shared publications
Latest Publications
- 7 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Data Science
- Vol. 5 (3) , 261-277
Fast Gaussian Process Approximations for Autocorrelated Data
This paper is concerned with the problem of how to speed up computation for Gaussian process models trained on autocorrelated data. The Gaussian process model is a powerful tool commonly used in nonlinear regression applications. Standard regression modeling assumes random samples and an independently, identically distributed noise. Various fast approximations that speed up Gaussian process regression work under this standard setting. But for autocorrelated data, failing to account for autocorrelation leads to a phenomenon known as temporal overfitting that deteriorates model performance on new test instances. To handle autocorrelated data, existing fast Gaussian process approximations have to be modified; one such approach is to segment the originally correlated data points into blocks in which the blocked data are de-correlated. This work explains how to make some of the existing Gaussian process approximations work with blocked data. Numerical experiments across diverse application data sets demonstrate that the proposed approaches can remarkably accelerate computation for Gaussian process regression on autocorrelated data without compromising model prediction performance. History: Bianca Colosimo served as the senior editor for this article. Funding: Y. Ding received partial support from the National Science Foundation (NSF) [Grant CNS–2328395]. M. Katzfuss received partial support from the NSF [Grant DMS–1953005] and by the Office of the Vice Chancellor for Research and Graduate Education at the University of Wisconsin–Madison with funding from the Wisconsin Alumni Research Foundation. A. Chokhachian’s research was sponsored by the Ocean Energy Safety Institute Consortium (OESIC) through a grant from the U.S. Department of the Interior, Bureau of Safety and Environmental Enforcement (BSEE), and the U.S. Department of Energy (DOE) and was accomplished under Agreement Number E21AC00000.
- 7 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Data Science
- Vol. 5 (3) , 261-277
Fast Gaussian Process Approximations for Autocorrelated Data
This paper is concerned with the problem of how to speed up computation for Gaussian process models trained on autocorrelated data. The Gaussian process model is a powerful tool commonly used in nonlinear regression applications. Standard regression modeling assumes random samples and an independently, identically distributed noise. Various fast approximations that speed up Gaussian process regression work under this standard setting. But for autocorrelated data, failing to account for autocorrelation leads to a phenomenon known as temporal overfitting that deteriorates model performance on new test instances. To handle autocorrelated data, existing fast Gaussian process approximations have to be modified; one such approach is to segment the originally correlated data points into blocks in which the blocked data are de-correlated. This work explains how to make some of the existing Gaussian process approximations work with blocked data. Numerical experiments across diverse application data sets demonstrate that the proposed approaches can remarkably accelerate computation for Gaussian process regression on autocorrelated data without compromising model prediction performance. History: Bianca Colosimo served as the senior editor for this article. Funding: Y. Ding received partial support from the National Science Foundation (NSF) [Grant CNS–2328395]. M. Katzfuss received partial support from the NSF [Grant DMS–1953005] and by the Office of the Vice Chancellor for Research and Graduate Education at the University of Wisconsin–Madison with funding from the Wisconsin Alumni Research Foundation. A. Chokhachian’s research was sponsored by the Ocean Energy Safety Institute Consortium (OESIC) through a grant from the U.S. Department of the Interior, Bureau of Safety and Environmental Enforcement (BSEE), and the U.S. Department of Energy (DOE) and was accomplished under Agreement Number E21AC00000.
- 17 September 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM/ASA Journal on Uncertainty Quantification
- Vol. 13 (3) , 1649-1679
Sparse Inverse Cholesky Factorization of Dense Kernel Matrices by Greedy Conditional Selection
Dense kernel matrices resulting from pairwise evaluations of a kernel function arise naturally in machine learning and statistics. Previous work in constructing sparse approximate inverse Cholesky factors of such matrices by minimizing Kullback–Leibler divergence recovers the Vecchia approximation for Gaussian processes. These methods rely only on the geometry of the evaluation points to construct the sparsity pattern. In this work, we instead construct the sparsity pattern by leveraging a greedy selection algorithm that maximizes mutual information with target points, conditional on all points previously selected. For selecting [Formula: see text] points out of [Formula: see text], the naive time complexity is [Formula: see text], but by maintaining a partial Cholesky factor we reduce this to [Formula: see text]. Furthermore, for multiple ([Formula: see text]) targets we achieve a time complexity of [Formula: see text], which is maintained in the setting of aggregated Cholesky factorization where a selected point need not condition every target. We apply the selection algorithm to image classification and recovery of sparse Cholesky factors. By minimizing Kullback–Leibler divergence, we apply the algorithm to Cholesky factorization, Gaussian process regression, and preconditioning the conjugate gradient method, improving over [Formula: see text]-nearest neighbors selection.
- 17 September 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM/ASA Journal on Uncertainty Quantification
- Vol. 13 (3) , 1649-1679
Sparse Inverse Cholesky Factorization of Dense Kernel Matrices by Greedy Conditional Selection
Dense kernel matrices resulting from pairwise evaluations of a kernel function arise naturally in machine learning and statistics. Previous work in constructing sparse approximate inverse Cholesky factors of such matrices by minimizing Kullback–Leibler divergence recovers the Vecchia approximation for Gaussian processes. These methods rely only on the geometry of the evaluation points to construct the sparsity pattern. In this work, we instead construct the sparsity pattern by leveraging a greedy selection algorithm that maximizes mutual information with target points, conditional on all points previously selected. For selecting [Formula: see text] points out of [Formula: see text], the naive time complexity is [Formula: see text], but by maintaining a partial Cholesky factor we reduce this to [Formula: see text]. Furthermore, for multiple ([Formula: see text]) targets we achieve a time complexity of [Formula: see text], which is maintained in the setting of aggregated Cholesky factorization where a selected point need not condition every target. We apply the selection algorithm to image classification and recovery of sparse Cholesky factors. By minimizing Kullback–Leibler divergence, we apply the algorithm to Cholesky factorization, Gaussian process regression, and preconditioning the conjugate gradient method, improving over [Formula: see text]-nearest neighbors selection.
- Open Access
- 23 June 2025
- Published by Wiley in ESS Open Archive
Probabilistic Hydroclimate Emulation with a Digital Twin Technology for Land Surface Model Ensembles
- 23 June 2025
- Published by Wiley in ESS Open Archive
Open AccessProbabilistic Hydroclimate Emulation with a Digital Twin Technology for Land Surface Model Ensembles
- 22 March 2025
- Published by Springer Nature in Journal of Agricultural, Biological and Environmental Statistics
- Vol. 31 (3) , 1-19
Learning Non-Gaussian Spatial Distributions Via Bayesian Transport Maps with Parametric Shrinkage
- 22 March 2025
- Published by Springer Nature in Journal of Agricultural, Biological and Environmental Statistics
- Vol. 31 (3) , 1-19
Learning Non-Gaussian Spatial Distributions Via Bayesian Transport Maps with Parametric Shrinkage
- 5 February 2025
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 34 (4) , 1226-1239
Nonstationary Spatial Modeling of Massive Global Satellite Data
- 5 February 2025
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 34 (4) , 1226-1239
Nonstationary Spatial Modeling of Massive Global Satellite Data
- Open Access
Asymptotic properties of Vecchia approximation for Gaussian processes
Vecchia approximation has been widely used to accurately scale Gaussian-process (GP) inference to large datasets, by expressing the joint density as a product of conditional densities with small conditioning sets. We study fixed-domain asymptotic properties of Vecchia-based GP inference for a large class of covariance functions (including Matérn covariances) with boundary conditioning. In this setting, we establish that consistency and asymptotic normality of maximum exact-likelihood estimators imply those of maximum Vecchia-likelihood estimators, and that exact GP prediction can be approximated accurately by Vecchia GP prediction, given that the size of conditioning sets grows polylogarithmically with the data size. Hence, Vecchia-based inference with quasilinear complexity is asymptotically equivalent to exact GP inference with cubic complexity. This also provides a general new result on the screening effect. Our findings are illustrated by numerical experiments, which also show that Vecchia approximation can be more accurate than alternative approaches such as covariance tapering and reduced-rank approximations.
Open AccessAsymptotic properties of Vecchia approximation for Gaussian processes
Vecchia approximation has been widely used to accurately scale Gaussian-process (GP) inference to large datasets, by expressing the joint density as a product of conditional densities with small conditioning sets. We study fixed-domain asymptotic properties of Vecchia-based GP inference for a large class of covariance functions (including Matérn covariances) with boundary conditioning. In this setting, we establish that consistency and asymptotic normality of maximum exact-likelihood estimators imply those of maximum Vecchia-likelihood estimators, and that exact GP prediction can be approximated accurately by Vecchia GP prediction, given that the size of conditioning sets grows polylogarithmically with the data size. Hence, Vecchia-based inference with quasilinear complexity is asymptotically equivalent to exact GP inference with cubic complexity. This also provides a general new result on the screening effect. Our findings are illustrated by numerical experiments, which also show that Vecchia approximation can be more accurate than alternative approaches such as covariance tapering and reduced-rank approximations.
- Open Access
Bayesian nonparametric generative modeling of large multivariate non-Gaussian spatial fields
Multivariate spatial fields are of interest in many applications, including climate model emulation. Not only can the marginal spatial fields be subject to nonstationarity, but the dependence structure among the marginal fields and between the fields might also differ substantially. Extending a recently proposed Bayesian approach to describe the distribution of a nonstationary univariate spatial field using a triangular transport map, we cast the inference problem for a multivariate spatial field for a small number of replicates into a series of independent Gaussian process (GP) regression tasks with Gaussian errors. Due to the potential nonlinearity in the conditional means, the joint distribution modeled can be non-Gaussian. The resulting nonparametric Bayesian methodology scales well to high-dimensional spatial fields. It is especially useful when only a few training samples are available, because it employs regularization priors and quantifies uncertainty. Inference is conducted in an empirical Bayes setting by a highly scalable stochastic gradient approach. The implementation benefits from mini-batching and could be accelerated with parallel computing. We illustrate the extended transport-map model by studying hydrological variables from non-Gaussian climate-model output.
Open AccessBayesian nonparametric generative modeling of large multivariate non-Gaussian spatial fields
Multivariate spatial fields are of interest in many applications, including climate model emulation. Not only can the marginal spatial fields be subject to nonstationarity, but the dependence structure among the marginal fields and between the fields might also differ substantially. Extending a recently proposed Bayesian approach to describe the distribution of a nonstationary univariate spatial field using a triangular transport map, we cast the inference problem for a multivariate spatial field for a small number of replicates into a series of independent Gaussian process (GP) regression tasks with Gaussian errors. Due to the potential nonlinearity in the conditional means, the joint distribution modeled can be non-Gaussian. The resulting nonparametric Bayesian methodology scales well to high-dimensional spatial fields. It is especially useful when only a few training samples are available, because it employs regularization priors and quantifies uncertainty. Inference is conducted in an empirical Bayes setting by a highly scalable stochastic gradient approach. The implementation benefits from mini-batching and could be accelerated with parallel computing. We illustrate the extended transport-map model by studying hydrological variables from non-Gaussian climate-model output.
- 9 November 2023
- Published by Springer Nature in Journal of Agricultural, Biological and Environmental Statistics
- Vol. 28 (4) , 597-617
Bayesian Nonparametric Generative Modeling of Large Multivariate Non-Gaussian Spatial Fields
- 9 November 2023
- Published by Springer Nature in Journal of Agricultural, Biological and Environmental Statistics
- Vol. 28 (4) , 597-617
Bayesian Nonparametric Generative Modeling of Large Multivariate Non-Gaussian Spatial Fields
- 8 October 2023
- Published by Springer Nature in Journal of Agricultural, Biological and Environmental Statistics
- Vol. 29 (2) , 212-231
Locally Anisotropic Nonstationary Covariance Functions on the Sphere
- 8 October 2023
- Published by Springer Nature in Journal of Agricultural, Biological and Environmental Statistics
- Vol. 29 (2) , 212-231
Locally Anisotropic Nonstationary Covariance Functions on the Sphere