{"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/unveiling-options-with-neural-decomposition","title":"Unveiling Options with Neural Decomposition","arxiv_id":"2410.11262","date":"2024-10-15","proceeding":null,"authors":["Mahdi Alikhasi","Levi H. S. Lelis"],"abstract":"In reinforcement learning, agents often learn policies for specific tasks without the ability to generalize this knowledge to related tasks. This paper introduces an algorithm that attempts to address this limitation by decomposing neural networks encoding policies for Markov Decision Processes into reusable sub-policies, which are used to synthesize temporally extended actions, or options. We consider neural networks with piecewise linear activation functions, so that they can be mapped to an equivalent tree that is similar to oblique decision trees. Since each node in such a tree serves as a function of the input of the tree, each sub-tree is a sub-policy of the main policy. We turn each of these sub-policies into options by wrapping it with while-loops of varied number of iterations. Given the large number of options, we propose a selection mechanism based on minimizing the Levin loss for a uniform policy on these options. Empirical results in two grid-world domains where exploration can be difficult confirm that our method can identify useful options, thereby accelerating the learning process on similar but different tasks.","url_abs":"https://arxiv.org/abs/2410.11262v1","url_pdf":"https://arxiv.org/pdf/2410.11262v1.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":[],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2410.11262","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.11262"}},"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":"deterministic:regex_extraction","url":"https://github.com/arcosin/Doric","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"deterministic:regex_extraction","url":"https://github.com/mklissa/dceo","reach":null},{"provenance":"deterministic:regex_extraction","url":"https://github.com/dlpbc/mask-lrl","reach":null}],"summary":{"ran":1,"unverified":2},"by_repo_kind":{"found_in_text":{"samples":3,"ran":1,"repositories":2}},"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":"f5f2b5781d486f30","entry":"NMNet","repo":"dlpbc/mask-lrl","repo_kind":"found_in_text","path":"deep_rl/mask_modules/mmn/nm_net.py","file_url":"https://github.com/dlpbc/mask-lrl/blob/HEAD/deep_rl/mask_modules/mmn/nm_net.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"f5f2b5781d486f30"}},{"code_sha256_prefix":"de90fc9b7aab7e09","entry":"enumerateFloatTensor","repo":"arcosin/Doric","repo_kind":"found_in_text","path":"UtilityFunctions.py","file_url":"https://github.com/arcosin/Doric/blob/HEAD/UtilityFunctions.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":"de90fc9b7aab7e09"}},{"code_sha256_prefix":"5a853c1191b7f38e","entry":"getNBiggestWeights","repo":"arcosin/Doric","repo_kind":"found_in_text","path":"UtilityFunctions.py","file_url":"https://github.com/arcosin/Doric/blob/HEAD/UtilityFunctions.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":"5a853c1191b7f38e"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}