Research map / Learning theory and algorithms / Submodular and game algorithms
Learning to Make Decisions via Submodular Regularization
Ayya Alieva, Aiden Aceves, Jialin Song, Stephen Mayo, Yisong Yue, Yuxin Chen
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio (ICML 2019 · similarity 0.87)
- Submodular Reinforcement Learning (ICLR 2024 · similarity 0.87)
- Optimal Sampling Gaps for Adaptive Submodular Maximization (AAAI 2022 · similarity 0.87)
- Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization (ICML 2024 · similarity 0.87)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.86)
- Gradient Methods for Online DR-Submodular Maximization with Stochastic Long-Term Constraints (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.
