{"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/what-makes-a-good-diffusion-planner-for","title":"What Makes a Good Diffusion Planner for Decision Making?","arxiv_id":null,"date":"2025-03-01","proceeding":"ICLR 2025 3","authors":["Haofei Lu","Dongqi Han","Yifei Shen","Dongsheng Li"],"abstract":"Diffusion models have recently shown significant potential in solving\r\ndecision-making problems, particularly in generating behavior plans -- also\r\nknown as diffusion planning. While numerous studies have demonstrated the\r\nimpressive performance of diffusion planning, the mechanisms behind the key\r\ncomponents of a good diffusion planner remain unclear and the design choices\r\nare highly inconsistent in existing studies. In this work, we address this\r\nissue through systematic empirical experiments on diffusion planning in an\r\noffline reinforcement learning (RL) setting, providing practical insights into\r\nthe essential components of diffusion planning. We trained and evaluated over\r\n6,000 diffusion models, identifying the critical components such as guided\r\nsampling, network architecture, action generation and planning strategy. We\r\nrevealed that some design choices opposite to the common practice in previous\r\nwork in diffusion planning actually lead to better performance, e.g.,\r\nunconditional sampling with selection can be better than guided sampling and\r\nTransformer outperforms U-Net as denoising network. Based on these insights, we\r\nsuggest a simple yet strong diffusion planning baseline that achieves\r\nstate-of-the-art results on standard offline RL benchmarks.","url_abs":"https://openreview.net/forum?id=7BQkXXM8Fy","url_pdf":"https://openreview.net/pdf?id=7BQkXXM8Fy","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":"what-makes-a-good-diffusion-planner-for","repo_url":"https://github.com/Josh00-Lu/DiffusionVeteran","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"action-generation","task_name":"Action Generation"},{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"offline-rl","task_name":"Offline RL"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"}],"methods":[{"method_slug":"concatenated-skip-connection","method_name":"Concatenated Skip Connection"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"diffusion","method_name":"Diffusion"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"u-net","method_name":"U-Net"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"Josh00-Lu/DiffusionVeteran","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2406.09509"],"harvested_for_calls":[{"arxiv_id":"2406.09509","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2406.09509"},"call":"get_harvested_code_for_paper(arxiv_id=\"2406.09509\")"}]}],"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":"97b9037385804b6d0faab5d22c6d189a42c0c1dc062224b724f236f5d55d6bc0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}