Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Fast Semidefinite Programming for Differentiable Combinatorial Optimization

Institute for Pure & Applied Mathematics (IPAM) via YouTube

Overview

Explore a 29-minute conference talk on fast semidefinite programming for differentiable combinatorial optimization. Delivered by Zico Kolter from Carnegie Mellon University at the Deep Learning and Combinatorial Optimization 2021 event, hosted by the Institute for Pure and Applied Mathematics at UCLA. Dive into advanced techniques for solving complex optimization problems, combining elements of deep learning and combinatorial methods. Gain insights into cutting-edge research that bridges the gap between continuous and discrete optimization, potentially revolutionizing approaches to challenging computational tasks.

Syllabus

Zico Kolter: "Fast semidefinite programming for (differentiable) combinatorial optimization"

Taught by

Institute for Pure & Applied Mathematics (IPAM)

Reviews

Start your review of Fast Semidefinite Programming for Differentiable Combinatorial Optimization

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.