Workshop: Subset Selection in Machine Learning: From Theory to Applications
Greedy and Its Friends
[ Abstract ]
In this talk, I will introduce 3 close friends of the greedy algorithm who can maximize a general submodular function (monotone or not) subject to very general constraints. They come in different flavors and guarantees.