{"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/protein-discovery-with-discrete-walk-jump","title":"Protein Discovery with Discrete Walk-Jump Sampling","arxiv_id":"2306.12360","date":"2023-06-08","proceeding":null,"authors":["Nathan C. Frey","Daniel Berenberg","Karina Zadorozhny","Joseph Kleinhenz","Julien Lafrance-Vanasse","Isidro Hotzel","Yan Wu","Stephen Ra","Richard Bonneau","Kyunghyun Cho","Andreas Loukas","Vladimir Gligorijevic","Saeed Saremi"],"abstract":"We resolve difficulties in training and sampling from a discrete generative model by learning a smoothed energy function, sampling from the smoothed data manifold with Langevin Markov chain Monte Carlo (MCMC), and projecting back to the true data manifold with one-step denoising. Our Discrete Walk-Jump Sampling formalism combines the contrastive divergence training of an energy-based model and improved sample quality of a score-based model, while simplifying training and sampling by requiring only a single noise level. We evaluate the robustness of our approach on generative modeling of antibody proteins and introduce the distributional conformity score to benchmark protein generative models. By optimizing and sampling from our models for the proposed distributional conformity score, 97-100% of generated samples are successfully expressed and purified and 70% of functional designs show equal or improved binding affinity compared to known functional antibodies on the first attempt in a single round of laboratory experiments. We also report the first demonstration of long-run fast-mixing MCMC chains where diverse antibody protein classes are visited in a single MCMC chain.","url_abs":"https://arxiv.org/abs/2306.12360v2","url_pdf":"https://arxiv.org/pdf/2306.12360v2.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":"protein-discovery-with-discrete-walk-jump","repo_url":"https://github.com/prescient-design/walk-jump","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2306.12360","atlas_url":"https://app.syntology.ai/?focus=2306.12360","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.12360"}},"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/mennthor/awkde","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/prescient-design/walk-jump","reach":null}],"summary":{"ran_draft_wrong":1,"unverified":2},"by_repo_kind":{"official":{"samples":1,"ran":1,"repositories":1},"found_in_text":{"samples":2,"ran":0,"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":"309252fed7170a74","entry":"conformity_score","repo":"prescient-design/walk-jump","repo_kind":"official","path":"src/walkjump/conformity/_conformity_score.py","file_url":"https://github.com/prescient-design/walk-jump/blob/HEAD/src/walkjump/conformity/_conformity_score.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"309252fed7170a74"}},{"code_sha256_prefix":"c9c24e630d72a753","entry":"shift_and_scale_nd_sample","repo":"mennthor/awkde","repo_kind":"found_in_text","path":"awkde/tools.py","file_url":"https://github.com/mennthor/awkde/blob/HEAD/awkde/tools.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c9c24e630d72a753"}},{"code_sha256_prefix":"19825ca121b97f00","entry":"standardize_nd_sample","repo":"mennthor/awkde","repo_kind":"found_in_text","path":"awkde/tools.py","file_url":"https://github.com/mennthor/awkde/blob/HEAD/awkde/tools.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"19825ca121b97f00"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}