On the Utility of Equal Batch Sizes for Inference in Stochastic Gradient Descent
read the original abstract
Stochastic gradient descent (SGD) is an estimation tool for large data employed in machine learning and statistics. Due to the Markovian nature of the SGD process, inference is a challenging problem. An underlying asymptotic normality of the averaged SGD (ASGD) estimator allows for the construction of a batch-means estimator of the asymptotic covariance matrix. Instead of the usual increasing batch-size strategy, we propose a memory efficient equal batch-size strategy and show that under mild conditions, the batch-means estimator is consistent. A key feature of the proposed batching technique is that it allows for bias-correction of the variance, at no additional cost to memory. Further, since joint inference for large dimensional problems may be undesirable, we present marginal-friendly simultaneous confidence intervals, and show through an example on how covariance estimators of ASGD can be employed for improved predictions.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Online Covariance Estimation in Averaged SGD: Improved Batch-Mean Rates and Minimax Optimality via Trajectory Regression
Improved batch-means rates for SGD covariance estimation plus a minimax-optimal trajectory-regression estimator achieving Θ(n^{-(1-α)/2}) for Hessian-free inference.
-
Online Covariance Matrix Estimation in Sketched Newton Methods
Develops a batch-free online covariance estimator for sketched Newton methods, proves its consistency, and demonstrates use for online statistical inference on regression and CUTEst problems.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.