Metraipolis › archive › dc_4c2de4deaea0
Smoothed Gradient Method for Nonconvex Federated Stochastic Bilevel Optimization — arXiv:2610.05290
- Source
- arXiv
- Original
- https://arxiv.org/abs/2610.05290
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T05:30:59.934Z
- SHA-256 of the archived text
baea1b6dc5bd78b3d95dbc6812e5a6fd26dccc39db94f1459247238ce2796719- Stable URL of this page
https://metraipolis.com/documento/dc_4c2de4deaea0
How to cite
Smoothed Gradient Method for Nonconvex Federated Stochastic Bilevel Optimization — arXiv:2610.05290 — arXiv, https://arxiv.org/abs/2610.05290 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4c2de4deaea0 (Metraipolis archive dc_4c2de4deaea0, sha256 baea1b6dc5bd78b3d95dbc6812e5a6fd26dccc39db94f1459247238ce2796719)
BibTeX
@misc{dc4c2de4deaea0,
title = {Smoothed Gradient Method for Nonconvex Federated Stochastic Bilevel Optimization — arXiv:2610.05290},
howpublished = {arXiv},
url = {https://arxiv.org/abs/2610.05290},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4c2de4deaea0; sha256 baea1b6dc5bd78b3d95dbc6812e5a6fd26dccc39db94f1459247238ce2796719},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.05290. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In recent years, federated stochastic bilevel optimization has attracted increasing attention due to its wide range of applications in machine learning. To reduce the computational overhead associated with second-order Hessian and Jacobian matrices, several first-order methods have been proposed. However, existing methods typically impose restrictive assumptions on the lower-level function, suffer from a strong dependence on the condition number in their convergence rates, and require different learning-rate scales for variables across the upper- and lower-level problems, limiting their practical applicability and complicating hyperparameter tuning. To address these challenges, we propose a stochastic doubly smoothed gradient method for nonconvex federated stochastic bilevel optimization problems, which decouples the learning rates of upper- and lower-level variables and does not require a strongly-convex lower-level loss function. We establish rigorous theoretical guarantees for the proposed algorithm, demonstrating an improved convergence rate of $O(\kappa^{15/2}/\epsilon^5)$ and a communication complexity of $O(\kappa^{4}/\epsilon^3)$, where $\kappa$ denotes the condition number and $\epsilon$ represents the solution accuracy. Notably, these bounds exhibit significantly better dependence on the condition number $\kappa$ than those of existing methods. Extensive experiments validate the effectiveness of our algorithm.
Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.05290 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T05:27:05.779Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).