Random-reshuffled SARAH does not need full gradient computations
Crossref DOI link: https://doi.org/10.1007/s11590-023-02081-x
Published Online: 2023-12-11
Published Print: 2024-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Beznosikov, Aleksandr http://orcid.org/0000-0002-3217-3614
Takáč, Martin http://orcid.org/0000-0001-7455-2025
Text and Data Mining valid from 2023-12-11
Version of Record valid from 2023-12-11
Article History
Received: 25 September 2022
Accepted: 6 November 2023
First Online: 11 December 2023