{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/implicit-search-via-discrete-diffusion-a","title":"Implicit Search via Discrete Diffusion: A Study on Chess","arxiv_id":"2502.19805","date":"2025-02-27","proceeding":null,"authors":["Jiacheng Ye","Zhenyu Wu","Jiahui Gao","Zhiyong Wu","Xin Jiang","Zhenguo Li","Lingpeng Kong"],"abstract":"In the post-AlphaGo era, there has been a renewed interest in search techniques such as Monte Carlo Tree Search (MCTS), particularly in their application to Large Language Models (LLMs). This renewed attention is driven by the recognition that current next-token prediction models often lack the ability for long-term planning. Is it possible to instill search-like abilities within the models to enhance their planning abilities without relying on explicit search? We propose DiffuSearch , a model that does \\textit{implicit search} by looking into the future world via discrete diffusion modeling. We instantiate DiffuSearch on a classical board game, Chess, where explicit search is known to be essential. Through extensive controlled experiments, we show DiffuSearch outperforms both the searchless and explicit search-enhanced policies. Specifically, DiffuSearch outperforms the one-step policy by 19.2% and the MCTS-enhanced policy by 14% on action accuracy. Furthermore, DiffuSearch demonstrates a notable 30% enhancement in puzzle-solving abilities compared to explicit search-based policies, along with a significant 540 Elo increase in game-playing strength assessment. These results indicate that implicit search via discrete diffusion is a viable alternative to explicit search over a one-step policy. All codes are publicly available at \\href{https://github.com/HKUNLP/DiffuSearch}{https://github.com/HKUNLP/DiffuSearch}.","url_abs":"https://arxiv.org/abs/2502.19805v1","url_pdf":"https://arxiv.org/pdf/2502.19805v1.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":"implicit-search-via-discrete-diffusion-a","repo_url":"https://github.com/hkunlp/diffusearch","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[],"methods":[{"method_slug":"attention","method_name":"Attention"},{"method_slug":"diffusion","method_name":"Diffusion"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2502.19805","atlas_url":"https://app.syntology.ai/?focus=2502.19805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19805"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/HKUNLP/DiffuSearch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/hkunlp/diffusearch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"ran":6,"unverified":1},"by_repo_kind":{"official":{"samples":7,"ran":6,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"c9e23707f64ef795","entry":"count_parameters","repo":"HKUNLP/DiffuSearch","repo_kind":"official","path":"src/llmtuner/extras/misc.py","file_url":"https://github.com/HKUNLP/DiffuSearch/blob/HEAD/src/llmtuner/extras/misc.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"c9e23707f64ef795"}},{"code_sha256_prefix":"56faa444d1b260c6","entry":"get_logger","repo":"HKUNLP/DiffuSearch","repo_kind":"official","path":"src/llmtuner/extras/logging.py","file_url":"https://github.com/HKUNLP/DiffuSearch/blob/HEAD/src/llmtuner/extras/logging.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"56faa444d1b260c6"}},{"code_sha256_prefix":"a9e798cf22bd399b","entry":"infer_optim_dtype","repo":"HKUNLP/DiffuSearch","repo_kind":"official","path":"src/llmtuner/extras/misc.py","file_url":"https://github.com/HKUNLP/DiffuSearch/blob/HEAD/src/llmtuner/extras/misc.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"a9e798cf22bd399b"}},{"code_sha256_prefix":"f92a36628049ade8","entry":"pad_sequence","repo":"HKUNLP/DiffuSearch","repo_kind":"official","path":"src/llmtuner/dsets/preprocess.py","file_url":"https://github.com/HKUNLP/DiffuSearch/blob/HEAD/src/llmtuner/dsets/preprocess.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"f92a36628049ade8"}},{"code_sha256_prefix":"70c7f6d657ef0a9e","entry":"smooth","repo":"HKUNLP/DiffuSearch","repo_kind":"official","path":"src/llmtuner/extras/ploting.py","file_url":"https://github.com/HKUNLP/DiffuSearch/blob/HEAD/src/llmtuner/extras/ploting.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"70c7f6d657ef0a9e"}},{"code_sha256_prefix":"1c0a502523d29b60","entry":"split_dataset","repo":"HKUNLP/DiffuSearch","repo_kind":"official","path":"src/llmtuner/dsets/utils.py","file_url":"https://github.com/HKUNLP/DiffuSearch/blob/HEAD/src/llmtuner/dsets/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"1c0a502523d29b60"}},{"code_sha256_prefix":"7aba54878bdf4a47","entry":"dispatch_model","repo":"HKUNLP/DiffuSearch","repo_kind":"official","path":"src/llmtuner/extras/misc.py","file_url":"https://github.com/HKUNLP/DiffuSearch/blob/HEAD/src/llmtuner/extras/misc.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"7aba54878bdf4a47"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}