{"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/theoretical-linear-convergence-of-unfolded","title":"Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholds","arxiv_id":"1808.10038","date":"2018-08-29","proceeding":"NeurIPS 2018 12","authors":["Xiaohan Chen","Jialin Liu","Zhangyang Wang","Wotao Yin"],"abstract":"In recent years, unfolding iterative algorithms as neural networks has become\nan empirical success in solving sparse recovery problems. However, its\ntheoretical understanding is still immature, which prevents us from fully\nutilizing the power of neural networks. In this work, we study unfolded ISTA\n(Iterative Shrinkage Thresholding Algorithm) for sparse signal recovery. We\nintroduce a weight structure that is necessary for asymptotic convergence to\nthe true sparse signal. With this structure, unfolded ISTA can attain a linear\nconvergence, which is better than the sublinear convergence of ISTA/FISTA in\ngeneral cases. Furthermore, we propose to incorporate thresholding in the\nnetwork to perform support selection, which is easy to implement and able to\nboost the convergence rate both theoretically and empirically. Extensive\nsimulations, including sparse vector recovery and a compressive sensing\nexperiment on real image data, corroborate our theoretical results and\ndemonstrate their practical usefulness. We have made our codes publicly\navailable: https://github.com/xchen-tamu/linear-lista-cpss.","url_abs":"http://arxiv.org/abs/1808.10038v2","url_pdf":"http://arxiv.org/pdf/1808.10038v2.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":"theoretical-linear-convergence-of-unfolded","repo_url":"https://github.com/xchen-tamu/linear-lista-cpss","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"theoretical-linear-convergence-of-unfolded","repo_url":"https://github.com/TAMU-VITA/LISTA-CPSS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"theoretical-linear-convergence-of-unfolded","repo_url":"https://github.com/vita-group/lista-cpss","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"compressive-sensing","task_name":"Compressive Sensing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.10038","atlas_url":"https://app.syntology.ai/?focus=1808.10038","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":"1808.10038"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.10038\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.10038"},"call":"get_concepts_for_paper(arxiv_id=\"1808.10038\")"}],"by_repo":[{"repo":"xchen-tamu/linear-lista-cpss","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"TAMU-VITA/LISTA-CPSS","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vita-group/lista-cpss","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":"30a629a51519865e427191fe28a67b4a777bbe5e4c97f7b01cc6a8b1f4dff6ee","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}