In this letter, we first propose a \underline{Z}eroth-\underline{O}rder c\underline{O}ordinate \underline{M}ethod~(ZOOM) to solve the stochastic optimization problem over a decentralized network with only zeroth-order~(ZO) oracle feedback available. Moreover, we equip a simple mechanism "powerball" to ZOOM and propose ZOOM-PB to accelerate the convergence of ZOOM. Compared with the existing methods, we verify the proposed algorithms through two benchmark examples in the literature, namely the black-box binary classification and the generating adversarial examples from black-box DNNs in order to compare with the existing state-of-the-art centralized and distributed ZO algorithms. The numerical results demonstrate a faster convergence rate of...
Consider a network of $N$ decentralized computing agents collaboratively solving a nonconvex stochas...
In this paper, we focus on the decentralized optimization problem over the Stiefel manifold, which i...
Functionally constrained stochastic optimization problems, where neither the objective function nor ...
In this paper, we propose a distributed stochastic second-order proximal method that enables agents ...
Distributed optimization has a rich history. It has demonstrated its effectiveness in many machine l...
Recently introduced distributed zeroth-order optimization (ZOO) algorithms have shown their utility ...
The non-smooth finite-sum minimization is a fundamental problem in machine learning. This paper deve...
Decentralized optimization, particularly the class of decentralized composite convex optimization (D...
Decentralized optimization algorithms have attracted intensive interests recently, as it has a balan...
We consider decentralized gradient-free optimization of minimizing Lipschitz continuous functions th...
We study a standard distributed optimization framework where N networked nodes collaboratively minim...
Distributed adaptive stochastic gradient methods have been widely used for large-scale nonconvex opt...
This paper considers the decentralized optimization problem of minimizing a finite sum of strongly c...
Decentralized optimization with time-varying networks is an emerging paradigm in machine learning. I...
We develop a novel randomised block coordinate primal-dual algorithm for a class of non-smooth ill-p...
Consider a network of $N$ decentralized computing agents collaboratively solving a nonconvex stochas...
In this paper, we focus on the decentralized optimization problem over the Stiefel manifold, which i...
Functionally constrained stochastic optimization problems, where neither the objective function nor ...
In this paper, we propose a distributed stochastic second-order proximal method that enables agents ...
Distributed optimization has a rich history. It has demonstrated its effectiveness in many machine l...
Recently introduced distributed zeroth-order optimization (ZOO) algorithms have shown their utility ...
The non-smooth finite-sum minimization is a fundamental problem in machine learning. This paper deve...
Decentralized optimization, particularly the class of decentralized composite convex optimization (D...
Decentralized optimization algorithms have attracted intensive interests recently, as it has a balan...
We consider decentralized gradient-free optimization of minimizing Lipschitz continuous functions th...
We study a standard distributed optimization framework where N networked nodes collaboratively minim...
Distributed adaptive stochastic gradient methods have been widely used for large-scale nonconvex opt...
This paper considers the decentralized optimization problem of minimizing a finite sum of strongly c...
Decentralized optimization with time-varying networks is an emerging paradigm in machine learning. I...
We develop a novel randomised block coordinate primal-dual algorithm for a class of non-smooth ill-p...
Consider a network of $N$ decentralized computing agents collaboratively solving a nonconvex stochas...
In this paper, we focus on the decentralized optimization problem over the Stiefel manifold, which i...
Functionally constrained stochastic optimization problems, where neither the objective function nor ...