Strong and Compact Policies for Submodular Markov Decision Processes via LP-Based Submodular Orienteering

arXiv:2609.15539 · cs.DS, cs.LG · Submitted 2026-09-14 · Read on arXiv

cs.DS, cs.LG

Submitted: 2026-09-14

Updated: 2026-09-14

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Adam — 10× in this paper · explained in 2 episodes
• Reinforcement Learning — 6× in this paper · explained in 4 episodes
• Adaptivity — 4× in this paper · explained in 1 episode
• Reward Function — 4× in this paper · explained in 2 episodes
• Markov Decision Process — 3× in this paper
• Adaptive Algorithm — 1× in this paper · explained in 1 episode
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes
• Markov Decision Process (MDP) — 1× in this paper · explained in 11 episodes
• Objective Function — 1× in this paper · explained in 2 episodes

Sources

• Planning with Submodular Objective Functions

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Edge-Private Matching Kernels Through Local Decoding
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing
• Scalable Algorithms for Approximate DNF Model Counting
• On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions