{"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/neural-proximal-gradient-descent-for","title":"Neural Proximal Gradient Descent for Compressive Imaging","arxiv_id":"1806.03963","date":"2018-06-01","proceeding":"NeurIPS 2018 12","authors":["Morteza Mardani","Qingyun Sun","Shreyas Vasawanala","Vardan Papyan","Hatef Monajemi","John Pauly","David Donoho"],"abstract":"Recovering high-resolution images from limited sensory data typically leads\nto a serious ill-posed inverse problem, demanding inversion algorithms that\neffectively capture the prior information. Learning a good inverse mapping from\ntraining data faces severe challenges, including: (i) scarcity of training\ndata; (ii) need for plausible reconstructions that are physically feasible;\n(iii) need for fast reconstruction, especially in real-time applications. We\ndevelop a successful system solving all these challenges, using as basic\narchitecture the recurrent application of proximal gradient algorithm. We learn\na proximal map that works well with real images based on residual networks.\nContraction of the resulting map is analyzed, and incoherence conditions are\ninvestigated that drive the convergence of the iterates. Extensive experiments\nare carried out under different settings: (a) reconstructing abdominal MRI of\npediatric patients from highly undersampled Fourier-space data and (b)\nsuperresolving natural face images. Our key findings include: 1. a recurrent\nResNet with a single residual block unrolled from an iterative algorithm yields\nan effective proximal which accurately reveals MR image details. 2. Our\narchitecture significantly outperforms conventional non-recurrent deep ResNets\nby 2dB SNR; it is also trained much more rapidly. 3. It outperforms\nstate-of-the-art compressed-sensing Wavelet-based methods by 4dB SNR, with 100x\nspeedups in reconstruction time.","url_abs":"http://arxiv.org/abs/1806.03963v1","url_pdf":"http://arxiv.org/pdf/1806.03963v1.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":"neural-proximal-gradient-descent-for","repo_url":"https://github.com/MortezaMardani/Neural-PGD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"compressed-sensing","task_name":"compressed sensing"}],"methods":[{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1806.03963","atlas_url":"https://app.syntology.ai/?focus=1806.03963","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":"1806.03963"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.03963\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.03963"},"call":"get_concepts_for_paper(arxiv_id=\"1806.03963\")"}],"by_repo":[{"repo":"MortezaMardani/Neural-PGD","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":"be8216ed327712257de0e5e328169d93ff7e05683feeb69b232bd1ac087b6a2e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}