SubMAPG uses a new Partition Multilinear Extension to derive unbiased policy gradients from submodular difference rewards, delivering 1/2-approximation and sublinear dynamic regret for online distributed task allocation in open multi-agent systems.
Foundations and Trends in Optimization , volume=
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Two novel online conformal prediction algorithms enforce nested prediction sets across coverage levels using online optimization with regret bounds for quantile error control.
FedSEA achieves O(sqrt(T)) regret for smooth convex losses and O(log T) for smooth strongly convex losses in federated online learning under stochastic adversary, with parallelization benefits when temporal heterogeneity is mild relative to gradient noise.
A projection-based algorithm for COCO achieves O(log T) regret and O(log T) CCV for strongly convex losses and O(sqrt(T)) for convex losses by leveraging self-contracted curves.
citing papers explorer
-
Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
SubMAPG uses a new Partition Multilinear Extension to derive unbiased policy gradients from submodular difference rewards, delivering 1/2-approximation and sublinear dynamic regret for online distributed task allocation in open multi-agent systems.
-
Online Conformal Prediction: Enforcing monotonicity via Online Optimization
Two novel online conformal prediction algorithms enforce nested prediction sets across coverage levels using online optimization with regret bounds for quantile error control.
-
FedSEA: Achieving Benefit of Parallelization in Federated Online Learning
FedSEA achieves O(sqrt(T)) regret for smooth convex losses and O(log T) for smooth strongly convex losses in federated online learning under stochastic adversary, with parallelization benefits when temporal heterogeneity is mild relative to gradient noise.
-
Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction
A projection-based algorithm for COCO achieves O(log T) regret and O(log T) CCV for strongly convex losses and O(sqrt(T)) for convex losses by leveraging self-contracted curves.