Research map / Learning theory and algorithms / Submodular and game algorithms
Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee
Chao Feng, Chao Qian
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 |
|---|---|---|---|
| sample representative weight vectors and optimize their weighted sums, while also optimizing each individual objective | RRMS · Multi-objective weighted maximum coverage; d from 2 to 7 | estimated regret ratio | Mixed |
| sample representative weight vectors and optimize their weighted sums, while also optimizing each individual objective | RRMS · Multi-objective weighted Max-Cut; d from 2 to 7 | estimated regret ratio | Mixed |
| remove the initial solutions obtained by optimizing each individual objective (ablation) | RRMS · Multi-objective weighted maximum coverage and weighted Max-Cut | estimated regret ratio | Hurt |
| use only solutions from independently optimizing each individual objective, without sampled weighted sums (ablation) | RRMS · Multi-objective weighted maximum coverage and weighted Max-Cut | estimated regret ratio | Hurt |
Closest papers by meaning
- From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization (NeurIPS 2024 · similarity 0.89)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.89)
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · similarity 0.88)
- Optimal Scalarizations for Sublinear Hypervolume Regret (NeurIPS 2024 · similarity 0.88)
- Nearly Minimax Optimal Submodular Maximization with Bandit Feedback (NeurIPS 2024 · similarity 0.87)
- Online Submodular Maximization via Online Convex Optimization (AAAI 2024 · 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.
