{"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/sparse-estimation-with-the-swept-approximated","title":"Sparse Estimation with the Swept Approximated Message-Passing Algorithm","arxiv_id":"1406.4311","date":"2014-06-17","proceeding":null,"authors":["Andre Manoel","Florent Krzakala","Eric W. Tramel","Lenka Zdeborová"],"abstract":"Approximate Message Passing (AMP) has been shown to be a superior method for\ninference problems, such as the recovery of signals from sets of noisy,\nlower-dimensionality measurements, both in terms of reconstruction accuracy and\nin computational efficiency. However, AMP suffers from serious convergence\nissues in contexts that do not exactly match its assumptions. We propose a new\napproach to stabilizing AMP in these contexts by applying AMP updates to\nindividual coefficients rather than in parallel. Our results show that this\nchange to the AMP iteration can provide theoretically expected, but hitherto\nunobtainable, performance for problems on which the standard AMP iteration\ndiverges. Additionally, we find that the computational costs of this swept\ncoefficient update scheme is not unduly burdensome, allowing it to be applied\nefficiently to signals of large dimensionality.","url_abs":"http://arxiv.org/abs/1406.4311v1","url_pdf":"http://arxiv.org/pdf/1406.4311v1.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":"sparse-estimation-with-the-swept-approximated","repo_url":"https://github.com/eric-tramel/SwAMP-Demo","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"eric-tramel/SwAMP-Demo","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":"7279027e1c9c91ab7c85c92bc85eb7de7060f20c33d1a8b702028d3db57cf6e8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}