{"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":"/paper/decentralized-distributed-ppo-solving","title":"DD-PPO: Learning Near-Perfect PointGoal Navigators from 2.5 Billion Frames","arxiv_id":"1911.00357","date":"2019-11-01","proceeding":"ICLR 2020 1","authors":["Erik Wijmans","Abhishek Kadian","Ari Morcos","Stefan Lee","Irfan Essa","Devi Parikh","Manolis Savva","Dhruv Batra"],"abstract":"We present Decentralized Distributed Proximal Policy Optimization (DD-PPO), 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. In our experiments on training virtual robots to navigate in Habitat-Sim, DD-PPO exhibits near-linear scaling -- achieving a speedup of 107x on 128 GPUs over a serial implementation. We leverage this scaling to train an agent for 2.5 Billion steps of experience (the equivalent of 80 years of human experience) -- over 6 months of GPU-time training in under 3 days of wall-clock time with 64 GPUs. This massive-scale training not only sets the state of art on Habitat Autonomous Navigation Challenge 2019, but essentially solves the task --near-perfect autonomous navigation in an unseen environment without access to a map, directly from an RGB-D camera and a GPS+Compass sensor. Fortuitously, error vs computation exhibits a power-law-like distribution; thus, 90% of peak performance is obtained relatively early (at 100 million steps) and relatively cheaply (under 1 day with 8 GPUs). Finally, we show that the scene understanding and navigation policies learned can be transferred to other navigation tasks -- the analog of ImageNet pre-training + task-specific fine-tuning for embodied AI. Our model outperforms ImageNet pre-trained CNNs on these transfer tasks and can serve as a universal resource (all models and code are publicly available).","url_abs":"https://arxiv.org/abs/1911.00357v2","url_pdf":"https://arxiv.org/pdf/1911.00357v2.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":"decentralized-distributed-ppo-solving","repo_url":"https://github.com/facebookresearch/habitat-api","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"decentralized-distributed-ppo-solving","repo_url":"https://github.com/GT-RIPL/robo-vln","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"decentralized-distributed-ppo-solving","repo_url":"https://github.com/allenai/robothor-challenge","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"decentralized-distributed-ppo-solving","repo_url":"https://github.com/facebookresearch/habitat-api/tree/master/habitat_baselines/rl/ddppo","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"decentralized-distributed-ppo-solving","repo_url":"https://github.com/jacobkrantz/VLN-CE","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"decentralized-distributed-ppo-solving","repo_url":"https://github.com/yangysc/resinet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"decentralized-distributed-ppo-solving","repo_url":"https://github.com/opendilab/DI-engine","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"decentralized-distributed-ppo-solving","repo_url":"https://github.com/ray-project/ray/tree/master/rllib","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"autonomous-navigation","task_name":"Autonomous Navigation"},{"task_slug":null,"task_name":"GPU"},{"task_slug":"navigate","task_name":"Navigate"},{"task_slug":"pointgoal-navigation","task_name":"PointGoal Navigation"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"robot-navigation","task_name":"Robot Navigation"},{"task_slug":"scene-understanding","task_name":"Scene Understanding"}],"methods":[{"method_slug":"dd-ppo","method_name":"DD-PPO"}],"datasets_introduced":[],"methods_introduced":[{"slug":"dd-ppo","name":"DD-PPO","full_name":"Decentralized Distributed Proximal Policy Optimization"}],"results":[{"leaderboard":"/sota/pointgoal-navigation-on-gibson-pointgoal","task":"PointGoal Navigation","dataset":"Gibson PointGoal Navigation","model":"Depth DDPPO","rank_in_archive_order":1,"of":2,"metrics":{"spl":"0.917"},"uses_additional_data":false},{"leaderboard":"/sota/robot-navigation-on-habitat-2020-object-nav-1","task":"Robot Navigation","dataset":"Habitat 2020 Object Nav test-std","model":"RGBD+DD-PPO","rank_in_archive_order":6,"of":13,"metrics":{"DISTANCE_TO_GOAL":"9.31617","SOFT_SPL":"0.14718","SPL":"0.02119","SUCCESS":"0.06165"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1911.00357","atlas_url":"https://app.syntology.ai/?focus=1911.00357","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1911.00357"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1911.00357\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1911.00357"},"call":"get_concepts_for_paper(arxiv_id=\"1911.00357\")"}],"by_repo":[{"repo":"facebookresearch/habitat-api","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2310.13724"],"harvested_for_calls":[{"arxiv_id":"2310.13724","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2310.13724"},"call":"get_harvested_code_for_paper(arxiv_id=\"2310.13724\")"}]},{"repo":"GT-RIPL/robo-vln","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2108.11945"],"harvested_for_calls":[{"arxiv_id":"2108.11945","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2108.11945"},"call":"get_harvested_code_for_paper(arxiv_id=\"2108.11945\")"}]},{"repo":"allenai/robothor-challenge","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2103.16544"],"harvested_for_calls":[{"arxiv_id":"2103.16544","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.16544"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.16544\")"}]},{"repo":"jacobkrantz/VLN-CE","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2110.02207"],"harvested_for_calls":[{"arxiv_id":"2110.02207","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.02207"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.02207\")"}]},{"repo":"yangysc/resinet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"opendilab/DI-engine","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1707.01495","1901.02860","2106.01345","2304.12824"],"harvested_for_calls":[{"arxiv_id":"1707.01495","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1707.01495"},"call":"get_harvested_code_for_paper(arxiv_id=\"1707.01495\")"},{"arxiv_id":"1901.02860","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1901.02860"},"call":"get_harvested_code_for_paper(arxiv_id=\"1901.02860\")"},{"arxiv_id":"2106.01345","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.01345"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.01345\")"},{"arxiv_id":"2304.12824","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2304.12824"},"call":"get_harvested_code_for_paper(arxiv_id=\"2304.12824\")"}]},{"repo":"ray-project/ray","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2bba374dbdb7daa8703f894a78e8e4e05d42797bfdc49625add7bcdfc9cd93b6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}