Do iterates of the subgradient method converge for nonconvex, nonsmooth objectives?
Yes, for tame/definable functions, covering most ML/AI training objectives. Check out our new preprint https://t.co/gFVKBVAQ2E (w. my PhD student @MingzhiS13149) #nonconvex#optimization
1/3
'A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization', by Junwen Qiu, Xiao Li, Andre Milzarek.
https://t.co/Mt4BSyuFQG
#complexity#iterations#nonconvex
Further updated today:
Title: Geometry and factorization of multivariate Markov chains with applications to MCMC acceleration
arXiv: https://t.co/mv2WOIVHwp
👏👏👏 Much needed and overdue.
A huge personal pain point for me as an opt researcher is that popular constrained opt solvers (cvxpy, gurobi, mosek, etc) require specialized syntax for the constraints and end up moving back to CPU and so can't advantage of GPU matmult... (1/2)
I don't think this book is so well-known since it's only recently been made available but it's got very nice material and illustrations, especially in the set-valued analysis section: https://t.co/rdsPzvoHUq
Junwen Qiu, Bohao Ma, Xiao Li, Andre Milzarek: A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods https://t.co/tiMLJvKHoq https://t.co/J19iIbi8Ld
Junwen Qiu, Andre Milzarek: Random Reshuffling with Momentum for Nonconvex Problems: Iteration Complexity and Last Iterate Convergence https://t.co/0laNxChE1L https://t.co/nmyqZRp1bY