Provable Non-convex Projections for High-dimensional Learning Problems - Part1

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Non-convex optimization for high-dimensional learning problems with guarantees. Part 1 teaching convergence theory and algorithm design.

A 66-minute video from Microsoft Research: “Provable Non-convex Projections for High-dimensional Learning Problems - Part1”.

Video by Microsoft Research, played through YouTube's embedded player.