Statistical Inference for Online Algorithms
Selina Carter, Arun K Kuchibhotla
TL;DR
This work addresses confidence inference for online estimators where full data passes and variance estimation are impractical. It introduces HulC, a variance-free, bucketed online inference approach that yields valid coordinate-wise confidence intervals from streaming outputs such as averaged SGD. Theoretical results show asymptotic validity under mild regularity, and numerical experiments in linear and logistic regression demonstrate that HulC achieves near nominal coverage with modest width inflation compared with Wald, plug-in, and t-stat methods, especially in challenging online and high-dimensional settings. The findings suggest HulC as a practical tool for real-time inference in streaming contexts, with broad applicability to online optimization and empirical risk minimization.
Abstract
Construction of confidence intervals and hypothesis tests for functionals based on asymptotically normal estimators is a classical topic in statistical inference. The simplest and in many cases optimal inference procedure is the Wald interval or the likelihood ratio test, both of which require an estimator and an estimate of the asymptotic variance of the estimator. Estimators obtained from online/sequential algorithms forces one to consider the computational aspects of the inference problem, i.e., one cannot access all of the data as many times as needed. Several works on this topic explored the online estimation of asymptotic variance. In this article, we propose computationally efficient, rate-optimal, and asymptotically valid confidence regions based on the output of online algorithms {\em without} estimating the asymptotic variance. As a special case, this implies inference from any algorithm that yields an asymptotically normal estimator. We focus our efforts on stochastic gradient descent with Polyak averaging to understand the practical performance of the proposed method.
