TL;DR
This paper introduces scalable distributed Gaussian process estimation methods for multi-agent systems using finite-dimensional approximations, reducing computational and communication costs while maintaining accuracy.
Contribution
It proposes two novel suboptimal approaches based on eigenfunction approximations, with probabilistic bounds and adaptive tuning strategies for efficient distributed Gaussian regression.
Findings
Methods scale with eigenfunction dimension E, not total data M.
Probabilistic bounds guide desired estimation accuracy.
Algorithms validated on synthetic and real data.
Abstract
We consider the problem of distributedly estimating Gaussian processes in multi-agent frameworks. Each agent collects few measurements and aims to collaboratively reconstruct a common estimate based on all data. Agents are assumed with limited computational and communication capabilities and to gather noisy measurements in total on input locations independently drawn from a known common probability density. The optimal solution would require agents to exchange all the input locations and measurements and then invert an matrix, a non-scalable task. Differently, we propose two suboptimal approaches using the first orthonormal eigenfunctions obtained from the \ac{KL} expansion of the chosen kernel, where typically . The benefits are that the computation and communication complexities scale with and not with , and computing the required statistics…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
