Lecture

Convexifying Nonconvex Problems: SVM and Dimensionality Reduction

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Related lectures (64)

Semi-Definite Programming

Covers semi-definite programming and optimization over positive semidefinite cones.

Linear Programming Basics

Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.

Optimal Transport: Rockafellar Theorem

Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.

Linear Models for Classification

Covers linear models for classification, including SVM, decision boundaries, support vectors, and Lagrange duality.

Gradient Descent Methods

Covers gradient descent methods for convex and nonconvex problems, including smooth unconstrained convex minimization, maximum likelihood estimation, and examples like ridge regression and image classification.

Support Vector Machines

Introduces Support Vector Machines, covering Hinge Loss, hyperplane separation, and non-linear classification using kernels.

Optimisation Problem: Solving by FM

Covers the modelling and optimization of energy systems, focusing on solving optimization problems with constraints and variables.

Stochastic Optimization: Algorithms and Methods

Explores stochastic optimization algorithms and methods for convex problems with smooth and nonsmooth risks.

Primal-dual Optimization: Extra-Gradient Method

Explores the Extra-Gradient method for Primal-dual optimization, covering nonconvex-concave problems, convergence rates, and practical performance.

Trade-offs in Data and Time

Explores trade-offs between data and time in computational problems, emphasizing diminishing returns and continuous trade-offs.

SVM - Principle: Linear Classifiers

Covers the history and applications of SVM, as well as the construction of linear classifiers and the concept of classifier margin.

Primal-dual Optimization III: Lagrangian Gradient Methods

Explores primal-dual optimization methods, emphasizing Lagrangian gradient techniques and their applications in data optimization.

Simplex Method: Basics and Applications

Covers the basics of the Simplex method and its application in solving optimization problems.

Linear Programming Techniques in Reinforcement Learning

Covers the linear programming approach to reinforcement learning, focusing on its applications and advantages in solving Markov decision processes.

Convex Optimization: Examples of Convex Functions

Explores convex optimization, convex functions, and their properties, including strict convexity and strong convexity, as well as different types of convex functions like linear affine functions and norms.

Linear Models for Classification

Explores linear models, logistic regression, classification metrics, SVM, and their practical use in data science methods.

Markov Chain Monte Carlo: Sampling High-Dimensional Distributions

Covers Markov Chain Monte Carlo for sampling high-dimensional distributions, discussing challenges, advantages, and applications like the Knapsack Problem and cryptography.

Optimality of Convergence Rate: Acceleration in Gradient Descent

Explores the optimality of convergence rate in gradient descent and acceleration techniques for convex and non-convex problems.

Linear Models & k-NN

Covers linear models, logistic regression, decision boundaries, k-NN, and practical applications in authorship attribution and image data analysis.

Stochastic Gradient Descent: Optimization and Convergence

Explores stochastic gradient descent, covering convergence rates, acceleration, and practical applications in optimization problems.