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

05/01/2021
by   Xinlei Yi, et al.
7

This paper 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 network regret and constraint violation. 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 𝒪(T^max{κ,1-κ}) static network regret and 𝒪(T^1-κ/2) network cumulative constraint violation, where T is the total number of rounds and κ∈(0,1) is a user-defined trade-off parameter. Moreover, if the loss functions are strongly convex, then the static network regret bound can be reduced to 𝒪(T^κ). Finally, numerical simulations are provided to illustrate the effectiveness of the theoretical results.

READ FULL TEXT
research
05/31/2023

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition

This paper considers distributed online convex optimization with adversa...
research
03/06/2019

Distributed Online Convex Optimization with Time-Varying Coupled Inequality Constraints

This paper considers distributed online optimization with time-varying c...
research
12/20/2019

Distributed Online Optimization with Long-Term Constraints

We consider distributed online convex optimization problems, where the d...
research
05/19/2022

Augmented Lagrangian Methods for Time-varying Constrained Online Convex Optimization

In this paper, we consider online convex optimization (OCO) with time-va...
research
02/05/2023

Online Nonstochastic Control with Adversarial and Static Constraints

This paper studies online nonstochastic control problems with adversaria...
research
06/22/2020

Beyond O(√(T)) Regret for Constrained Online Optimization: Gradual Variations and Mirror Prox

We study constrained online convex optimization, where the constraints c...
research
01/24/2023

On Dynamic Regret and Constraint Violations in Constrained Online Convex Optimization

A constrained version of the online convex optimization (OCO) problem is...

Please sign up or login with your details

Forgot password? Click here to reset