Greedy and Its Friends
Amin Karbasi
2021 Invited Talk
in
Workshop: Subset Selection in Machine Learning: From Theory to Applications
in
Workshop: Subset Selection in Machine Learning: From Theory to Applications
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.
Video
Chat is not available.
Successful Page Load