BloomTech’s Downfall: A Long Time Coming

Geodesically Convex Optimization - Can We Prove P!=NP Using Gradient Descent - Avi Wigderson

Geodesically Convex Optimization - Can We Prove P!=NP Using Gradient Descent - Avi Wigderson

Institute for Advanced Study via YouTube Direct link

Intro

1 of 12
Next

1 of 12

Intro

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Geodesically Convex Optimization - Can We Prove P!=NP Using Gradient Descent - Avi Wigderson

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Intro
  2. 2 Project Outline
  3. 3 Perfect Matching
  4. 4 Symbolic Matrix
  5. 5 Dual Life
  6. 6 Matching Problem
  7. 7 Alternate minimization algorithm
  8. 8 Analysis
  9. 9 The real problem
  10. 10 Quantizing the problem
  11. 11 Meaning of the problem
  12. 12 Invariants

Never Stop Learning.

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

Sign up for free
Someone learning on their laptop while sitting on the floor.