REVIEW 3 cited by
Online covariance estimation for stochastic gradient descent under Markovian sampling
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
abstract
We investigate the online overlapping batch-means covariance estimator for Stochastic Gradient Descent (SGD) under Markovian sampling. Convergence rates of order $O\big(\sqrt{d}\,n^{-1/8}(\log n)^{1/4}\big)$ and $O\big(\sqrt{d}\,n^{-1/8}\big)$ are established under state-dependent and state-independent Markovian sampling, respectively, where $d$ is the dimensionality and $n$ 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 $\ell_2$ norm of the error of SGD dynamics under state-dependent Markovian data, which holds potential interest as an independent result. Numerical illustrations provide confidence intervals for SGD in linear and logistic regression models under Markovian sampling. Additionally, our method is applied to the strategic classification with logistic regression, where adversaries adaptively modify features during training to affect target class classification.
Forward citations
Cited by 3 Pith papers
-
Statistical inference for Linear Stochastic Approximation with Markovian Noise
Polyak-Ruppert averaged linear stochastic approximation with Markovian noise achieves Berry-Esseen rate O(n^{-1/4}) in Kolmogorov distance, and a multiplier subsample bootstrap achieves coverage error O(n^{-1/10}).
-
Online Statistical Inference of Constrained Stochastic Optimization via Random Scaling
A random scaling statistic based on averaged AI-SSQP iterates is asymptotically pivotal for constrained stochastic optimization, enabling matrix-free online confidence intervals.
-
Online Covariance Estimation in Nonsmooth Stochastic Approximation
For nonsmooth stochastic approximation with a local smooth-manifold structure, the online batch-means estimator attains covariance estimation rate O(sqrt(d) n^{-1/8+eps}), matching the smooth strongly convex case up t...
Discussion (0). Continue with ORCID to comment.