42 citations · 96 across the 11 of their papers we have counts for
4 papers · 1 filter
A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians
Aleksander Mądry, Slobodan Mitrović, Ludwig Schmidt
Sparsity-based methods are widely used in machine learning, statistics, and signal processing. There is now a rich class of structured sparsity approaches that expand the modeling…
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
Slobodan Mitrović, Ilija Bogunovic, Ashkan Norouzi-Fard +2
We study the classical problem of maximizing a monotone submodular function subject to a cardinality constraint k, with two additional twists: (i) elements arrive in a streaming fa…
Round Compression for Parallel Matching Algorithms
Artur Czumaj, Jakub Łącki, Aleksander Mądry +3
For over a decade now we have been witnessing the success of {\em massive parallel computation} (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the reasons for…
Robust Submodular Maximization: A Non-Uniform Partitioning Approach
Ilija Bogunovic, Slobodan Mitrović, Jonathan Scarlett +1
We study the problem of maximizing a monotone submodular function subject to a cardinality constraint , with the added twist that a number of items from the returned set may…