Det-CGD: Compressed Gradient Descent with Matrix Stepsizes for Non-Convex Optimization
This paper introduces a new method for minimizing matrix-smooth non-convex objectives through the use of novel Compressed Gradient Descent (CGD) algorithms enhanced with a matrix-valued stepsize. The proposed algorithms are theoretically analyzed first in the single-node and subsequently in the dis…