42 citations · 204 across the 20 of their papers we have counts for
Showing 2019 · cs.LGShow all
2 papers · 2 filters
cs.LG2019★ 32 cited
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam +2
Streaming algorithms are generally judged by the quality of their solution, memory footprint, and computational complexity. In this paper, we study the problem of maximizing a mono…
cs.LG2019★ 5 cited
Adaptive Sequence Submodularity
Marko Mitrovic, Ehsan Kazemi, Moran Feldman +2
In many machine learning applications, one needs to interactively select a sequence of items (e.g., recommending movies based on a user's feedback) or make sequential decisions in…