✳flâneur — a map of the web's best reading
prox_algs.pdf
web.stanford.edu · 32,267 words · saved by 2 readers
N/A
# link_2e3ievu9vn3.pdf ## Metadata - PDFFormatVersion=1.4 - IsLinearized=false - IsAcroFormPresent=false - IsXFAPresent=false - IsCollectionPresent=false - IsSignaturesPresent=false - Producer=dvips + GPL Ghostscript 9.05 - CreationDate=D:20130807131037-07'00' - ModDate=D:20130807131037-07'00' - Creator=LaTeX with hyperref package - pdf:producer=dvips + GPL Ghostscript 9.05 - pdf:keywords=() - xmp:modifydate=2013-08-07T13:10:37-07:00 - xmp:createdate=2013-08-07T13:10:37-07:00 - xmp:creatortool=LaTeX with hyperref package - dc:title=() - dc:creator=() - dc:description=() ## Contents ### Page
Explore this link on the map →saved by
related reading
- bv_cvxbook.pdfweb.stanford.edu
- Why Momentum Really Worksdistill.pub
- bv_cvxbook.pdfstanford.edu
- Deriving Muonjeremybernste.in
- Effortless optimization through gradient flows – Machine Learning Research Blogfrancisbach.com
- Gradient descent - Wikipediaen.wikipedia.org
- Modular Manifolds - Thinking Machines Labthinkingmachines.ai
- [2605.15522] Stochastic Non-Smooth Convex Optimization with Unbounded Gradientsarxiv.org
- Regularization (mathematics) - Wikipediaen.wikipedia.org
- [1707.06347] Proximal Policy Optimization Algorithmsarxiv.org
- Stochastic gradient descent - Wikipediaen.m.wikipedia.org
- Mathematical optimization - Wikipediaen.wikipedia.org