Proves almost sure convergence and finite-time sample complexity bounds for stochastic mirror descent under iterate-dependent Markov noise for both convex and non-convex objectives.
NAGURNEY ANDD
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
-
Stochastic Mirror Descent under Iterate-Dependent Markov Noise: Analysis in the Asymptotic and Finite Time Regimes
Proves almost sure convergence and finite-time sample complexity bounds for stochastic mirror descent under iterate-dependent Markov noise for both convex and non-convex objectives.