Metraipolis › archive › dc_59d43be2268a
Efficient Deep Gaussian Process Surrogates via Mini-Batch Latent MAP Estimation — arXiv:2610.38038
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.38038
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:26:52.445Z
- SHA-256 of the archived text
3a6f58d187039773f448bafd9789a4d3efa8cce6ffebdddfc943bc42175e2ee0- Stable URL of this page
https://metraipolis.com/documento/dc_59d43be2268a
How to cite
Efficient Deep Gaussian Process Surrogates via Mini-Batch Latent MAP Estimation — arXiv:2610.38038 — arXiv (en), https://arxiv.org/abs/2610.38038 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_59d43be2268a (Metraipolis archive dc_59d43be2268a, sha256 3a6f58d187039773f448bafd9789a4d3efa8cce6ffebdddfc943bc42175e2ee0)
BibTeX
@misc{dc59d43be2268a,
title = {Efficient Deep Gaussian Process Surrogates via Mini-Batch Latent MAP Estimation — arXiv:2610.38038},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.38038},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_59d43be2268a; sha256 3a6f58d187039773f448bafd9789a4d3efa8cce6ffebdddfc943bc42175e2ee0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38038. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Deep Gaussian processes (DGPs) are flexible surrogate models for computer experiments with nonstationary response surfaces, but inference over their latent representations remains computationally challenging. Existing methods typically rely on variational inference or Markov chain Monte Carlo (MCMC), which impose variational-family assumptions or require costly posterior sampling. We propose the latent maximum-a-posteriori deep Gaussian process (LaMP-DGP), which uses gradient-based optimization to obtain MAP estimates of the latent representations and enables efficient probabilistic prediction through linked-GP calculations. To scale LaMP-DGP to large datasets, we develop a mini-batch optimization algorithm and, under a polynomial mini-batch bias-decay condition, establish a stationarity bound for latent-state optimization that motivates a growing batch-size schedule. Across numerical experiments and real-data analyses, LaMP-DGP provides consistently competitive predictive performance relative to doubly stochastic variational inference, stochastic gradient Hamiltonian Monte Carlo, and fully Bayesian Vecchia DGP inference. Computationally, LaMP-DGP is substantially faster than the Vecchia MCMC approach while remaining broadly competitive with the stochastic-gradient alternatives. These results position LaMP-DGP as a competitive and computationally efficient alternative for DGP inference. An R package, "LaMPDGP", is available for implementing the proposed method. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.38038 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-01T02:12:44.241Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).