The Video Signal

Topic

Stanford Online

All digests tagged Stanford Online

· 1:20:06

Stanford CS229 Machine Learning | Spring 2026 | Lecture 10: GMM (EM), PCA

This lecture provides a deep dive into two foundational unsupervised machine learning techniques: Gaussian Mixture Models (GMM) solved via the Expectation-Maximization (EM) algorithm, and Principal Component Analysis (PCA). The discussion emphasizes the mathematical underpinnings of these methods. For GMM, the EM algorithm is shown to solve for latent variables by constructing a tractable lower bound using Jensen's inequality. For PCA, the technique identifies directions of maximum variance by performing Eigen Decomposition on the data's covariance matrix, highlighting the critical need for proper data centering and scaling.

Key takeaways

  1. GMM via EM Algorithm 23:20

    The Expectation-Maximization (EM) algorithm is used to estimate parameters ($ heta$) for GMM. It operates by constructing a lower bound $L( heta|T)$ of the log-likelihood, which allows optimization through alternating steps: E-step (calculating soft assignments/probabilities $Q_i(Z)$) and M-step (re-estimating parameters $oldsymbol{ heta}$).

  2. PCA Core Principle 1:03:20

    PCA is a dimensionality reduction technique that finds orthogonal unit vectors (principal components, $U_k$) corresponding to the directions of maximal variance in the data. The process relies on finding the Eigen Decomposition ($oldsymbol{A} = oldsymbol{U} oldsymbol{ ext{diag}}(oldsymbol{ ext{eigenvalues}}) oldsymbol{U}^T$) of the covariance matrix.

  3. Mathematical Rigor (Jensen's Inequality) 27:10

    The EM algorithm leverages Jensen's inequality to transform an intractable expectation into a manageable lower bound, enabling iterative optimization. The selection of the conditional probability $Q(Z)$ is key to achieving this tight lower bound.

Watch on YouTube Full article

· 1:02:14

Stanford CS229 Machine Learning | Spring 2026 | Lecture 3: Weighted Least Squares

This lecture provides a deep theoretical dive into classification and model building using the Maximum Likelihood Estimation (MLE) framework. The core principle demonstrated is that MLE allows generalizing modeling techniques from continuous regression (Least Squares) to discrete classification problems by introducing probabilistic interpretations. Key derivations include establishing Logistic Regression via the log-likelihood function, which transforms the complex product of probabilities into a numerically stable additive sum suitable for optimization using Stochastic Gradient Descent (SGD). Furthermore, the lecture compares various optimization methods—Gradient Descent, SGD, and Newton's Method—highlighting that while Newton's method is theoretically efficient, SGD remains the workhorse due to its scalability with massive datasets ($N$ and $D$).

Key takeaways

  1. Maximum Likelihood Principle (MLE) 1:35

    The MLE framework dictates setting up a probabilistic model (a forward model) of how data is generated. This principle generalizes across different problem types (continuous, discrete, etc.) by maximizing the likelihood function, which measures how probable the observed data is under a given set of parameters ($ heta$).

  2. Logistic Regression Derivation 5:50

    Classification problems are modeled using a link function (e.g., the sigmoid function) applied to a linear combination of features ($ ext{logit}(p)$). By applying MLE, the resulting log-likelihood function for binary classification leads directly to the standard form used in logistic regression.

  3. Optimization Method Comparison 17:50

    While Newton's method offers fast convergence and high precision, Stochastic Gradient Descent (SGD) is preferred in modern Machine Learning because it scales efficiently when dealing with massive datasets ($N$ and $D$), making it computationally feasible where full gradient computation is impossible.

Watch on YouTube Full article

· 56:01

Stanford MS&E435 Economics of the AI Supercycle | Spring 2026 | The GPU Economy

The video provides an in-depth analysis of the economic and technical shifts driven by AI, arguing that unlike previous software cycles with near-zero distribution costs, modern AI requires massive compute resources. The discussion highlights how the shift from pre-training to inference time reasoning is causing a parabolic explosion in token consumption. Hardware innovation (e.g., Groq's architecture) and architectural breakthroughs—such as decoupling prefill and decode stages and utilizing high-bandwidth SRAMM—are critical for maintaining efficiency, leading to an expected deflationary trend in the unit cost of intelligence.

Key takeaways

  1. AI Compute is Not Zero Marginal Cost

    Unlike previous software where distribution costs were near zero, AI applications require significant compute power. The increasing demand for tokens means that computing resources are a primary economic constraint and driver of value.

  2. Inference Time Reasoning is the New Frontier 34:33

    The industry is shifting focus from pre-training models to inference time reasoning. This shift dramatically increases token consumption, with predictions suggesting a potential 1 billionx increase in required compute cycles.

  3. Architectural Innovation Drives Efficiency 38:25

    Efficiency gains are achieved by architectural breakthroughs, such as Groq's design which utilizes high-bandwidth SRAMM and a deterministic compiler. Combining different systems (e.g., NVLink Fusion) allows for significantly higher token output per unit of power.

  4. The Value Proposition is Democratizing Intelligence 50:15

    AI's value lies in democratizing access to high-level capabilities (e.g., specialized tutoring, concierge medicine), making previously exclusive functions available globally. The economic shift suggests that the unit cost of intelligence will continue to plummet.

Watch on YouTube Full article