English

Robust, Online, and Adaptive Decentralized Gaussian Processes

Machine Learning 2025-09-23 v1 Machine Learning Multiagent Systems Signal Processing

Abstract

Gaussian processes (GPs) offer a flexible, uncertainty-aware framework for modeling complex signals, but scale cubically with data, assume static targets, and are brittle to outliers, limiting their applicability in large-scale problems with dynamic and noisy environments. Recent work introduced decentralized random Fourier feature Gaussian processes (DRFGP), an online and distributed algorithm that casts GPs in an information-filter form, enabling exact sequential inference and fully distributed computation without reliance on a fusion center. In this paper, we extend DRFGP along two key directions: first, by introducing a robust-filtering update that downweights the impact of atypical observations; and second, by incorporating a dynamic adaptation mechanism that adapts to time-varying functions. The resulting algorithm retains the recursive information-filter structure while enhancing stability and accuracy. We demonstrate its effectiveness on a large-scale Earth system application, underscoring its potential for in-situ modeling.

Keywords

Cite

@article{arxiv.2509.18011,
  title  = {Robust, Online, and Adaptive Decentralized Gaussian Processes},
  author = {Fernando Llorente and Daniel Waxman and Sanket Jantre and Nathan M. Urban and Susan E. Minkoff},
  journal= {arXiv preprint arXiv:2509.18011},
  year   = {2025}
}

Comments

Submitted to Icassp 2026 Special Session on "Bridging Signal Processing and Machine Learning with Gaussian Processes."

R2 v1 2026-07-01T05:50:00.556Z