{"ID":2890853,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.18277","arxiv_id":"2507.18277","title":"Boosting Accelerated Proximal Gradient Method with Adaptive Sampling for Stochastic Composite Optimization","abstract":"We develop an adaptive Nesterov accelerated proximal gradient (adaNAPG) algorithm for stochastic composite optimization problems, boosting the Nesterov accelerated proximal gradient (NAPG) algorithm through the integration of an adaptive sampling strategy for gradient estimation. We provide a complexity analysis demonstrating that the new algorithm, adaNAPG, achieves both the optimal iteration complexity and the optimal sample complexity as outlined in the existing literature. Additionally, we establish a central limit theorem for the iteration sequence of the new algorithm adaNAPG, elucidating its convergence rate and efficiency.","short_abstract":"We develop an adaptive Nesterov accelerated proximal gradient (adaNAPG) algorithm for stochastic composite optimization problems, boosting the Nesterov accelerated proximal gradient (NAPG) algorithm through the integration of an adaptive sampling strategy for gradient estimation. We provide a complexity analysis demons...","url_abs":"https://arxiv.org/abs/2507.18277","url_pdf":"https://arxiv.org/pdf/2507.18277v1","authors":"[\"Dongxuan Zhu\",\"Weihuan Huang\",\"Caihua Chen\"]","published":"2025-07-24T10:26:17Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[]","has_code":false}