{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/dd-ppo","slug":"dd-ppo","name":"DD-PPO","full_name":"Decentralized Distributed Proximal Policy Optimization","full_name_withheld":false,"description_markdown":"**Decentralized Distributed Proximal Policy Optimization (DD-PPO)** is a method for distributed reinforcement learning in resource-intensive simulated environments. DD-PPO is distributed (uses multiple machines), decentralized (lacks a centralized server), and synchronous (no computation is ever `stale'), making it conceptually simple and easy to implement. \r\n\r\nProximal Policy Optimization, or [PPO](https://paperswithcode.com/method/ppo), is a policy gradient method for reinforcement learning. The motivation was to have an algorithm with the data efficiency and reliable performance of [TRPO](https://paperswithcode.com/method/trpo), while using only first-order optimization. \r\n\r\nLet $r\\_{t}\\left(\\theta\\right)$ denote the probability ratio $r\\_{t}\\left(\\theta\\right) = \\frac{\\pi\\_{\\theta}\\left(a\\_{t}\\mid{s\\_{t}}\\right)}{\\pi\\_{\\theta\\_{old}}\\left(a\\_{t}\\mid{s\\_{t}}\\right)}$, so $r\\left(\\theta\\_{old}\\right) = 1$. TRPO maximizes a “surrogate” objective:\r\n\r\n$$ L^{v}\\left({\\theta}\\right) = \\hat{\\mathbb{E}}\\_{t}\\left[\\frac{\\pi\\_{\\theta}\\left(a\\_{t}\\mid{s\\_{t}}\\right)}{\\pi\\_{\\theta\\_{old}}\\left(a\\_{t}\\mid{s\\_{t}}\\right)})\\hat{A}\\_{t}\\right] = \\hat{\\mathbb{E}}\\_{t}\\left[r\\_{t}\\left(\\theta\\right)\\hat{A}\\_{t}\\right] $$\r\n\r\nAs a general abstraction, DD-PPO implements the following:\r\nat step $k$, worker $n$ has a copy of the parameters, $\\theta^k_n$, calculates the gradient, $\\delta \\theta^k_n$, and updates $\\theta$ via \r\n\r\n$$ \\theta^{k+1}\\_n =  \\text{ParamUpdate}\\Big(\\theta^{k}\\_n, \\text{AllReduce}\\big(\\delta \\theta^k\\_1, \\ldots, \\delta \\theta^k\\_N\\big)\\Big) = \\text{ParamUpdate}\\Big(\\theta^{k}\\_n, \\frac{1}{N}  \\sum_{i=1}^{N} { \\delta \\theta^k_i}   \\Big) $$\r\n\r\nwhere $\\text{ParamUpdate}$ is any first-order optimization technique (e.g. gradient descent) and $\\text{AllReduce}$ performs a reduction (e.g. mean) over all copies of a variable and returns the result to all workers.\r\nDistributed DataParallel scales very well (near-linear scaling up to 32,000 GPUs), and is reasonably simple to implement (all workers synchronously running identical code).","description_state":"present","introduced_year":null,"introduced_by":{"title":"DD-PPO: Learning Near-Perfect PointGoal Navigators from 2.5 Billion Frames","paper":"/paper/decentralized-distributed-ppo-solving","first_author":"Erik Wijmans","n_authors":8,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/decentralized-distributed-ppo-solving"},"source":{"url":"https://arxiv.org/abs/1911.00357v2","title":"DD-PPO: Learning Near-Perfect PointGoal Navigators from 2.5 Billion Frames","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"Distributed Reinforcement Learning","url":"/methods/category/distributed-reinforcement-learning","pwc_aliases":[]}],"n_papers_tagged":8,"archive_num_papers":8,"papers_newest_first":[{"paper":null,"slug":"decentralized-distributed-proximal-policy","title":"Decentralized Distributed Proximal Policy Optimization (DD-PPO) for High Performance Computing Scheduling on Multi-User Systems","date":"2025-05-06","arxiv_id":"2505.03946","n_code_links":0,"syntology":null},{"paper":"/paper/sharing-lifelong-reinforcement-learning","slug":"sharing-lifelong-reinforcement-learning","title":"Sharing Lifelong Reinforcement Learning Knowledge via Modulating Masks","date":"2023-05-18","arxiv_id":"2305.10997","n_code_links":2,"syntology":null},{"paper":"/paper/comparison-of-model-free-and-model-based","slug":"comparison-of-model-free-and-model-based","title":"Comparison of Model-Free and Model-Based Learning-Informed Planning for PointGoal Navigation","date":"2022-12-17","arxiv_id":"2212.08801","n_code_links":1,"syntology":null},{"paper":"/paper/ver-scaling-on-policy-rl-leads-to-the","slug":"ver-scaling-on-policy-rl-leads-to-the","title":"VER: Scaling On-Policy RL Leads to the Emergence of Navigation in Embodied Rearrangement","date":"2022-10-11","arxiv_id":"2210.05064","n_code_links":1,"syntology":null},{"paper":"/paper/uncertainty-driven-planner-for-exploration","slug":"uncertainty-driven-planner-for-exploration","title":"Uncertainty-driven Planner for Exploration and Navigation","date":"2022-02-24","arxiv_id":"2202.11907","n_code_links":1,"syntology":null},{"paper":"/paper/integrating-egocentric-localization-for-more","slug":"integrating-egocentric-localization-for-more","title":"Integrating Egocentric Localization for More Realistic Point-Goal Navigation Agents","date":"2020-09-07","arxiv_id":"2009.03231","n_code_links":0,"syntology":null},{"paper":"/paper/auxiliary-tasks-speed-up-learning-pointgoal","slug":"auxiliary-tasks-speed-up-learning-pointgoal","title":"Auxiliary Tasks Speed Up Learning PointGoal Navigation","date":"2020-07-09","arxiv_id":"2007.04561","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["joel99/habitat-pointnav-aux"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/decentralized-distributed-ppo-solving","slug":"decentralized-distributed-ppo-solving","title":"DD-PPO: Learning Near-Perfect PointGoal Navigators from 2.5 Billion Frames","date":"2019-11-01","arxiv_id":"1911.00357","n_code_links":8,"syntology":null}],"papers_shown":8,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":8,"with_a_code_link":6,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":8,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/dd-ppo/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/dd-ppo/papers/ran/1","json":"/method/dd-ppo/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/navigate","name":"Navigate","papers":4},{"task":"/task/pointgoal-navigation","name":"PointGoal Navigation","papers":4},{"task":null,"name":"GPU","papers":3},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":3},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":2},{"task":"/task/robot-navigation","name":"Robot Navigation","papers":2},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":2},{"task":"/task/autonomous-navigation","name":"Autonomous Navigation","papers":1},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":1},{"task":"/task/lifelong-learning","name":"Lifelong learning","papers":1},{"task":"/task/objectgoal-navigation","name":"ObjectGoal Navigation","papers":1},{"task":"/task/out-of-distribution-generalization","name":"Out-of-Distribution Generalization","papers":1},{"task":"/task/problem-decomposition","name":"Problem Decomposition","papers":1},{"task":"/task/scene-understanding","name":"Scene Understanding","papers":1},{"task":"/task/scheduling","name":"Scheduling","papers":1},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":1},{"task":"/task/visual-odometry","name":"Visual Odometry","papers":1},{"task":"/task/model","name":"model","papers":1}],"tasks_shown":18,"n_tasks":18,"usage_by_year":[{"year":"2019","papers":1},{"year":"2020","papers":2},{"year":"2022","papers":3},{"year":"2023","papers":1},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/dd-ppo"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=DD-PPO","read_at":"2026-10-05T00:54:31+00:00","query":"DD-PPO","kind":"paper","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1911.00357","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":true,"bearers_found":2,"served":null,"leading_other_bearer":{"arxiv_id":"1911.00357","title":"DD-PPO: Learning Near-Perfect PointGoal Navigators from 2.5 Billion Frames","citations":663,"named_by":["title_prefix"],"bearer_name":"DD-PPO: Learning Near-Perfect PointGoal Navigators from 2.5 Billion Frames","ask_with":"have('1911.00357')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'DD-PPO' by name, but 2 thing(s) here DECLARE that name -- most cited: the paper 'DD-PPO: Learning Near-Perfect PointGoal Navigators from 2.5 Billion Frames' (arXiv:1911.00357, 663 citations). That is a RESOLUTION miss, not a coverage gap: the corpus holds the name under a spelling the lookup did not reach. Ask again with an entry of `also_named`."},"name_competition_text":"Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is the paper “DD-PPO: Learning Near-Perfect PointGoal Navigators from 2.5 Billion Frames” (arXiv:1911.00357, 663 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach.","near_matches":["CADDTO-PPO"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"3cc1dff54a084faf1d3c8976a8ac54803d46464d03969e5bc1709cd9f85e1cc5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}