{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/submodular-reinforcement-learning","title":"Submodular Reinforcement Learning","arxiv_id":"2307.13372","date":"2023-07-25","proceeding":null,"authors":["Manish Prajapat","Mojmír Mutný","Melanie N. Zeilinger","Andreas Krause"],"abstract":"In reinforcement learning (RL), rewards of states are typically considered additive, and following the Markov assumption, they are $\\textit{independent}$ of states visited previously. In many important applications, such as coverage control, experiment design and informative path planning, rewards naturally have diminishing returns, i.e., their value decreases in light of similar states visited previously. To tackle this, we propose $\\textit{submodular RL}$ (SubRL), a paradigm which seeks to optimize more general, non-additive (and history-dependent) rewards modelled via submodular set functions which capture diminishing returns. Unfortunately, in general, even in tabular settings, we show that the resulting optimization problem is hard to approximate. On the other hand, motivated by the success of greedy algorithms in classical submodular optimization, we propose SubPO, a simple policy gradient-based algorithm for SubRL that handles non-additive rewards by greedily maximizing marginal gains. Indeed, under some assumptions on the underlying Markov Decision Process (MDP), SubPO recovers optimal constant factor approximations of submodular bandits. Moreover, we derive a natural policy gradient approach for locally optimizing SubRL instances even in large state- and action- spaces. We showcase the versatility of our approach by applying SubPO to several applications, such as biodiversity monitoring, Bayesian experiment design, informative path planning, and coverage maximization. Our results demonstrate sample efficiency, as well as scalability to high-dimensional state-action spaces.","url_abs":"https://arxiv.org/abs/2307.13372v2","url_pdf":"https://arxiv.org/pdf/2307.13372v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"submodular-reinforcement-learning","repo_url":"https://github.com/manish-pra/non-additive-rl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2307.13372","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.13372"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/manish-pra/non-additive-rl","reach":null}],"summary":{"ran_draft_wrong":4,"ran_fixture":2,"unverified":1},"by_repo_kind":{"official":{"samples":7,"ran":6,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"a946e2447f35b1ba","entry":"diag_reward_graph","repo":"manish-pra/non-additive-rl","repo_kind":"official","path":"utils/environment.py","file_url":"https://github.com/manish-pra/non-additive-rl/blob/HEAD/utils/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a946e2447f35b1ba"}},{"code_sha256_prefix":"46361cb3c9786ea9","entry":"grid","repo":"manish-pra/non-additive-rl","repo_kind":"official","path":"utils/environment.py","file_url":"https://github.com/manish-pra/non-additive-rl/blob/HEAD/utils/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"46361cb3c9786ea9"}},{"code_sha256_prefix":"205fb19e9e4b2014","entry":"grid_world_graph","repo":"manish-pra/non-additive-rl","repo_kind":"official","path":"utils/environment.py","file_url":"https://github.com/manish-pra/non-additive-rl/blob/HEAD/utils/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"205fb19e9e4b2014"}},{"code_sha256_prefix":"902648f02496c200","entry":"nodes_to_states","repo":"manish-pra/non-additive-rl","repo_kind":"official","path":"utils/environment.py","file_url":"https://github.com/manish-pra/non-additive-rl/blob/HEAD/utils/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"902648f02496c200"}},{"code_sha256_prefix":"e9a4e0a2c071eac3","entry":"room_diag_reward_graph","repo":"manish-pra/non-additive-rl","repo_kind":"official","path":"utils/environment.py","file_url":"https://github.com/manish-pra/non-additive-rl/blob/HEAD/utils/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e9a4e0a2c071eac3"}},{"code_sha256_prefix":"9f874ef6f12f2e1a","entry":"room_grid_world_graph","repo":"manish-pra/non-additive-rl","repo_kind":"official","path":"utils/environment.py","file_url":"https://github.com/manish-pra/non-additive-rl/blob/HEAD/utils/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9f874ef6f12f2e1a"}},{"code_sha256_prefix":"1bcced9f24d991c4","entry":"GridWorld","repo":"manish-pra/non-additive-rl","repo_kind":"official","path":"utils/environment.py","file_url":"https://github.com/manish-pra/non-additive-rl/blob/HEAD/utils/environment.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1bcced9f24d991c4"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}