High Confidence Level Inference is Almost Free using Parallel Stochastic Optimization
Not on the map. Why?
Abstract (arXiv)
Uncertainty quantification for estimation through stochastic optimization solutions in an online setting has gained popularity recently. This paper introduces a novel inference method focused on constructing confidence intervals with efficient computation and fast convergence to the nominal level. Specifically, we propose to use a small number of independent multi-runs to acquire distribution information and construct a t-based confidence interval. Our method requires minimal additional computation and memory beyond the standard updating of estimates, making the inference process almost cost-free. We provide a rigorous theoretical guarantee for the confidence interval, demonstrating that the coverage is approximately exact with an explicit convergence rate and allowing for high confidence level inference. In particular, a new Gaussian approximation result is developed for the online estimators to characterize the coverage properties of our confidence intervals in terms of relative errors. Additionally, our method also allows for leveraging parallel computing to further accelerate calculations using multiple cores. It is easy to implement and can be integrated with existing stochastic algorithms without the need for complicated modifications.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 23 of its 52 references that are in the map. First posted on arXiv 17 Jan 2024.
Builds on
23 of 52 references.
References · 23
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,531
- 2020An Efficient Framework for Clustered Federated Learningcited by 505
- 2018Parallel Restarted SGD with Faster Convergence and Less Communication: Demystifying Why Model Averaging Works for Deep Learningcited by 277
- 2020Is Local SGD Better than Minibatch SGD?cited by 151
- 2016Statistical Inference for Model Parameters in Stochastic Gradient Descentcited by 71
- 2020An Analysis of Constant Step Size SGD in the Non-convex Regime: Asymptotic Normality and Biascited by 45
- 2016Asymptotic Optimality in Stochastic Optimizationcited by 38
- 2020Online Covariance Matrix Estimation in Stochastic Gradient Descentcited by 37
- 2019Normal Approximation for Stochastic Gradient Descent via Non-Asymptotic Rates of Martingale CLTcited by 30
- 2021Fast and Robust Online Inference with Stochastic Gradient Descent via Random Scalingcited by 28
11 more
- 2021Online Bootstrap Inference For Policy Evaluation in Reinforcement Learningcited by 26
- 2017Statistical inference using SGDcited by 21
- 2020Statistical Inference for Online Decision Making via Stochastic Gradient Descentcited by 17
- 2021Online Statistical Inference for Stochastic Optimization via Kiefer-Wolfowitz Methodscited by 14
- 2018HiGrad: Uncertainty Quantification for Online Learning and Stochastic Approximationcited by 13
- 2022Statistical Inference of Constrained Stochastic Optimization via Sketched Sequential Quadratic Programmingcited by 10
- 2023Weighted Averaged Stochastic Gradient Descent: Asymptotic Normality and Optimalitycited by 7
- 2020ROOT-SGD: Sharp Nonasymptotics and Near-Optimal Asymptotics in a Single Algorithmcited by 6
- 2023Acceleration of stochastic gradient descent with momentum by averaging: finite-sample rates and asymptotic normalitycited by 6
- 2022Covariance Estimators for the ROOT-SGD Algorithm in Online Learningcited by 5
- 2018TDOA-based Localization via Stochastic Gradient Descent Variantscited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 4; 2026: 4.
9 papers.
- 2025Gaussian Approximation and Multiplier Bootstrap for Stochastic Gradient Descentcited by 8
- 2025Statistical Inference for Online Algorithmscited by 2
- 2025Beyond Sin-Squared Error: Linear-Time Entrywise Uncertainty Quantification for Streaming PCAcited by 2
- 2025Federated Learning of Quantile Inference under Local Differential Privacycited by 2
- 2026Statistical Inference for Stochastic Gradient Descent: Beyond Finite Variancecited by 1
- 2024Enhancing Stochastic Optimization for Statistical Efficiency Using ROOT-SGD with Diminishing Stepsizecited by 0
- 2026Sharp asymptotic theory for Q-learning with LDTZ learning rate and its generalizationcited by 0
- 2026Refining Covariance Matrix Estimation in Stochastic Gradient Descent Through Bias Reductioncited by 0
- 2026A Viscosity Semigroup Framework for Stable Image Reconstructioncited by 0
- 2026A Viscosity Semigroup Framework for Stable Image Reconstruction26 May 2026
- 2026Statistical Inference for Stochastic Gradient Descent: Beyond Finite Variance25 May 2026
- 2026Refining Covariance Matrix Estimation in Stochastic Gradient Descent Through Bias Reduction23 Apr 2026
- 2026Sharp asymptotic theory for Q-learning with LDTZ learning rate and its generalization5 Apr 2026
- 2025Federated Learning of Quantile Inference under Local Differential Privacy26 Sep 2025
- 2025Beyond Sin-Squared Error: Linear-Time Entrywise Uncertainty Quantification for Streaming PCA14 Jun 2025
- 2025Statistical Inference for Online Algorithms22 May 2025
- 2025Gaussian Approximation and Multiplier Bootstrap for Stochastic Gradient Descent10 Feb 2025
- 2024Enhancing Stochastic Optimization for Statistical Efficiency Using ROOT-SGD with Diminishing Stepsize15 Jul 2024