Research map / Learning theory and algorithms / Submodular and game algorithms
Regret Ratio Minimization in Multi-Objective Submodular Function Maximization
Tasuku Soma, Yuichi Yoshida
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 polytope method instead of random directions | family of representative solutions · MovieLens movie summarization | estimated regret ratio: around 0.2 -> around 0.001 at k=20 | Improved |
| use polytope method instead of coordinate-wise maximum | family of representative solutions · MovieLens movie summarization | estimated regret ratio: around 0.2 -> around 0.001 | Improved |
| use polytope method instead of baselines | family of representative solutions · synthetic budget allocation | estimated regret ratio | Improved |
| increase output family size k for polytope method (ablation) | family of representative solutions · MovieLens movie summarization | estimated regret ratio | Improved |
| increase output family size k for random directions (ablation) | family of representative solutions · MovieLens movie summarization | estimated regret ratio: stagnates around 0.2 | No clear effect |
Closest papers by meaning
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.88)
- From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization (NeurIPS 2024 · similarity 0.87)
- Nearly Minimax Optimal Submodular Maximization with Bandit Feedback (NeurIPS 2024 · similarity 0.87)
- Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems (NeurIPS 2025 · similarity 0.87)
- Preference Optimization on Pareto Sets: On a Theory of Multi-Objective Optimization (NeurIPS 2025 · similarity 0.86)
- FERERO: A Flexible Framework for Preference-Guided Multi-Objective Learning (NeurIPS 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.
