A one-sample decentralized proximal algorithm for non-convex stochastic composite optimization.
Tesi XiaoXuxing ChenKrishnakumar BalasubramanianSaeed GhadimiPublished in: UAI (2023)
Keyphrases
- optimization algorithm
- learning algorithm
- optimal solution
- computational complexity
- globally optimal
- monte carlo
- computational cost
- detection algorithm
- segmentation algorithm
- alternating optimization
- constrained optimization
- convex hull
- linear programming
- worst case
- dynamic programming
- np hard
- cost function
- preprocessing
- simulated annealing
- probabilistic model
- matching algorithm
- optimization method
- global optimization
- k means
- stochastic gradient