STLGOCMLAug 3, 2023

Online covariance estimation for stochastic gradient descent under Markovian sampling

arXiv:2308.01481v29 citationsh-index: 25
Originality Incremental advance
AI Analysis

This work addresses the challenge of reliable uncertainty quantification in SGD for sequential or dependent data, which is incremental but important for applications like strategic classification.

The paper tackles the problem of online covariance estimation for Stochastic Gradient Descent (SGD) under Markovian sampling, establishing convergence rates of O(√d n^{-1/8} (log n)^{1/4}) and O(√d n^{-1/8}) that match the best-known rates for i.i.d. data, and applies the method to strategic classification with logistic regression.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes