Lecture

Optimal Transport: Forward-Backward Splitting

Related lectures (31)

Optimization Techniques: Stochastic Gradient Descent and Beyond

Discusses optimization techniques in machine learning, focusing on stochastic gradient descent and its applications in constrained and non-convex problems.

Optimization Methods: Theory Discussion

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Gradient Descent

Covers the concept of gradient descent, a universal algorithm used to find the minimum of a function.

Gradient Descent: Optimization and Regularization

Covers the algorithm of gradient descent for optimization, including early stopping and regularization techniques.

Simplex Algorithm: Basics

Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.

Quantile Regression: Linear Optimization

Covers quantile regression, focusing on linear optimization for predicting outputs and discussing sensitivity to outliers, problem formulation, and practical implementation.

Projected Gradient Descent

Explores convex constrained optimization through Projected Gradient Descent, focusing on tangent space and iterative minimization.

Branch & Bound: Optimization

Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.

Optimisation in Energy Systems

Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.

Gradient Descent

Covers the algorithm of gradient descent, aiming to minimize a function by iteratively moving in the direction of the steepest decrease.

Differentiable Ranking and Sorting

Explores differentiable ranking and sorting techniques for machine learning applications.

Stochastic Gradient Descent: Non-convex Optimization Techniques

Discusses Stochastic Gradient Descent and its application in non-convex optimization, focusing on convergence rates and challenges in machine learning.

PCA: Derivation and Optimization

Covers the derivation of PCA projection, error minimization, and eigenvector optimization.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

The Trouble with Quadratic Penalties: ALM as a Fix

Explores the challenges of quadratic penalties in optimization and the use of Augmented Lagrangian Methods (ALM) as a solution.

Suspension Optimisation: Performance Analysis and Optimization

Explores the design and optimization of car suspensions for improved performance.

Convex Optimization Tutorial: KKT Conditions

Explores KKT conditions in convex optimization, covering dual problems, logarithmic constraints, least squares, matrix functions, and suboptimality of covering ellipsoids.

Equivalent formulation

Covers the concept of equivalent formulation in constrained optimization and explores the tangent cone.

Understanding Generalization: Implicit Bias & Optimization

Explores the trade-off between complexity and risk in machine learning models, the benefits of overparametrization, and the implicit bias of optimization algorithms.

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.