Can Non-Convex Optimization be Robust?
2,257 views · Published 1 November 2018 · 45:43 · Indexed 20 September 2026
Channel: Simons Institute for the Theory of Computing · 2018 · Education
Rong Ge (Duke University) https://simons.berkeley.edu/talks/can-non-convex-optimization-be-robust Robust and High-Dimensional Statistics
More from this channel
-
29:08
An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
-
34:02
Modelling Gene Expression Dynamics with Gaussian Processes
-
37:26
Telomere Length, Nature and Nurture
-
44:30
Sum of Squares SDP Relaxations on Random Tensors
-
1:05:05
Beyond Worst-Case Analysis II
-
1:04:11
Logic and Databases II
-
35:26
Operations on Languages and Codensity Monads
-
35:19
Logic and Bisimulation for Guarded Teams