Invited Talk
Workshop: Subset Selection in Machine Learning: From Theory to Applications

Greedy and Its Friends

Amin Karbasi

[ Abstract ]
Sat 24 Jul 8:30 a.m. PDT — 8:51 a.m. PDT


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.