Online covariance estimation for stochastic gradient descent under Markovian sampling
Abhishek Roy, Krishnakumar Balasubramanian

TL;DR
This paper develops and analyzes an online covariance estimator for SGD under Markovian sampling, achieving convergence rates comparable to i.i.d. data and addressing complex dependencies.
Contribution
It introduces a novel covariance estimation method for SGD with Markovian data and establishes its convergence rates, including for higher moments, overcoming significant analytical challenges.
Findings
Convergence rates match those for i.i.d. data.
Effective covariance estimation under Markovian sampling.
Application to strategic classification with adaptive adversaries.
Abstract
We investigate the online overlapping batch-means covariance estimator for Stochastic Gradient Descent (SGD) under Markovian sampling. Convergence rates of order and are established under state-dependent and state-independent Markovian sampling, respectively, where is the dimensionality and denotes observations or SGD iterations. These rates match the best-known convergence rate for independent and identically distributed (i.i.d) data. Our analysis overcomes significant challenges that arise due to Markovian sampling, leading to the introduction of additional error terms and complex dependencies between the blocks of the batch-means covariance estimator. Moreover, we establish the convergence rate for the first four moments of the norm of the error of SGD dynamics under state-dependent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Privacy-Preserving Technologies in Data · Machine Learning and Algorithms
MethodsStochastic Gradient Descent · Logistic Regression
