{"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/optimal-errors-and-phase-transitions-in-high","title":"Optimal Errors and Phase Transitions in High-Dimensional Generalized Linear Models","arxiv_id":"1708.03395","date":"2017-08-10","proceeding":null,"authors":["Jean Barbier","Florent Krzakala","Nicolas Macris","Léo Miolane","Lenka Zdeborová"],"abstract":"Generalized linear models (GLMs) arise in high-dimensional machine learning,\nstatistics, communications and signal processing. In this paper we analyze GLMs\nwhen the data matrix is random, as relevant in problems such as compressed\nsensing, error-correcting codes or benchmark models in neural networks. We\nevaluate the mutual information (or \"free entropy\") from which we deduce the\nBayes-optimal estimation and generalization errors. Our analysis applies to the\nhigh-dimensional limit where both the number of samples and the dimension are\nlarge and their ratio is fixed. Non-rigorous predictions for the optimal errors\nexisted for special cases of GLMs, e.g. for the perceptron, in the field of\nstatistical physics based on the so-called replica method. Our present paper\nrigorously establishes those decades old conjectures and brings forward their\nalgorithmic interpretation in terms of performance of the generalized\napproximate message-passing algorithm. Furthermore, we tightly characterize,\nfor many learning problems, regions of parameters for which this algorithm\nachieves the optimal performance, and locate the associated sharp phase\ntransitions separating learnable and non-learnable regions. We believe that\nthis random version of GLMs can serve as a challenging benchmark for\nmulti-purpose algorithms. This paper is divided in two parts that can be read\nindependently: The first part (main part) presents the model and main results,\ndiscusses some applications and sketches the main ideas of the proof. The\nsecond part (supplementary informations) is much more detailed and provides\nmore examples as well as all the proofs.","url_abs":"http://arxiv.org/abs/1708.03395v3","url_pdf":"http://arxiv.org/pdf/1708.03395v3.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":"optimal-errors-and-phase-transitions-in-high","repo_url":"https://github.com/sphinxteam/GeneralizedLinearModel2017","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"},{"task_slug":"compressed-sensing","task_name":"compressed sensing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.03395","atlas_url":"https://app.syntology.ai/?focus=1708.03395","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":"1708.03395"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.03395\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.03395"},"call":"get_concepts_for_paper(arxiv_id=\"1708.03395\")"}],"by_repo":[{"repo":"sphinxteam/GeneralizedLinearModel2017","kind":"official","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":"4672257024b442077499a480af27202f488def63717de004be4973d16a37a33d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}