On distributed online convex optimization with sublinear dynamic regret and fit
2021 55th Asilomar conference on signals, systems, and computers, 2021•ieeexplore.ieee.org
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 …
(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 …
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 algorithm, 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, while 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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果