Gaussian Approximation and Multiplier Bootstrap for Federated Linear Stochastic Approximation

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Levin, Ilya, Shuklin, Maksim, Moulines, Eric, Mangold, Paul, Samsonov, Sergey
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910236125691904
author Levin, Ilya
Shuklin, Maksim
Moulines, Eric
Mangold, Paul
Samsonov, Sergey
author_facet Levin, Ilya
Shuklin, Maksim
Moulines, Eric
Mangold, Paul
Samsonov, Sergey
contents In this paper, we establish Berry-Esseen-type bounds for federated linear stochastic approximation (LSA). Our results provide the first federated Gaussian approximations for LSA that explicitly capture communication-computation trade-offs and heterogeneity-aware error terms, quantifying the effects of local step size, number of local updates, and heterogeneity on convergence rates. We present results for both (i) constant step size regime and (ii) decreasing step size with an increasing number of local iterations, recovering the recent rates of Bonnerjee et al. [2025] as a special case. As a primary application of our results, we develop an online multiplier bootstrap procedure for inference on the last iterate, which avoids explicit estimation of the asymptotic covariance matrix, and obtain non-asymptotic validity guarantees for this procedure.
format Preprint
id arxiv_https___arxiv_org_abs_2605_19629
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Gaussian Approximation and Multiplier Bootstrap for Federated Linear Stochastic Approximation
Levin, Ilya
Shuklin, Maksim
Moulines, Eric
Mangold, Paul
Samsonov, Sergey
Machine Learning
Optimization and Control
In this paper, we establish Berry-Esseen-type bounds for federated linear stochastic approximation (LSA). Our results provide the first federated Gaussian approximations for LSA that explicitly capture communication-computation trade-offs and heterogeneity-aware error terms, quantifying the effects of local step size, number of local updates, and heterogeneity on convergence rates. We present results for both (i) constant step size regime and (ii) decreasing step size with an increasing number of local iterations, recovering the recent rates of Bonnerjee et al. [2025] as a special case. As a primary application of our results, we develop an online multiplier bootstrap procedure for inference on the last iterate, which avoids explicit estimation of the asymptotic covariance matrix, and obtain non-asymptotic validity guarantees for this procedure.
title Gaussian Approximation and Multiplier Bootstrap for Federated Linear Stochastic Approximation
topic Machine Learning
Optimization and Control
url https://arxiv.org/abs/2605.19629