arXiv Machine Learning By Zirui Xu, Vasileios Tzoumas

Distributed Online Submodular Maximization under Communication Delays: A Simultaneous Decision-Making Approach

Read the original on arXiv Machine Learning →

arXiv:2603. 27803v2 Announce Type: replace Abstract: We provide a distributed online algorithm for multi-agent submodular maximization under communication delays.

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.

arXiv Machine Learning
Jun 5

Multi-Agent Lipschitz Bandits

arXiv:2602. 16965v2 Announce Type: replace Abstract: We study the decentralized multi-player stochastic bandit problem over a continuous, Lipschitz-structured action space where hard collisions yield zero reward.

By Sourav Chakraborty, Amit Kiran Rege, Claire Monteleoni, Lijun Chen
arXiv Machine Learning
Jul 2

Distributed Online Bandit Submodular Maximization with Bounded Sampling Violations

arXiv:2607. 00680v1 Announce Type: new Abstract: We study distributed online submodular maximization under partition matroid constraints, in which multiple agents select a limited number of actions from their own subsets sequentially to maximize the cumulative value of a sequence of objective functions.

By Bin Du, Chang Liu, Dingqi Zhu, Lintao Ye, Dengfeng Sun
arXiv AI
Sep 1

Dec-BFTRL: Squre-Root Regret for Decentralized Online Upper-Linearizable Optimization under Separation Access with Application to Continuous Submodular Maximization

The paper introduces Dec-BFTRL, a decentralized algorithm for online optimization of upper-linearizable payoffs with efficient separation access, targeting continuous diminishing-return submodular maximization. Each agent evaluates its action against the average of local objectives, projects via an approximate gauge, exchanges a cumulative surrogate-gradient dual state, and uses a local HybridNewton step to minimize its BFTRL potential. The method achieves an expected network-aggregate regret of “~O(√T)” while requiring T neighbor-mixing steps and ~O(T) separation-oracle calls per agent, and provides four wrapper instantiations for three DR-submodular problems.

By Yiyang Lu, Mohammad Pedramfar, Vaneet Aggarwal