subdeterminant maximization via nonconvex relaxations and anti-concentration
Published 7 years ago • 424 plays • Length 34:27Download video MP4
Download video MP3
Similar videos
-
34:41
nonconvex optimization for high-dimensional learning: from relus to submodular maximization
-
53:58
beyond submodular maximization via one-sided smoothness and meta-submodularity
-
46:46
from minimum cut to submodular minimization: leveraging the decomposable structure
-
34:39
lp relaxations for reordering buffer management
-
1:36:31
sub-linear time algorithms: fast, cheap and (only a little) out of control
-
29:13
maximizing sub-determinants and connections to permanents and inequalities on stable polynomials
-
2:36
witnessing non-classicality with weighted graphs
-
32:23
recent progress on submodular function minimization
-
44:08
patrick henning: multiscale approximations for the stationary ginzburg-landau equation
-
26:30
sharp matrix concentration
-
1:32:51
lecture 22: non monotone submodular maximisation 1
-
43:30
structured sparsity-inducing norms through submodular functions
-
1:12:12
fragmentation pseudo-metrics and lagrangian submanifolds - octav cornea
-
32:01
advanced techniques for low-rank matrix approximation
-
51:26
nonconvex optimization for high dimensional learning: from phase retrieval to submodular maximizatio