AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Constrained Robust Submodular Partitioning

Shengjie Wang, Tianyi Zhou, Chandrashekhar Lavania, Jeff Bilmes

NeurIPS 2021 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 3 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use Min-Block Greedy (Alg. 3) instead of Round-Robin Greedy (Alg. 7)Constrained robust submodular partitioning · CIFAR-10 train set, matroid constraintobjective value (Eq. 4)Improved
Use Min-Block Greedy or Round-Robin Greedy instead of random class-balanced assignmentPartitioning with matroid constraint · CIFAR-10 train set, matroid constraintobjective value (Eq. 4)Improved
Train ResNet-9 on minibatches from Min-Block or Round-Robin partitions instead of random constrained partitionsResNet-9 training · CIFAR-10 test settest accuracyImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy