REVIEW 3 cited by
Asymptotic Time-Uniform Inference for Parameters in Averaged Stochastic Approximation
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
Signed reviews
read the original abstract
We study time-uniform statistical inference for parameters in stochastic approximation (SA), which encompasses a bunch of applications in optimization and machine learning. To that end, we analyze the almost-sure convergence rates of the averaged iterates to a scaled sum of Gaussians in both linear and nonlinear SA problems. We then construct three types of asymptotic confidence sequences that are valid uniformly across all times with coverage guarantees, in an asymptotic sense that the starting time is sufficiently large. These coverage guarantees remain valid if the unknown covariance matrix is replaced by its plug-in estimator, and we conduct experiments to validate our methodology.
Forward citations
Cited by 3 Pith papers
-
The Root Finding Problem Revisited: Beyond the Robbins-Monro procedure
SPRB is a stochastic root-finding algorithm that attains parametric-rate, minimal-variance estimation for small derivatives at the root, exponential convergence for discontinuities, and near-minimax rates for vanishin...
-
Sharp asymptotic theory for Q-learning with LDTZ learning rate and its generalization
Q-learning with PD2Z/LD2Z step sizes admits sharp non-asymptotic bounds, a tail Polyak–Ruppert CLT, and a time-uniform Gaussian approximation, establishing a best-of-both-worlds rate-and-bias tradeoff.
-
Decoupled Functional Central Limit Theorems for Two-Time-Scale Stochastic Approximation
Rescaled fast and slow iterates of two-time-scale stochastic approximation converge weakly to decoupled Ornstein-Uhlenbeck processes, with coupling entering only through the coefficient matrices.
Discussion (0). Continue with ORCID to comment.