Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Convergence of Stochastic Proximal Gradient Algorithm
by
Công, Vũ Bằng
, Villa, Silvia
, Rosasco Lorenzo
in
Algorithms
/ Convergence
/ Convexity
/ Machine learning
2020
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Convergence of Stochastic Proximal Gradient Algorithm
by
Công, Vũ Bằng
, Villa, Silvia
, Rosasco Lorenzo
in
Algorithms
/ Convergence
/ Convexity
/ Machine learning
2020
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Convergence of Stochastic Proximal Gradient Algorithm
2020
Request Book From Autostore
and Choose the Collection Method
Overview
We study the extension of the proximal gradient algorithm where only a stochastic gradient estimate is available and a relaxation step is allowed. We establish convergence rates for function values in the convex case, as well as almost sure convergence and convergence rates for the iterates under further convexity assumptions. Our analysis avoid averaging the iterates and error summability assumptions which might not be satisfied in applications, e.g. in machine learning. Our proofing technique extends classical ideas from the analysis of deterministic proximal gradient algorithms.
Publisher
Springer Nature B.V
Subject
This website uses cookies to ensure you get the best experience on our website.