{"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/statistical-physics-of-inference-thresholds","title":"Statistical physics of inference: Thresholds and algorithms","arxiv_id":"1511.02476","date":"2015-11-08","proceeding":null,"authors":["Lenka Zdeborová","Florent Krzakala"],"abstract":"Many questions of fundamental interest in todays science can be formulated as\ninference problems: Some partial, or noisy, observations are performed over a\nset of variables and the goal is to recover, or infer, the values of the\nvariables based on the indirect information contained in the measurements. For\nsuch problems, the central scientific questions are: Under what conditions is\nthe information contained in the measurements sufficient for a satisfactory\ninference to be possible? What are the most efficient algorithms for this task?\nA growing body of work has shown that often we can understand and locate these\nfundamental barriers by thinking of them as phase transitions in the sense of\nstatistical physics. Moreover, it turned out that we can use the gained\nphysical insight to develop new promising algorithms. Connection between\ninference and statistical physics is currently witnessing an impressive\nrenaissance and we review here the current state-of-the-art, with a pedagogical\nfocus on the Ising model which formulated as an inference problem we call the\nplanted spin glass. In terms of applications we review two classes of problems:\n(i) inference of clusters on graphs and networks, with community detection as a\nspecial case and (ii) estimating a signal from its noisy linear measurements,\nwith compressed sensing as a case of sparse estimation. Our goal is to provide\na pedagogical review for researchers in physics and other fields interested in\nthis fascinating topic.","url_abs":"http://arxiv.org/abs/1511.02476v5","url_pdf":"http://arxiv.org/pdf/1511.02476v5.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":"statistical-physics-of-inference-thresholds","repo_url":"https://github.com/rodsveiga/AMP_tutorial","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"community-detection","task_name":"Community Detection"},{"task_slug":"compressed-sensing","task_name":"compressed sensing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1511.02476","atlas_url":"https://app.syntology.ai/?focus=1511.02476","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":"1511.02476"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1511.02476\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1511.02476"},"call":"get_concepts_for_paper(arxiv_id=\"1511.02476\")"}],"by_repo":[{"repo":"rodsveiga/AMP_tutorial","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"4236c7be5c78c1ba5381ed7b3a47e0e9bfdc0fb7c5bb7c561eaf8a808aa7b256","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}