✳flâneur — a map of the web's best reading
Stochastic Gradient Descent with momentum | by Vitaly Bushaev | Towards Data Science
towardsdatascience.com · 1,493 words · saved by 1 readers
This is part 2 of my series on optimization algorithms used for training neural networks and machine learning models. Part 1 was about…
Solving Two-Stage Stochastic Programs in Gurobi | Towards Data Science Solving Two-Stage Stochastic Programs in Gurobi Formulating and solving a two-stage stochastic server farm problem Nakul Upadhya Oct 20, 2022 6 min read Share Photo by Taylor Vick on Unsplash Stochastic programming (SP) is a framework for modeling optimization problems that involve uncertainty [1]. In many cases, SP models take the form of a two-stage problem. The first stage involves finding the optimal deterministic decisions. These decisions are based on information we know to be certain (AKA the here-and-now decisions).
Explore this link on the map →saved by
related reading
- Stochastic gradient descent - Wikipediaen.m.wikipedia.org
- Stochastic optimization - Wikipediaen.wikipedia.org
- Why Momentum Really Worksdistill.pub
- Gregory Gundersengregorygundersen.com
- Highly optimized optimizers - by Ben Recht - arg minargmin.net
- bv_cvxbook.pdfweb.stanford.edu
- [1512.04202] Preconditioned Stochastic Gradient Descentarxiv.org
- Competing with sampling — Alignment Research Centeralignment.org
- Global optimization - Wikipediaen.wikipedia.org
- [1511.06251] Stochastic modified equations and adaptive stochastic gradient algorithmsarxiv.org
- bv_cvxbook.pdfstanford.edu
- Mathematical optimization - Wikipediaen.wikipedia.org