Derivative-Free Method For Composite Optimization With Applications To Decentralized Distributed Optimization

Abstract

In this paper, we propose a new method based on the Sliding Algorithm from Lan(2016, 2019) for the convex composite optimization problem that includes two terms: smooth one and non-smooth one. Our method uses the stochastic noised zeroth-order oracle for the non-smooth part and the first-order oracle for the smooth part. To the best of our knowledge, this is the first method in the literature that uses such a mixed oracle for the composite optimization. We prove the convergence rate for the new method that matches the corresponding rate for the first-order method up to a factor proportional to the dimension of the space or, in some cases, its squared logarithm. We apply this method for the decentralized distributed optimization and derive upper bounds for the number of communication rounds for this method that matches known lower bounds. Moreover, our bound for the number of zeroth-order oracle calls per node matches the similar state-of-the-art bound for the first-order decentralized distributed optimization up to to the factor proportional to the dimension of the space or, in some cases, even its squared logarithm.

Cited by in corpus (6)

• Recent theoretical advances in decentralized distributed convex optimization
• Randomized gradient-free methods in convex optimization
• Gradient-Free Methods for Saddle-Point Problem
• One-Point Gradient-Free Methods for Smooth and Non-Smooth Saddle-Point Problems
• New Aspects of Black Box Conditional Gradient: Variance Reduction and One Point Feedback
• One-Point Feedback for Composite Optimization with Applications to Distributed and Federated Learning