LM101-085:Ch7:How to Guarantee your Batch Learning Algorithm

LM101-085:Ch7:How to Guarantee your Batch Learning Algorithm Converges

Listen now

Description

This 85th episode of Learning Machines 101 discusses formal convergence guarantees for a broad class of machine learning algorithms designed to minimize smooth non-convex objective functions using batch learning methods. Simple mathematical formulas are presented based upon research from the late 1960s by Philip Wolfe and G. Zoutendijk that ensure convergence of the generated sequence of parameter vectors. Check out: www.learningmachines101.com for more details!!! #machinelearning

More Episodes

See all »

LM101-086: Ch8: How to Learn the Probability of Infinitely Many Outcomes

This 86th episode of Learning Machines 101 discusses the problem of assigning probabilities to a possibly infinite set of observed outcomes in a space-time continuum which corresponds to our physical world. The machine learning algorithm uses information about the frequency of environmental...

Published 07/20/21

Learning Machines 101

Published 07/20/21

LM101-084: Ch6: How to Analyze the Behavior of Smart Dynamical Systems

In this episode of Learning Machines 101, we review Chapter 6 of my book “Statistical Machine Learning” which introduces methods for analyzing the behavior of machine inference algorithms and machine learning algorithms as dynamical systems. We show that when dynamical systems can be viewed as...

Published 01/05/21