On Distributed Online Convex Optimization with Sublinear Dynamic Regret and Fit

by   Pranay Sharma, et al.

In this work, we consider a distributed online convex optimization problem, with time-varying (potentially adversarial) constraints. A set of nodes, jointly aim to minimize a global objective function, which is the sum of local convex functions. The objective and constraint functions are revealed locally to the nodes, at each time, after taking an action. Naturally, the constraints cannot be instantaneously satisfied. Therefore, we reformulate the problem to satisfy these constraints in the long term. To this end, we propose a distributed primal-dual mirror descent based approach, in which the primal and dual updates are carried out locally at all the nodes. This is followed by sharing and mixing of the primal variables by the local nodes via communication with the immediate neighbors. To quantify the performance of the proposed algorithm, we utilize the challenging, but more realistic metrics of dynamic regret and fit. Dynamic regret measures the cumulative loss incurred by the algorithm, compared to the best dynamic strategy. On the other hand, fit measures the long term cumulative constraint violations. Without assuming the restrictive Slater's conditions, we show that the proposed algorithm achieves sublinear regret and fit under mild, commonly used assumptions.


Distributed Online Convex Optimization with Time-Varying Coupled Inequality Constraints

This paper considers distributed online optimization with time-varying c...

Simultaneously Achieving Sublinear Regret and Constraint Violations for Online Convex Optimization with Time-varying Constraints

In this paper, we develop a novel virtual-queue-based online algorithm f...

Online Saddle Point Problem with Applications to Constrained Online Convex Optimization

We study an online saddle point problem where at each iteration a pair o...

An Online Convex Optimization Approach to Dynamic Network Resource Allocation

Existing approaches to online convex optimization (OCO) make sequential ...

Projection-Free Online Convex Optimization with Stochastic Constraints

This paper develops projection-free algorithms for online convex optimiz...

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

This paper studies the problem of online performance optimization of con...

Lazy Lagrangians with Predictions for Online Learning

We consider the general problem of online convex optimization with time-...

Please sign up or login with your details

Forgot password? Click here to reset