Revisiting the ODE Method for Recursive Algorithms:
Fast Convergence Using Quasi Stochastic Approximation

doi:10.1007/s11424-021-1251-5

Revisiting the ODE Method for Recursive Algorithms: Fast Convergence Using Quasi Stochastic Approximation

CHEN Shuhang · DEVRAJ Adithya · BERSTEIN Andrey · MEYN Sean

Journal of Systems Science & Complexity ›› 2021, Vol. 34 ›› Issue (5) : 1681-1702.

PDF(1180 KB)

Journal of Systems Science & Complexity ›› 2021, Vol. 34 ›› Issue (5) : 1681-1702. DOI: 10.1007/s11424-021-1251-5

Revisiting the ODE Method for Recursive Algorithms: Fast Convergence Using Quasi Stochastic Approximation

{{article.zuoZhe_EN}}

Author information +

History +

HeighLight

Abstract

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations

{{article.zuoZheEn_L}}. {{article.title_en}}. Journal of Systems Science and Complexity, 2021, 34(5): 1681-1702 https://doi.org/10.1007/s11424-021-1251-5

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

Funding

RIGHTS & PERMISSIONS

PDF(1180 KB)

Accesses

Citation

Detail

Sections

Recommended

Please choose a citation manager

Content to export