REVIEW 6 cited by
On the Convergence Rate of Stochastic Mirror Descent for Nonsmooth Nonconvex Optimization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
In this paper, we investigate the non-asymptotic stationary convergence behavior of Stochastic Mirror Descent (SMD) for nonconvex optimization. We focus on a general class of nonconvex nonsmooth stochastic optimization problems, in which the objective can be decomposed into a relatively weakly convex function (possibly non-Lipschitz) and a simple non-smooth convex regularizer. We prove that SMD, without the use of mini-batch, is guaranteed to converge to a stationary point in a convergence rate of $ \mathcal{O}(1/\sqrt{t}) $. The efficiency estimate matches with existing results for stochastic subgradient method, but is evaluated under a stronger stationarity measure. Our convergence analysis applies to both the original SMD and its proximal version, as well as the deterministic variants, for solving relatively weakly convex problems.
Forward citations
Cited by 6 Pith papers
-
Non-KKT Accumulation in Entropic Mirror Descent
Shannon-entropic mirror descent admits smooth objectives and bounded nonsummable-step sequences whose boundary accumulation set contains a nonempty arc of non-KKT equilibria.
-
Establishing Boundary KKT Convergence of Mirror Descent through Reparameterization
Under verifiable joint conditions on the objective, the Legendre kernel, and the feasible geometry, mirror descent converges to a boundary KKT point with explicit rates.
-
Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization
An inexact proximal-point penalty algorithm finds ε-stationary points of non-convex constrained problems in O~(ε^{-5/2}) steps with convex constraints and O~(ε^{-3}) to O~(ε^{-4}) steps with non-convex constraints.
-
Stationary Robust Mean-Field Games under Model Mismatches
Develops infinite-horizon stationary robust mean-field games incorporating distributional uncertainty, proves equilibrium existence via fixed-point on contractive Bellman operator, gives convergent algorithm, and deri...
-
Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints
A proximally constrained subgradient method finds a nearly stationary point for weakly convex objectives with weakly convex constraints in O(1/epsilon^4) deterministic and O~(1/epsilon^6) stochastic iterations.
-
Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks
A Chinese Remainder Theorem decomposition plus a penalized mirror descent solver for Min-k-Partition assigns 5G PCIs with near-zero mod-3 and mod-30 interference in experiments.
Discussion (0). Continue with ORCID to comment.