Fast Semidefinite Programming for Differentiable Combinatorial Optimization
Offered By: Institute for Pure & Applied Mathematics (IPAM) via YouTube
Course Description
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)
Related Courses
Neural Networks for Machine LearningUniversity of Toronto via Coursera 機器學習技法 (Machine Learning Techniques)
National Taiwan University via Coursera Machine Learning Capstone: An Intelligent Application with Deep Learning
University of Washington via Coursera Прикладные задачи анализа данных
Moscow Institute of Physics and Technology via Coursera Leading Ambitious Teaching and Learning
Microsoft via edX