A smoothing stochastic gradient descent algorithm is introduced for non-smooth stochastic compositional optimization, achieving 1/T^{1/4} rate for convex cases and similar guarantees under other convexity settings.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Non-smooth stochastic gradient descent using smoothing functions
A smoothing stochastic gradient descent algorithm is introduced for non-smooth stochastic compositional optimization, achieving 1/T^{1/4} rate for convex cases and similar guarantees under other convexity settings.