Stochastic optimization, uses noisy (possibly approximate) 1st-order gradient information to find the argument which minimises

\[ x^*=\operatorname{arg min}_{\mathbf{x}} f(x) \]

for some an objective function \(f:\mathbb{R}^n\to\mathbb{R}\).

That this works with little fuss in very high dimensions is a major pillar of deep learning.

## Basic

The original version, in terms of root finding, is (Herbert Robbins and Monro 1951) who later generalised analysis in (H. Robbins and Siegmund 1971), using martingale arguments to analyze convergence. There is some historical context in (Lai 2003) which puts it all in context. That article was written before the current craze for SGD in deep learning; after 2013 or so the problem is rather that there is so much information on the method that the challenge becomes sifting out the AI hype from the useful.

I recommend Francis Bach’s Sum of geometric series trick as an introduction to showing things advanced things about SGD using elementary tools.

Francesco Orabana on how to prove SGD converges:

to balance the universe of first-order methods, I decided to show how to easily prove the convergence of the iterates in SGD, even in unbounded domains.

## Gradient flows

Gradient flows are a continuous-limit SDE modelling stochastic gradient. See gradient flows.

## Variance-reduced

🏗

Zeyuan Allen-Zhu : Faster Than SGD 1: Variance Reduction:

SGD is well-known for large-scale optimization. In my mind, there are two (and only two) fundamental improvements since the original introduction of SGD: (1) variance reduction, and (2) acceleration. In this post I’d love to conduct a survey regarding (1),

## Stochastic momentum

## Polyak averaging

## Normalized

Zhiyuan Li and Sanjeev Arora argue:

You may remember our previous blog post showing that it is possible to do state-of-the-art deep learning with learning rate that increases exponentially during training. It was meant to be a dramatic illustration that what we learned in optimization classes and books isn’t always a good fit for modern deep learning, specifically,

normalized nets, which is our term for nets that use any one of popular normalization schemes,e.g. BatchNorm (BN), GroupNorm (GN), WeightNorm (WN). Today’s post (based upon our paper with Kaifeng Lyu at NeurIPS20) identifies other surprising incompatibilities between normalized nets and traditional analyses.

## In MCMC

See SGMCMC.

## Sundry Hacks

…

Yellowfin an automatic SGD momentum tuner

Mini-batch and stochastic methods for minimising loss when you have a lot of data, or a lot of parameters, and using it all at once is silly, or when you want to iteratively improve your solution as data comes in, and you have access to a gradient for your loss, ideally automatically calculated. It’s not clear at all that it should work, except by collating all your data and optimising offline, except that much of modern machine learning shows that it does.

Sometimes this apparently stupid trick it might even be fast for small-dimensional cases, so you may as well try.

Technically, “online” optimisation in bandit/RL problems might imply that you have to “minimise regret online”, which has a slightly different meaning and, e.g. involves seeing each training only as it arrives along some notional arrow of time, yet wishing to make the “best” decision at the next time, and possibly choosing your next experiment in order to trade-off exploration versus exploitation etc.

In SGD you can see your data as often as you want and in whatever order, but you only look at a bit at a time. Usually the data is given and predictions make no difference to what information is available to you.

Some of the same technology pops up in each of these notions of online optimisation, but I am mostly thinking about SGD here.

There are many more permutations and variations used in practice.

## References

*Proceedings of the 29th International Coference on International Conference on Machine Learning*, 1771–78. ICML’12. Madison, WI, USA: Omnipress.

*Proceedings of the 39th International Conference on Machine Learning*, 414–34. PMLR.

*arXiv:1306.2119 [Cs, Math, Stat]*, 773–81.

*Advances in Neural Information Processing Systems (NIPS)*, –. Spain.

*Séminaire de Probabilités de Strasbourg*, 33:1–68. Lecture Notes in Math. Berlin: Springer, Berlin.

*arXiv:2006.05604 [Cs, Math, Stat]*, June.

*Electronic Journal of Statistics*9 (2): 2058–75.

*Proceedings of Neuro-Nîmes 91*. Nimes, France: EC2.

*Online Learning and Neural Networks*, edited by David Saad, 17:142. Cambridge, UK: Cambridge University Press.

