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
The paper presents an online algorithm that achieves the same $0.401$ approximation factor for maximizing nonnegative, non-monotone DR-submodular functions over compact convex down-closed subsets of the $d$-dimensional unit cube as the best known offline construction. In the full-information value-oracle model, the algorithm attains this factor with sublinear regret, using $O(dT^{1/4})$ oracle calls per round and $O(T^{3/4})$ regret, and offers flexible batching trade-offs. Under a positive-anchor condition, a randomized blocking strategy preserves the $0.401$ factor while achieving $O(T^{5/6})$ one-point bandit regret.
By Vaneet Aggarwal, Yiyang Lu
arXiv:2602. 20578v2 Announce Type: replace Abstract: We study online maximization of non-monotone Diminishing-Return(DR)-submodular functions over down-closed convex sets, a regime where existing projection-free online methods suffer from suboptimal regret and limited feedback guarantees.
By Yiyang Lu, Haresh Jadav, Mohammad Pedramfar, Ranveer Singh, Vaneet Aggarwal
arXiv:2603. 27803v2 Announce Type: replace Abstract: We provide a distributed online algorithm for multi-agent submodular maximization under communication delays.
By Zirui Xu, Vasileios Tzoumas
arXiv:2608. 12134v1 Announce Type: cross Abstract: We study nonnegative submodular maximization subject to a general matroid when the offline algorithm is given an arbitrary controlled value oracle.
By Vaneet Aggarwal
arXiv:2607. 01665v1 Announce Type: new Abstract: Decentralized online convex optimization (D-OCO) is a popular framework for distributed applications with streaming data.
By Hao Zhou, Xiaoyu Wang, Chang Yao, Mingli Song, Yuanyu Wan
arXiv:2502. 16744v3 Announce Type: replace Abstract: In adversarial Constrained Online Convex Optimization (COCO), a learner selects actions from a fixed convex set while seeking both low regret and low cumulative constraint violation (CCV) under time-varying constraints.
By Yiyang Lu, Mohammad Pedramfar, Mengbo Wang, Vaneet Aggarwal
arXiv:2409. 19279v2 Announce Type: replace-cross Abstract: Continuous-time models can reveal accelerated structures in distributed optimization, but their rates need not survive direct discretization.
By Kushal Chakrabarti, Mayank Baranwal
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:2608.12134v2 Announce Type: replace-cross
Abstract: We study nonnegative submodular maximization on $n$ elements subject to a general matroid of rank $k$, when the offline algorithm is given an...
By Vaneet Aggarwal
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:2507. 09473v2 Announce Type: replace-cross Abstract: We study the dynamic allocation of indivisible resources to strategic agents under long-term constraints, where the planner aims to maximize social welfare, satisfy multiple constraints, and elicit near-truthful reports.
By Yan Dai, Negin Golrezaei, Patrick Jaillet