{"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/dpg","slug":"dpg","name":"DPG","full_name":"Deterministic Policy Gradient","full_name_withheld":false,"description_markdown":"**Deterministic Policy Gradient**, or **DPG**, is a policy gradient method for reinforcement learning. Instead of the policy function $\\pi\\left(.\\mid{s}\\right)$ being modeled as a probability distribution, DPG considers and calculates gradients for a deterministic policy $a = \\mu\\_{theta}\\left(s\\right)$.","description_state":"present","introduced_year":2014,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"Policy Gradient Methods","url":"/methods/category/policy-gradient-methods","pwc_aliases":[]}],"n_papers_tagged":20,"archive_num_papers":20,"papers_newest_first":[{"paper":null,"slug":"dpg-loss-functions-for-learning-parameter-to","title":"DPG loss functions for learning parameter-to-solution maps by neural networks","date":"2025-06-23","arxiv_id":"2506.18773","n_code_links":0,"syntology":null},{"paper":"/paper/reasongen-r1-cot-for-autoregressive-image","slug":"reasongen-r1-cot-for-autoregressive-image","title":"ReasonGen-R1: CoT for Autoregressive Image generation models through SFT and RL","date":"2025-05-30","arxiv_id":"2505.24875","n_code_links":1,"syntology":{"ran":7,"of":13,"n_ran_checked":3,"n_instrument":4,"unverified":6,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","official":null}},{"paper":null,"slug":"harnessing-caption-detailness-for-data","title":"Harnessing Caption Detailness for Data-Efficient Text-to-Image Generation","date":"2025-05-21","arxiv_id":"2505.15172","n_code_links":0,"syntology":null},{"paper":null,"slug":"double-privacy-guard-robust-traceable","title":"DIP-Watermark: A Double Identity Protection Method Based on Robust Adversarial Watermark","date":"2024-04-23","arxiv_id":"2404.14693","n_code_links":0,"syntology":null},{"paper":"/paper/dynamic-generation-of-personalities-with","slug":"dynamic-generation-of-personalities-with","title":"Dynamic Generation of Personalities with Large Language Models","date":"2024-04-10","arxiv_id":"2404.07084","n_code_links":1,"syntology":null},{"paper":null,"slug":"decision-predicate-graphs-enhancing","title":"Decision Predicate Graphs: Enhancing Interpretability in Tree Ensembles","date":"2024-04-03","arxiv_id":"2404.02942","n_code_links":0,"syntology":null},{"paper":null,"slug":"brain-bayesian-reward-conditioned-amortized","title":"BRAIn: Bayesian Reward-conditioned Amortized Inference for natural language generation from feedback","date":"2024-02-04","arxiv_id":"2402.02479","n_code_links":0,"syntology":null},{"paper":null,"slug":"dual-based-online-learning-of-dynamic-network","title":"Dual-based Online Learning of Dynamic Network Topologies","date":"2022-11-14","arxiv_id":"2211.07449","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-sparse-r-cnn","title":"Dynamic Sparse R-CNN","date":"2022-05-04","arxiv_id":"2205.02101","n_code_links":0,"syntology":null},{"paper":"/paper/controlling-conditional-language-models-with","slug":"controlling-conditional-language-models-with","title":"Controlling Conditional Language Models without Catastrophic Forgetting","date":"2021-12-01","arxiv_id":"2112.00791","n_code_links":2,"syntology":{"ran":7,"of":8,"n_ran_checked":5,"n_instrument":2,"unverified":1,"pointer_only":4,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["naver/gdc"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"mpc-based-reinforcement-learning-for-a","title":"MPC-based Reinforcement Learning for a Simplified Freight Mission of Autonomous Surface Vehicles","date":"2021-06-16","arxiv_id":"2106.08634","n_code_links":0,"syntology":null},{"paper":"/paper/deep-reinforcement-agent-for-scheduling-in","slug":"deep-reinforcement-agent-for-scheduling-in","title":"Deep Reinforcement Agent for Scheduling in HPC","date":"2021-02-11","arxiv_id":"2102.06243","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-survey-of-motion-planning-algorithms-for","title":"A review of motion planning algorithms for intelligent robotics","date":"2021-02-04","arxiv_id":"2102.02376","n_code_links":0,"syntology":null},{"paper":"/paper/offcon-3-what-is-state-of-the-art-anyway","slug":"offcon-3-what-is-state-of-the-art-anyway","title":"OffCon$^3$: What is state of the art anyway?","date":"2021-01-27","arxiv_id":"2101.11331","n_code_links":1,"syntology":null},{"paper":null,"slug":"zeroth-order-deterministic-policy-gradient","title":"Zeroth-order Deterministic Policy Gradient","date":"2020-06-12","arxiv_id":"2006.07314","n_code_links":0,"syntology":null},{"paper":null,"slug":"investigation-on-the-generalization-of-the","title":"Investigation on the generalization of the Sampled Policy Gradient algorithm","date":"2019-10-09","arxiv_id":"1910.03728","n_code_links":0,"syntology":null},{"paper":"/paper/sampled-policy-gradient-for-learning-to-play","slug":"sampled-policy-gradient-for-learning-to-play","title":"Sampled Policy Gradient for Learning to Play the Game Agar.io","date":"2018-09-15","arxiv_id":"1809.05763","n_code_links":2,"syntology":null},{"paper":null,"slug":"directed-policy-gradient-for-safe","title":"Directed Policy Gradient for Safe Reinforcement Learning with Human Advice","date":"2018-08-13","arxiv_id":"1808.04096","n_code_links":0,"syntology":null},{"paper":null,"slug":"deterministic-policy-gradients-with-general","title":"Deterministic Policy Gradients With General State Transitions","date":"2018-07-10","arxiv_id":"1807.03708","n_code_links":0,"syntology":null},{"paper":null,"slug":"expected-policy-gradients","title":"Expected Policy Gradients","date":"2017-06-15","arxiv_id":"1706.05374","n_code_links":0,"syntology":null}],"papers_shown":20,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":20,"with_a_code_link":6,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":20,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"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":2,"papers_where_code_ran_first_page":"/method/dpg/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/dpg/papers/ran/1","json":"/method/dpg/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":4},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":4},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":3},{"task":"/task/continuous-control","name":"Continuous Control","papers":2},{"task":"/task/image-generation","name":"Image Generation","papers":2},{"task":"/task/language-modeling","name":"Language Modeling","papers":2},{"task":"/task/language-modelling","name":"Language Modelling","papers":2},{"task":"/task/q-learning","name":"Q-Learning","papers":2},{"task":"/task/continuous-control","name":"continuous-control","papers":2},{"task":"/task/abstractive-text-summarization","name":"Abstractive Text Summarization","papers":1},{"task":"/task/adversarial-attack","name":"Adversarial Attack","papers":1},{"task":"/task/code-generation","name":"Code Generation","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":1},{"task":"/task/face-recognition","name":"Face Recognition","papers":1},{"task":"/task/game-design","name":"Game Design","papers":1},{"task":"/task/model-predictive-control","name":"Model Predictive Control","papers":1},{"task":"/task/motion-planning","name":"Motion Planning","papers":1},{"task":"/task/mujoco","name":"MuJoCo","papers":1},{"task":"/task/object-detection","name":"Object Detection","papers":1}],"tasks_shown":20,"n_tasks":28,"usage_by_year":[{"year":"2017","papers":1},{"year":"2018","papers":3},{"year":"2019","papers":1},{"year":"2020","papers":1},{"year":"2021","papers":5},{"year":"2022","papers":2},{"year":"2024","papers":4},{"year":"2025","papers":3}],"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/dpg"},"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=DPG","read_at":"2026-10-05T00:55:15+00:00","query":"DPG","kind":"paper","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"openreview_BzqkbJTsbq"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":"for_this_paper_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":true,"bearers_found":4,"served":{"arxiv_id":"openreview_BzqkbJTsbq","citations":null},"leading_other_bearer":{"arxiv_id":"2205.02101","title":"Dynamic Sparse R-CNN","citations":38,"named_by":["acronym_expansion"],"bearer_name":"Dynamic Proposal Generation (DPG)","ask_with":"have('2205.02101')"},"n_other_bearers_listed":3,"note":"'DPG' is ALSO the name of 'Dynamic Proposal Generation (DPG)', a method in 'Dynamic Sparse R-CNN' (arXiv:2205.02101, 38 citations), which is cited FAR more than the paper this answer is about (citations not recorded). This answer may be about the wrong DPG. If you meant the better-known one, ask again with that entry of `also_named`."},"name_competition_text":"The same name also belongs to “Dynamic Proposal Generation (DPG)”, a method in the paper “Dynamic Sparse R-CNN” (arXiv:2205.02101, 38 citations), which the lookup finds cited far more than the paper this answer is about (citations not recorded), so this answer may be about a different sense of the name.","near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"openreview_BzqkbJTsbq","page":null,"syntology_url":null,"in_graph_layer":false,"samples":0},"line":"the paper matched by title, the paper Syntology's graph keys as openreview_BzqkbJTsbq, held, no code (no_code; paper_only). The lookup matched a paper by its title, the paper Syntology's graph keys as openreview_BzqkbJTsbq, not a method entry. The archive credits no paper with an arXiv id for this method, so whether this answer (about the paper Syntology's graph keys as openreview_BzqkbJTsbq) is about this method is not checked; it does not say whether this method has code.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"92f2211255288364fb8d89d1a6cd8146b5d594977289056c1ff565aaab43b346","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}