Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization

This article considers the distributed online convex optimization problem with time-varying constraints over a network of agents. This is a sequential decision making problem with two sequences of arbitrarily varying convex loss and constraint functions. At each round, each agent selects a decision from the decision set, and then only a portion of the loss function and a coordinate block of the constraint function at this round are privately revealed to this agent. The goal of the network is to minimize the network-wide loss accumulated over time. Two distributed online algorithms with full-information and bandit feedback are proposed. Both dynamic and static network regret bounds are analyzed for the proposed algorithms, and network cumulative constraint violation is used to measure constraint violation, which excludes the situation that strictly feasible constraints can compensate the effects of violated constraints. In particular, we show that the proposed algorithms achieve O(T-max{k, 1-k.}) static network regret and O (T1-k/2) network cumulative constraint violation, where T is the time horizon and.k epsilon (0, 1) is a user-defined tradeoff parameter. Moreover, if the loss functions are strongly convex, then the static network regret bound can be reduced to O(T-k). Finally, numerical simulations are provided to illustrate the effectiveness of the theoretical results.

Automated summary

This article discusses the problem of distributed online convex optimization with time-varying constraints over a network of agents. Two distributed online algorithms with full-information and bandit feedback are proposed. Network-wide loss and network cumulative constraint violation are used as measures, and theoretical analyses show the effectiveness of the proposed algorithms. Numerical simulations are provided to illustrate the results.