Metraipolis › archive › dc_b3d3715bee05

A Factor Graph Approach to Scalable Multi-Output Gaussian Process Regression — arXiv:2608.11917

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11917
License (as archived)
CC0-1.0
Archived
2026-10-19T05:40:00.161Z
SHA-256 of the archived text
833e4d4247250a3785d1627104d39b94c520cf504ed5b9b7ad8f71308489ba0e
Stable URL of this page
https://metraipolis.com/documento/dc_b3d3715bee05

How to cite

A Factor Graph Approach to Scalable Multi-Output Gaussian Process Regression — arXiv:2608.11917 — arXiv (en), https://arxiv.org/abs/2608.11917 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b3d3715bee05 (Metraipolis archive dc_b3d3715bee05, sha256 833e4d4247250a3785d1627104d39b94c520cf504ed5b9b7ad8f71308489ba0e)
BibTeX
@misc{dcb3d3715bee05,
  title = {A Factor Graph Approach to Scalable Multi-Output Gaussian Process Regression — arXiv:2608.11917},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11917},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b3d3715bee05; sha256 833e4d4247250a3785d1627104d39b94c520cf504ed5b9b7ad8f71308489ba0e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11917. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Multi-output Gaussian process regression scales cubically in the number of observations times outputs, and dense kernel-matrix methods need bespoke handling whenever different outputs are observed at different inputs. We express multi-output Gaussian process regression as a Forney-style factor graph in which a nearest-neighbor chain orders a fixed candidate set of $C$ inputs into a one-dimensional sequence. Along this chain, latent Matérn processes evolve through linear-Gaussian transition factors, while the linear model of coregionalization mixes $L$ latent processes into $D$ outputs through a deterministic mixing factor and per-output scalar observation factors. Posterior computation reduces to exact Gaussian message passing on the chain at cost $\mathcal{O}(C(DL^2 + L^3))$ after chain construction, and missing observations omit their local factor without any covariance-matrix restructuring. The formulation therefore scales in the number of data samples and in the rate of missing observations, while remaining best suited to candidate sets in low input dimension. We compare the factor-graph formulation against an exact kernel-matrix baseline, a sparse-variational inducing-point baseline, and a nearest-neighbor baseline on a synthetic input-dimension sweep and on electricity time series forecasting. At low input dimension the factor-graph posterior tracks the exact kernel-matrix posterior closely, and the gap grows gradually as input dimension increases while staying competitive with both approximate baselines. On the electricity time series our factor-graph formulation matches all three baselines in forecast accuracy while scaling linearly in the number of data points, where the exact kernel-matrix method becomes infeasible and the inducing-point baseline remains substantially slower.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-13 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.11917 — 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-10-19T05:18:32.497Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).