Decentralized Stochastic Non-Convex Optimization Over Weakly Connected Time-Varying Digraphs

This video program is a part of the Premium package:

Decentralized Stochastic Non-Convex Optimization Over Weakly Connected Time-Varying Digraphs


  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

Decentralized Stochastic Non-Convex Optimization Over Weakly Connected Time-Varying Digraphs

0 views
  • Share
In this paper, we consider decentralized stochastic non-convex optimization over a class of weakly connected digraphs. First, we quantify the convergence behaviors of the weight matrices of this type of digraphs. By leveraging the perturbed push sum proto
In this paper, we consider decentralized stochastic non-convex optimization over a class of weakly connected digraphs. First, we quantify the convergence behaviors of the weight matrices of this type of digraphs. By leveraging the perturbed push sum proto