Search Results for author:
Found 4 papers, 0 papers with code
Non-Submodular Maximization via the Greedy Algorithm and the Effects of Limited Information in Multi-Agent Execution
We provide theoretical bounds on the worst case performance of the greedy algorithm in seeking to maximize a normalized, monotone, but not necessarily submodular objective function under a simple partition matroid constraint.
Fully Decentralized, Scalable Gaussian Processes for Multi-Agent Federated Learning
In this paper, we propose decentralized and scalable algorithms for Gaussian process (GP) training and prediction in multi-agent systems.
Wasserstein-Splitting Gaussian Process Regression for Heterogeneous Online Bayesian Inference
Gaussian processes (GPs) are a well-known nonparametric Bayesian inference technique, but they suffer from scalability problems for large sample sizes, and their performance can degrade for non-stationary or spatially heterogeneous data.
Strictly Decentralized Adaptive Estimation of External Fields using Reproducing Kernels
Approximations of the evolution of the ideal local estimate $\hat{g}^i_t$ of agent $i$ is constructed solely using observations made by agent $i$ on a fine time scale.
