{"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/learned-d-amp-principled-neural-network-based","title":"Learned D-AMP: Principled Neural Network based Compressive Image Recovery","arxiv_id":"1704.06625","date":"2017-04-21","proceeding":"NeurIPS 2017 12","authors":["Christopher A. Metzler","Ali Mousavi","Richard G. Baraniuk"],"abstract":"Compressive image recovery is a challenging problem that requires fast and\naccurate algorithms. Recently, neural networks have been applied to this\nproblem with promising results. By exploiting massively parallel GPU processing\narchitectures and oodles of training data, they can run orders of magnitude\nfaster than existing techniques. However, these methods are largely\nunprincipled black boxes that are difficult to train and often-times specific\nto a single measurement matrix.\n  It was recently demonstrated that iterative sparse-signal-recovery algorithms\ncan be \"unrolled\" to form interpretable deep networks. Taking inspiration from\nthis work, we develop a novel neural network architecture that mimics the\nbehavior of the denoising-based approximate message passing (D-AMP) algorithm.\nWe call this new network Learned D-AMP (LDAMP).\n  The LDAMP network is easy to train, can be applied to a variety of different\nmeasurement matrices, and comes with a state-evolution heuristic that\naccurately predicts its performance. Most importantly, it outperforms the\nstate-of-the-art BM3D-AMP and NLR-CS algorithms in terms of both accuracy and\nrun time. At high resolutions, and when used with sensing matrices that have\nfast implementations, LDAMP runs over $50\\times$ faster than BM3D-AMP and\nhundreds of times faster than NLR-CS.","url_abs":"http://arxiv.org/abs/1704.06625v4","url_pdf":"http://arxiv.org/pdf/1704.06625v4.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":"learned-d-amp-principled-neural-network-based","repo_url":"https://github.com/ricedsp/D-AMP_Toolbox","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":null,"task_name":"GPU"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1704.06625","atlas_url":"https://app.syntology.ai/?focus=1704.06625","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":"1704.06625"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1704.06625\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1704.06625"},"call":"get_concepts_for_paper(arxiv_id=\"1704.06625\")"}],"by_repo":[{"repo":"ricedsp/D-AMP_Toolbox","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":"2d3dd77efcb62a11964f3c100f921c3fec7348898788a9c1f34e74af2231a260","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}