0.25
0.5
0.75
1.25
1.5
1.75
2
On Greedy Maximization of Entropy
Published on 2015-09-271905 Views
Submodular function maximization is one of the key problems that arise in many machine learning tasks. Greedy selection algorithms are the proven choice to solve such problems, where prior theoretical