{"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/transfer-among-agents-an-efficient-multiagent-1","title":"An Efficient Transfer Learning Framework for Multiagent Reinforcement Learning","arxiv_id":"2002.08030","date":"2020-02-19","proceeding":null,"authors":["Tianpei Yang","Weixun Wang","Hongyao Tang","Jianye Hao","Zhaopeng Meng","Hangyu Mao","Dong Li","Wulong Liu","Chengwei Zhang","Yujing Hu","Yingfeng Chen","Changjie Fan"],"abstract":"Transfer Learning has shown great potential to enhance single-agent Reinforcement Learning (RL) efficiency. Similarly, Multiagent RL (MARL) can also be accelerated if agents can share knowledge with each other. However, it remains a problem of how an agent should learn from other agents. In this paper, we propose a novel Multiagent Policy Transfer Framework (MAPTF) to improve MARL efficiency. MAPTF learns which agent's policy is the best to reuse for each agent and when to terminate it by modeling multiagent policy transfer as the option learning problem. Furthermore, in practice, the option module can only collect all agent's local experiences for update due to the partial observability of the environment. While in this setting, each agent's experience may be inconsistent with each other, which may cause the inaccuracy and oscillation of the option-value's estimation. Therefore, we propose a novel option learning algorithm, the successor representation option learning to solve it by decoupling the environment dynamics from rewards and learning the option-value under each agent's preference. MAPTF can be easily combined with existing deep RL and MARL approaches, and experimental results show it significantly boosts the performance of existing methods in both discrete and continuous state spaces.","url_abs":"https://arxiv.org/abs/2002.08030v4","url_pdf":"https://arxiv.org/pdf/2002.08030v4.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":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"transfer-among-agents-an-efficient-multiagent-1","repo_url":"https://github.com/tianpeiyang/maptf_code","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2002.08030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08030"}},"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/tianpeiyang/MAPTF_code","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/tianpeiyang/maptf_code","reach":{"status":"ok"}}],"summary":{"ran":1,"unverified":2},"by_repo_kind":{"official":{"samples":3,"ran":1,"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":3,"samples":[{"code_sha256_prefix":"a6dfa17c8b218bdd","entry":"ReplayBuffer","repo":"tianpeiyang/maptf_code","repo_kind":"official","path":"alg/option/option_ma_sro.py","file_url":"https://github.com/tianpeiyang/maptf_code/blob/HEAD/alg/option/option_ma_sro.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a6dfa17c8b218bdd"}},{"code_sha256_prefix":"7c8f3673bee00fb7","entry":"Optimizer","repo":"tianpeiyang/maptf_code","repo_kind":"official","path":"alg/option/option_ma_sro.py","file_url":"https://github.com/tianpeiyang/maptf_code/blob/HEAD/alg/option/option_ma_sro.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7c8f3673bee00fb7"}},{"code_sha256_prefix":"d3f5bfed252de70a","entry":"SROption","repo":"tianpeiyang/maptf_code","repo_kind":"official","path":"alg/option/option_ma_sro.py","file_url":"https://github.com/tianpeiyang/maptf_code/blob/HEAD/alg/option/option_ma_sro.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d3f5bfed252de70a"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}