HackerTube 中文?

Lecture 1 | Convex Optimization I (Stanford)

StanfordYouTube ↗

Further reading 1

How much does a successful demonstration establish? →A program gives the expected output. Between “it did” and “it will” lie the test distribution, formal assumptions and deployment context. Those boundaries are easy to miss under pressure to ship.This video helps answer · What kind of solution did the solver find?

Caption notes

Boyd separates finding a local solution from obtaining a global guarantee. Convexity supplies structure, although some nonconvex problems also admit specialized global solutions.

Video or transcript source ↗
Original passages · 2
they say well it's a local solution
Lecture 1 | Convex Optimization I (Stanford) · ▶ 34:04–34:08
we can solve it and we get the exact Global solution end of story by singular values
Lecture 1 | Convex Optimization I (Stanford) · ▶ 38:44–38:54

Hacker News comments

View original on HN ↗