{"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/asynchronous-episodic-deep-deterministic","title":"Asynchronous Episodic Deep Deterministic Policy Gradient: Towards Continuous Control in Computationally Complex Environments","arxiv_id":"1903.00827","date":"2019-03-03","proceeding":null,"authors":["Zhizheng Zhang","Jiale Chen","Zhibo Chen","Weiping Li"],"abstract":"Deep Deterministic Policy Gradient (DDPG) has been proved to be a successful\nreinforcement learning (RL) algorithm for continuous control tasks. However,\nDDPG still suffers from data insufficiency and training inefficiency,\nespecially in computationally complex environments. In this paper, we propose\nAsynchronous Episodic DDPG (AE-DDPG), as an expansion of DDPG, which can\nachieve more effective learning with less training time required. First, we\ndesign a modified scheme for data collection in an asynchronous fashion.\nGenerally, for asynchronous RL algorithms, sample efficiency or/and training\nstability diminish as the degree of parallelism increases. We consider this\nproblem from the perspectives of both data generation and data utilization. In\ndetail, we re-design experience replay by introducing the idea of episodic\ncontrol so that the agent can latch on good trajectories rapidly. In addition,\nwe also inject a new type of noise in action space to enrich the exploration\nbehaviors. Experiments demonstrate that our AE-DDPG achieves higher rewards and\nrequires less time consuming than most popular RL algorithms in Learning to Run\ntask which has a computationally complex environment. Not limited to the\ncontrol tasks in computationally complex environments, AE-DDPG also achieves\nhigher rewards and 2- to 4-fold improvement in sample efficiency on average\ncompared to other variants of DDPG in MuJoCo environments. Furthermore, we\nverify the effectiveness of each proposed technique component through abundant\nablation study.","url_abs":"http://arxiv.org/abs/1903.00827v1","url_pdf":"http://arxiv.org/pdf/1903.00827v1.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":"asynchronous-episodic-deep-deterministic","repo_url":"https://github.com/anita-hu/TF2-RL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"continuous-control","task_name":"Continuous Control"},{"task_slug":"mujoco","task_name":"MuJoCo"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"continuous-control","task_name":"continuous-control"}],"methods":[{"method_slug":"adam","method_name":"Adam"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"ddpg","method_name":"DDPG"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"experience-replay","method_name":"Experience Replay"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"weight-decay","method_name":"Weight Decay"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.00827","atlas_url":"https://app.syntology.ai/?focus=1903.00827","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":"1903.00827"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.00827\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.00827"},"call":"get_concepts_for_paper(arxiv_id=\"1903.00827\")"}],"by_repo":[{"repo":"anita-hu/TF2-RL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1312.5602","1509.02971"],"harvested_for_calls":[{"arxiv_id":"1312.5602","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1312.5602"},"call":"get_harvested_code_for_paper(arxiv_id=\"1312.5602\")"},{"arxiv_id":"1509.02971","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1509.02971"},"call":"get_harvested_code_for_paper(arxiv_id=\"1509.02971\")"}]}],"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":"776c03646f7c8a57da7f6c4ea90587abba16cfcd55764c1dc302ba5804c582dd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}