Develops randomized-subspace Nesterov accelerated gradient methods with accelerated oracle-complexity guarantees for smooth convex optimization under matrix smoothness and sketch moment assumptions.
Smoothness matrices beat smoothness constants: Better communication compression techniques for distributed optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Randomized Subspace Nesterov Accelerated Gradient
Develops randomized-subspace Nesterov accelerated gradient methods with accelerated oracle-complexity guarantees for smooth convex optimization under matrix smoothness and sketch moment assumptions.