Research map / Learning theory and algorithms / Submodular and game algorithms
Active-set Methods for Submodular Minimization Problems
K. S. Sesh Kumar, Francis Bach
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 |
|---|---|---|---|
| warm start each projection with the ordered partitions (AAR-WS vs AAR) (ablation) | averaged alternating reflections · Stanford bunny 3D cut | time (seconds): 0.38 -> 0.21 | Improved |
| warm start from the solution with larger lambda when solving several lambda values (ablation) | active-set TV denoising · 2D grid TV denoising | SFM oracle calls | Improved |
| warm start the active-set algorithm (ablation) | active-set TV denoising · 2D grid TV denoising | average oracle complexity | Improved |
| use active-set method instead of Chambolle and Darbon | non-decomposable TV denoising · 2D images of 2e+04 to 2e+07 pixels | number of SFM oracle calls | Improved |
| use active-set method instead of Chambolle and Darbon | non-decomposable TV denoising · 2D images, small sizes | running time | Hurt |
| use warm-started projections (AP-WS, AAR-WS, DAP-WS, ACTIVE) instead of AAR or SGD-P | decomposable 3D cut function SFM/TV · Stanford bunny 3D grid | number of 2D SFM oracle calls | Improved |
| use ACTIVE instead of standard maxflow-mincut | 3D cut function · Stanford bunny 3D cut | time (seconds): 0.11 -> 0.38 | Hurt |
Closest papers by meaning
- Fast Decomposable Submodular Function Minimization using Constrained Total Variation (NeurIPS 2019 · similarity 0.89)
- Optimal approximation for unconstrained non-submodular minimization (ICML 2020 · similarity 0.89)
- Discrete and Continuous Difference of Submodular Minimization (ICML 2025 · similarity 0.89)
- Safe Element Screening for Submodular Function Minimization (ICML 2018 · similarity 0.89)
- Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization (AAAI 2024 · similarity 0.85)
- Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems (NeurIPS 2025 · similarity 0.85)
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.
