Research map / Learning theory and algorithms / Submodular and game algorithms
Constrained Robust Submodular Partitioning
Shengjie Wang, Tianyi Zhou, Chandrashekhar Lavania, Jeff Bilmes
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use Min-Block Greedy (Alg. 3) instead of Round-Robin Greedy (Alg. 7) | Constrained robust submodular partitioning · CIFAR-10 train set, matroid constraint | objective value (Eq. 4) | Improved |
| Use Min-Block Greedy or Round-Robin Greedy instead of random class-balanced assignment | Partitioning with matroid constraint · CIFAR-10 train set, matroid constraint | objective value (Eq. 4) | Improved |
| Train ResNet-9 on minibatches from Min-Block or Round-Robin partitions instead of random constrained partitions | ResNet-9 training · CIFAR-10 test set | test accuracy | Improved |
Closest papers by meaning
- Robust Submodular Maximization: A Non-Uniform Partitioning Approach (ICML 2017 · similarity 0.92)
- Constrained Interacting Submodular Groupings (ICML 2018 · similarity 0.90)
- Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach (NeurIPS 2017 · similarity 0.90)
- Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? (ICML 2018 · similarity 0.88)
- Deletion-Robust Submodular Maximization with Knapsack Constraints (AAAI 2024 · similarity 0.87)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
