Establishes non-asymptotic Gaussian approximation bounds for federated LSA with explicit communication-heterogeneity trade-offs and introduces an online multiplier bootstrap for last-iterate inference with validity guarantees.
Online statistical inference for contextual bandits via stochastic gradient descent
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
stat.ML 2verdicts
UNVERDICTED 2representative citing papers
Proves the first fully non-asymptotic bound on the accuracy of multiplier bootstrap for constructing confidence sets from Polyak-Ruppert SGD iterates, achieving convex-distance rates up to 1/sqrt(n) under regularity conditions.
citing papers explorer
-
Gaussian Approximation and Multiplier Bootstrap for Federated Linear Stochastic Approximation
Establishes non-asymptotic Gaussian approximation bounds for federated LSA with explicit communication-heterogeneity trade-offs and introduces an online multiplier bootstrap for last-iterate inference with validity guarantees.
-
Gaussian Approximation and Multiplier Bootstrap for Stochastic Gradient Descent
Proves the first fully non-asymptotic bound on the accuracy of multiplier bootstrap for constructing confidence sets from Polyak-Ruppert SGD iterates, achieving convex-distance rates up to 1/sqrt(n) under regularity conditions.