*Proceedings of the 19th International Conference on Computational Statistics (COMPSTAT’2010)*, 177–86. Paris, France: Springer.

*Advances in Neural Information Processing Systems*, edited by J.C. Platt, D. Koller, Y. Singer, and S. Roweis, 20:161–68. NIPS Foundation (http://books.nips.cc).

*arXiv:1606.04838 [Cs, Math, Stat]*, June.

*Advances in Neural Information Processing Systems 16*, edited by Sebastian Thrun, Lawrence Saul, and Bernhard Schölkopf. Cambridge, MA: MIT Press.

*Convex Optimization: Algorithms and Complexity*. Vol. 8. Foundations and Trends in Machine Learning. Now Publishers.

*IEEE Signal Processing Magazine*31 (5): 32–43.

*Proceedings of the 31st International Conference on Machine Learning*, 1683–91. Beijing, China: PMLR.

*Mathematical Programming*134 (1): 71–99.

*arXiv:2012.00152 [Cs, Stat]*, November.

*Journal of Machine Learning Research*12 (Jul): 2121–59.

*Proceedings of the National Academy of Sciences*118 (9): e2015617118.

*SIAM Journal on Scientific Computing*34 (3): A1380–1405.

*SIAM Journal on Optimization*23 (4): 2341–68.

*arXiv:1310.3787 [Math]*, October.

*Distill*2 (4): e6.

*Advances in Neural Information Processing Systems 28*, edited by C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett, 1594–1602. Curran Associates, Inc.

*Stochastic Processes and Their Applications*2 (4): 359–70.

*Advances in Neural Information Processing Systems*, 781–89. Curran Associates, Inc.

*IEEE Transactions on Signal Processing*62 (4): 868–82.

*Proceeding of ICLR*.

*The Annals of Statistics*31 (2): 391–406.

*arXiv:1710.07406 [Cs, Math, Stat]*, October.

*arXiv:1602.04915 [Cs, Math, Stat]*, March.

*Advances In Neural Information Processing Systems*.

*Stochastic Approximation and Optimization of Random Systems*. Basel: Birkhäuser.

*arXiv:1703.10622 [Cs, Stat]*, March.

*Proceedings of the 19th International Conference on Artificial Intelligence and Statistics*, 1070–77. arXiv.

*Advances in Neural Information Processing Systems*, 2283–91.

*JMLR*, April.

*Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining*, 1222–30. KDD ’13. New York, NY, USA: ACM.

*arXiv:1605.09774 [Cs, Math, Stat]*, May.

*arXiv:2102.00931 [Cs, Stat]*, August.

*arXiv:1705.07261 [Cs, Math, Stat]*, May.

*arXiv:1702.00317 [Cs, Math, Stat]*, February.

*SIAM Journal on Control and Optimization*30 (4): 838–55.

*PMLR*, 1603:314–23.

*The Annals of Mathematical Statistics*22 (3): 400–407.

*Optimizing Methods in Statistics*, edited by Jagdish S. Rustagi, 233–57. Academic Press.

*arXiv:1609.04747 [Cs]*, September.

*arXiv:1412.6615 [Cs, Stat]*, December.

*Advances in Neural Information Processing Systems 29*, edited by D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett, 901–1. Curran Associates, Inc.

*Journal of Machine Learning Research*12 (July): 1865–92.

*CoRR*abs/2006.09313.

*IEEE Transactions on Automatic Control*45 (10): 1839–53.

*ACM Transactions on Knowledge Discovery from Data*17 (2): 29:1–37.

*Proceedings of the 23rd International Conference on Machine Learning*.

*Proceedings of the 28th International Conference on International Conference on Machine Learning*, 681–88. ICML’11. Madison, WI, USA: Omnipress.

*Optimization for Data Analysis*. New York: Cambridge University Press.

*arXiv:1107.2490 [Cs]*, July.

*arXiv:1701.00481 [Stat]*, January.

*Advances in Neural Information Processing Systems 23*, edited by J. D. Lafferty, C. K. I. Williams, J. Shawe-Taylor, R. S. Zemel, and A. Culotta, 2595–2603. Curran Associates, Inc.

## No comments yet. Why not leave one?