ConceptMathematics
Least squares
A method to find the best approximate solution to an unsolvable system of linear equations by minimizing the sum of squared errors.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Gilbert Strang
Pieter Abbeel
An optimization method that minimizes the sum of squared errors between observations and predictions.Steve Brunton
An optimization problem that minimizes the sum of squared errors in fitting a linear system of equations.
Lectures that assume it
22The first 12 are shown.
- Regularized Least Squares, Multi-Objective Optimization & Gauss-Newton
- Applications of Least-Squares Estimation: System Identification & Filtering
- Convex Optimization II: Truncated Newton Method and L1-Norm Methods
- Linear Algebra: Least Squares and Data Fitting
- Geometric Interpretation of Duality, Sensitivity & Theorems of Alternatives
- Convex Optimization with Abstract Linear Operators
- Applications of Singular Value Decomposition in LDS and Electrical Engineering
- Saddle-Point Interpretation, KKT Conditions & Perturbation
- Mathematical Optimization & Why Convexity Is the Watershed
- Complexity of Lasso with Normalized Data
- Subgradient Methods for Constrained Problems
- Convex Optimization II: L1 Methods for Convex-Cardinality Problems
Connections
36The lectures that define it or assume it, and the concepts next to it.
Concepts10
Lectures26
- Proof: All Norms Are Convex
- Four Ways to Solve Least Squares Problems
- Survey of Difficulties with Ax = b
- Reinforcement Learning Part 2/2
- Regularized Least Squares, Multi-Objective Optimization & Gauss-Newton
- Applications of Least-Squares Estimation: System Identification & Filtering
Show 20 moreShow fewer
- Convex Optimization II: Truncated Newton Method and L1-Norm Methods
- Linear Algebra: Least Squares and Data Fitting
- Geometric Interpretation of Duality, Sensitivity & Theorems of Alternatives
- Convex Optimization with Abstract Linear Operators
- Applications of Singular Value Decomposition in LDS and Electrical Engineering
- Saddle-Point Interpretation, KKT Conditions & Perturbation
- Mathematical Optimization & Why Convexity Is the Watershed
- Complexity of Lasso with Normalized Data
- Subgradient Methods for Constrained Problems
- Convex Optimization II: L1 Methods for Convex-Cardinality Problems
- Offline Reinforcement Learning (CS 285, Lecture 15, Part 3)
- Approximation and Fitting
- Low Rank Changes in A and Its Inverse
- Saddle Points Continued, Maxmin Principle
- Least-Norm Solutions of Underdetermined Equations
- Autonomous Linear Dynamical Systems
- Observability and State Estimation
- Time Series Analysis II
- Time Series Analysis I
- Stable Estimators for Fast Private Statistics