filmov
tv
10.2 Submodular Functions, Part II
Показать описание
In this lecture we give the basic greedy algorithm, and give the proof by Wolsey, Nemhauser and Fisher stating that if \mathcal{I} is the uniform matroid, and f is a monotone submodular function, then the Greedy algorithm is within a (1-1/e) factor of optimal.
0:30:00
10.3 Submodular Functions, Part III
0:13:51
10.1 Submodular Functions, Part I
0:08:58
5-2 Submodular Maximization
1:26:26
Submodularity and Optimization -- Jeff Bilmes (Part 2)
1:29:54
Submodularity and Optimization -- Jeff Bilmes (Part 1)
0:31:19
Stefanie Jegelka: An introduction to submodularity, Part 2
1:39:38
Lecture 10, Submodular Functions, Optimization, & Applications to Machine Learning
0:29:10
Quotient Sparsification for Submodular Functions
0:29:46
On optimizing a submodular utility function Part2
0:34:41
Nonconvex Optimization for High-dimensional Learning: From ReLUs to Submodular Maximization
1:44:29
EE596B Lecture 2, Submodular Functions, Optimization, and Applications to Machine Learning
1:27:39
Submodularity and Optimization -- Jeff Bilmes (Part 3)
1:03:53
Interactive Learning of Mixtures of Submodular Functions
1:06:05
Seffi Naor: Recent Results on Maximizing Submodular Functions
0:53:58
Beyond Submodular Maximization via One-Sided Smoothness and Meta-Submodularity
0:02:37
Optimal Distributed Submodular Optimization via Sketching
0:59:18
Submodular Optimization
0:46:46
From Minimum Cut to Submodular Minimization: Leveraging the Decomposable Structure
1:34:20
EE596B Lecture 4, Submodular Functions, Optimization, and Applications to Machine Learning
1:18:53
Jan Vondrak - Submodular Functions and Their Applications
0:33:26
On optimizing a submodular utility function Part1
1:00:40
Stefanie Jegelka: An introduction to Submodularity, Part 1
1:39:30
Lecture 13, Submodular Functions, Optimization, & Applications to Machine Learning
1:34:32
IJCAI 2020 Tutorial Part I: Submodular Optimization for Data, Feature, and Topic Summarization.
Комментарии