







The Roadmap of Mathematics for Machine Learning
A complete guide to linear algebra, calculus, and probability theory

Learning From Data - Online Course (MOOC)
This is an introductory course in machine learning (ML) that covers the basic theory, algorithms, and applications. ML is a key technology in Big Data, and in many financial, medical, commercial, and scientific applications. It enables computational systems to adaptively improve their performance with experience accumulated from the observed data. ML has become one of the hottest fields of study today, taken up by undergraduate and graduate students from more than 20 different majors at Caltech. This course balances theory and practice, and covers the mathematical as well as the heuristic aspects. The lectures below follow each other in a story-like fashion:
Learning From Data - Online Course (MOOC)
This is an introductory course in machine learning (ML) that covers the basic theory, algorithms, and applications. ML is a key technology in Big Data, and in many financial, medical, commercial, and scientific applications. It enables computational systems to adaptively improve their performance with experience accumulated from the observed data. ML has become one of the hottest fields of study today, taken up by undergraduate and graduate students from more than 20 different majors at Caltech. This course balances theory and practice, and covers the mathematical as well as the heuristic aspects. The lectures below follow each other in a story-like fashion:
Machine Learning (Still) Has a Pseudoscience Problem | Mel Andrews
Deep Learning - Foundations and Concepts
This book offers a comprehensive introduction to the central ideas that underpin deep learning. It is intended both for newcomers to machine learning and for those already experienced in the field.
Query by committee
We propose an algorithm called query by commitee, in which a committee of students is trained on the same data set. The next query is chosen according to the principle of maximal disagreement. The algorithm is studied for two toy models: the high-low game and perceptron learning of another perceptron. As the number of queries goes to infinity, the committee algorithm yields asymptotically finite information gain. This leads to generalization error that decreases exponentially with the number of examples. This in marked contrast to learning from randomly chosen inputs, for which the information gain approaches zero and the generalization error decreases with a relatively slow inverse power law. We suggest that asymptotically finite information gain may be an important characteristic of good query algorithms.
New paper: "Functional Decision Theory" - Machine Intelligence Research Institute
MIRI senior researcher Eliezer Yudkowsky and executive director Nate Soares have a new introductory paper out on decision theory: "Functional decision theory:

The Algorithms - Learn Data Structures & Algorithms
The Algorithms - Open Source resource for learning Data Structures & Algorithms implementations in various programming languages
An Open Field Guide to Inference Engineering · Modelplane Docs
A field guide to inference concepts, production operations, tooling, and career development for platform engineers.
Theory Beyond Theorems and Proofs: A Guest Post
Scott’s foreword: I’m extremely grateful to my brilliant colleagues, Pravesh Kothari, Raghu Meka, and Prasad Raghavendra, for sharing the guest post below about how theoretical computer…
Fleetwood on Twitter / X
Studying continual learning at the moment, best papers thus far:https://t.co/Y9oXBAiyj2https://t.co/ByWlaF3ncnhttps://t.co/hG0XIzq6cHhttps://t.co/5VSEnBIkX2— Fleetwood (@fleetwood___) April 11, 2026
Personalized Machine Learning
This page contains collects information and supplementary material for my textbook Personalized Machine Learning:
Active Learning with Statistical Models