
[29] Tengyu Ma - Non-convex Optimization for Machine Learning
The Thesis Review
Navigating Non-Convex Optimization in Machine Learning
This chapter examines the complexities of non-convex optimization in machine learning, focusing on the balance between identifying local and global minima. It also reflects on the speaker's journey through theoretical foundations, algorithm design, and the transition from traditional computer science to practical applications in machine learning.
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.