← Back to all news
arXiv Machine Learning By Zewen Yang, Xiaobing Dai, Zhenxiao Yin, Hang Zhao, Zhijun Li, C. C. Chan

COIN-GP: Cooperative Online Learning in Networked Distributed Systems with Partial Measurements via Gaussian Process Regression

Read the original on arXiv Machine Learning →

The paper introduces COIN-GP, an observer‑based cooperative learning framework for distributed sensor networks that jointly estimates system states and partially unknown dynamics using online distributed Gaussian Process regression. It addresses challenges of incomplete state observations and deficient GP models by proposing a novel data collection strategy with theoretical feasibility conditions. The authors also derive an error upper bound for both state and model estimation and demonstrate through simulations that COIN‑GP outperforms existing distributed GP‑based methods.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

Hugging Face Trending Papers
Sep 17

COIN-GP: Cooperative Online Learning in Networked Distributed Systems with Partial Measurements via Gaussian Process Regression

The paper introduces COIN-GP, an observer‑based dynamic cooperative learning framework for distributed sensor networks that jointly estimates system states and partially unknown dynamics when only partial state observations are available. It employs online distributed Gaussian Process regression and a novel data‑collection strategy with theoretical feasibility conditions, and derives an error upper bound that combines state and model estimation errors. Simulations show that COIN‑GP outperforms existing distributed GP‑based methods.

More like this →
arXiv Machine Learning
Sep 24

Resource-Efficient Distributed Recursive Gaussian Processes

The paper introduces two distributed recursive Gaussian process algorithms, ADMM‑RGP and PDMM‑RGP, designed for multi‑output regression in multi‑agent systems. It analyzes their stability and convergence, proposes parameter selection strategies to speed up convergence, and demonstrates that the methods reduce communication overhead while preserving estimation accuracy and consensus. Experiments on a real‑world wind dataset confirm the algorithms’ effectiveness across different communication graph connectivities.

By Josephine King, Ali Emre Balci, Raj Thilak Rajan
agents
More like this →
arXiv AI
Jun 30

Learning to Distributedly Estimate under Partially Known Dynamics: A Covariance-Agnostic Neural Kalman Consensus Filter

arXiv:2606. 28441v1 Announce Type: cross Abstract: Online latent state estimation constitutes a fundamental challenge within the artificial intelligence field, serving as a foundational tool for diverse applications, including sequential decision making, anomaly and change-point detection.

By George Stamatelis, Kyriakos Stylianopoulos, George C. Alexandropoulos
agents
More like this →
arXiv Machine Learning
Sep 18

Personalized Federated Hierarchical Gaussian Processes for Privacy-Preserving Modeling of Heterogeneous Distributed Systems

The paper introduces Personalized Federated Hierarchical Gaussian Processes (pFedHGP), a method for probabilistic regression and classification on data distributed across heterogeneous clients. Each client’s latent function is split into a shared global component, a client‑specific deviation that shares the global kernel, and a flexible local residual. Using sparse inducing‑variable approximations and federated variational inference, raw data remain local while the server exchanges only low‑dimensional statistics, enabling full predictive distributions for uncertainty‑aware decisions. In experiments, pFedHGP achieves perfect fault classification in press tonnage monitoring with only 13.77% of labeled cycles and accurately recovers geographic zones in federated air‑quality modeling without centralizing station‑level time series.

By Xianjian Xie, Hao Yan
safety
More like this →