Research map / Learning theory and algorithms / Submodular and game algorithms
Multiobjective Submodular Maximization with Concave Aggregation
Fabian Spaeh, Atsushi Miyauchi
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Studies multiobjective submodular maximization using a concave aggregation of submodular objectives instead of the conservative max-min formulation.
Problem
Multiobjective submodular maximization seeks one set performing well across several submodular objectives; the standard max-min formulation is overly conservative because it depends only on the worst objective.
Approach
Replaces max-min aggregation with a concave function applied to the multiple submodular objectives, so improvements in non-minimum objectives still count.
Closest papers by meaning
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · similarity 0.92)
- Instance Specific Approximations for Submodular Maximization (ICML 2021 · similarity 0.89)
- Efficient Submodular Maximization for Sums of Concave over Modular Functions (ICLR 2026 · similarity 0.89)
- Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee (AAAI 2021 · similarity 0.89)
- From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization (NeurIPS 2024 · similarity 0.87)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.86)
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.
