{"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/understanding-the-learned-iterative-soft","title":"Understanding the Learned Iterative Soft Thresholding Algorithm with matrix factorization","arxiv_id":"1706.01338","date":"2017-06-02","proceeding":null,"authors":["Thomas Moreau","Joan Bruna"],"abstract":"Sparse coding is a core building block in many data analysis and machine\nlearning pipelines. Typically it is solved by relying on generic optimization\ntechniques, such as the Iterative Soft Thresholding Algorithm and its\naccelerated version (ISTA, FISTA). These methods are optimal in the class of\nfirst-order methods for non-smooth, convex functions. However, they do not\nexploit the particular structure of the problem at hand nor the input data\ndistribution. An acceleration using neural networks, coined LISTA, was proposed\nin Gregor and Le Cun (2010), which showed empirically that one could achieve\nhigh quality estimates with few iterations by modifying the parameters of the\nproximal splitting appropriately.\n  In this paper we study the reasons for such acceleration. Our mathematical\nanalysis reveals that it is related to a specific matrix factorization of the\nGram kernel of the dictionary, which attempts to nearly diagonalise the kernel\nwith a basis that produces a small perturbation of the $\\ell_1$ ball. When this\nfactorization succeeds, we prove that the resulting splitting algorithm enjoys\nan improved convergence bound with respect to the non-adaptive version.\nMoreover, our analysis also shows that conditions for acceleration occur mostly\nat the beginning of the iterative process, consistent with numerical\nexperiments. We further validate our analysis by showing that on dictionaries\nwhere this factorization does not exist, adaptive acceleration fails.","url_abs":"http://arxiv.org/abs/1706.01338v1","url_pdf":"http://arxiv.org/pdf/1706.01338v1.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":"understanding-the-learned-iterative-soft","repo_url":"https://github.com/tomMoral/AdaptiveOptim","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.01338","atlas_url":"https://app.syntology.ai/?focus=1706.01338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.01338"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1706.01338"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1706.01338"},"call":"get_harvested_code_for_paper(arxiv_id=\"1706.01338\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1706.01338"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.01338\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.01338"},"call":"get_concepts_for_paper(arxiv_id=\"1706.01338\")"}],"by_repo":[{"repo":"tomMoral/AdaptiveOptim","kind":"official","samples":2,"ran":0,"instrument":0,"unverified":2}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1706.01338.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1706.01338.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/tomMoral/AdaptiveOptim","reach":null}],"summary":{"unverified":2},"n_samples":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":2,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"d8eb74aaf0c1af20","code_sha256_prefix":"d8eb74aaf0c1af20","entry":"get_problem","repo":"tomMoral/AdaptiveOptim","repo_kind":"official","path":"NIPS_figures.py","file_url":"https://github.com/tomMoral/AdaptiveOptim/blob/HEAD/NIPS_figures.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/get-problem","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tomMoral/AdaptiveOptim when it was checked","mcp_get_code":{"code_sha256":"d8eb74aaf0c1af20"}},{"code_sha256":"9e4856c10dbdfdea","code_sha256_prefix":"9e4856c10dbdfdea","entry":"parse_runfile","repo":"tomMoral/AdaptiveOptim","repo_kind":"official","path":"NIPS_figures.py","file_url":"https://github.com/tomMoral/AdaptiveOptim/blob/HEAD/NIPS_figures.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tomMoral/AdaptiveOptim when it was checked","mcp_get_code":{"code_sha256":"9e4856c10dbdfdea"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d961925dc867db4e08fa6741b3111f5bc42508ebdacea0cb7d94297440aea38a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}