{"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/a-general-iterative-shrinkage-and","title":"A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems","arxiv_id":"1303.4434","date":"2013-03-18","proceeding":null,"authors":["Pinghua Gong","Chang-Shui Zhang","Zhaosong Lu","Jianhua Huang","Jieping Ye"],"abstract":"Non-convex sparsity-inducing penalties have recently received considerable\nattentions in sparse learning. Recent theoretical investigations have\ndemonstrated their superiority over the convex counterparts in several sparse\nlearning settings. However, solving the non-convex optimization problems\nassociated with non-convex penalties remains a big challenge. A commonly used\napproach is the Multi-Stage (MS) convex relaxation (or DC programming), which\nrelaxes the original non-convex problem to a sequence of convex problems. This\napproach is usually not very practical for large-scale problems because its\ncomputational cost is a multiple of solving a single convex problem. In this\npaper, we propose a General Iterative Shrinkage and Thresholding (GIST)\nalgorithm to solve the nonconvex optimization problem for a large class of\nnon-convex penalties. The GIST algorithm iteratively solves a proximal operator\nproblem, which in turn has a closed-form solution for many commonly used\npenalties. At each outer iteration of the algorithm, we use a line search\ninitialized by the Barzilai-Borwein (BB) rule that allows finding an\nappropriate step size quickly. The paper also presents a detailed convergence\nanalysis of the GIST algorithm. The efficiency of the proposed algorithm is\ndemonstrated by extensive experiments on large-scale data sets.","url_abs":"http://arxiv.org/abs/1303.4434v1","url_pdf":"http://arxiv.org/pdf/1303.4434v1.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":"a-general-iterative-shrinkage-and","repo_url":"https://github.com/EvanZhuang/MRI-Reconstruction-with-Sparse-Optimization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-general-iterative-shrinkage-and","repo_url":"https://github.com/KeSyren/paper-GC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"a-general-iterative-shrinkage-and","repo_url":"https://github.com/iancovert/Neural-GC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"a-general-iterative-shrinkage-and","repo_url":"https://github.com/icc2115/Neural-GC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"sparse-learning","task_name":"Sparse Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1303.4434","atlas_url":"https://app.syntology.ai/?focus=1303.4434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1303.4434"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1303.4434"},"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":"1303.4434"},"call":"get_harvested_code_for_paper(arxiv_id=\"1303.4434\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1303.4434"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1303.4434\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1303.4434"},"call":"get_concepts_for_paper(arxiv_id=\"1303.4434\")"}],"by_repo":[{"repo":"EvanZhuang/MRI-Reconstruction-with-Sparse-Optimization","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"KeSyren/paper-GC","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"iancovert/Neural-GC","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2602.07915"],"harvested_for_calls":[{"arxiv_id":"2602.07915","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2602.07915"},"call":"get_harvested_code_for_paper(arxiv_id=\"2602.07915\")"}]},{"repo":"icc2115/Neural-GC","kind":"listed","samples":12,"ran":9,"instrument":1,"unverified":3}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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/1303.4434.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/1303.4434.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/iancovert/Neural-GC","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/icc2115/Neural-GC","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/KeSyren/paper-GC","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/EvanZhuang/MRI-Reconstruction-with-Sparse-Optimization","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_draft_wrong":1,"ran":8,"unverified":3},"n_samples":12,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":3,"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":{"listed":{"samples":12,"ran":9,"n_ran_checked":8,"n_instrument":1,"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":0,"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,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":9,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-26","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"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":"8f5922d83d039372","code_sha256_prefix":"8f5922d83d039372","entry":"activation_helper","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"models/model_helper.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/models/model_helper.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"activation:str/0/str, dim:NoneType/0/?","fixture_out_type":"ReLU","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8f5922d83d039372"}},{"code_sha256":"4eaa384768541890","code_sha256_prefix":"4eaa384768541890","entry":"arrange_input","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"models/clstm.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/models/clstm.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"data:Tensor/2/float, context:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","retrieve_with":{"tool":"get_code","code_sha256":"4eaa384768541890"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4eaa384768541890"}},{"code_sha256":"be9afe4afc6f8b45","code_sha256_prefix":"be9afe4afc6f8b45","entry":"lorenz","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"synthetic.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/synthetic.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:ndarray/1/float, t:float/0/float, F:float/0/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T23:25:36.931776+00:00","retrieve_with":{"tool":"get_code","code_sha256":"be9afe4afc6f8b45"},"code_page":"/code/lorenz","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"be9afe4afc6f8b45"}},{"code_sha256":"3a98557267414e0c","code_sha256_prefix":"3a98557267414e0c","entry":"make_var_stationary","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"synthetic.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/synthetic.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"beta:ndarray/2/float, radius:float/0/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T23:25:36.931776+00:00","retrieve_with":{"tool":"get_code","code_sha256":"3a98557267414e0c"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3a98557267414e0c"}},{"code_sha256":"567bcdd840d7c476","code_sha256_prefix":"567bcdd840d7c476","entry":"regularize","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"models/clstm.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/models/clstm.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"network:callable/0/?, lam:float/0/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","code_page":"/code/regularize","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"567bcdd840d7c476"}},{"code_sha256":"5de07362ad1b4d7d","code_sha256_prefix":"5de07362ad1b4d7d","entry":"regularize","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"models/cmlp.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/models/cmlp.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"network:callable/0/?, lam:float/0/float, penalty:str/0/str","fixture_out_type":"Tensor","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","code_page":"/code/regularize","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5de07362ad1b4d7d"}},{"code_sha256":"0c997f388fcc9360","code_sha256_prefix":"0c997f388fcc9360","entry":"ridge_regularize","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"models/clstm.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/models/clstm.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"network:callable/0/?, lam:float/0/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0c997f388fcc9360"}},{"code_sha256":"339ba841bfe9a789","code_sha256_prefix":"339ba841bfe9a789","entry":"ridge_regularize","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"models/cmlp.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/models/cmlp.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"network:callable/0/?, lam:float/0/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"339ba841bfe9a789"}},{"code_sha256":"330957596965058c","code_sha256_prefix":"330957596965058c","entry":"ridge_regularize","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"models/crnn.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/models/crnn.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"network:callable/0/?, lam:float/0/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"330957596965058c"}},{"code_sha256":"6da52d3512b03795","code_sha256_prefix":"6da52d3512b03795","entry":"regularize","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"models/crnn.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/models/crnn.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/regularize","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6da52d3512b03795"}},{"code_sha256":"bf341efd1d141a30","code_sha256_prefix":"bf341efd1d141a30","entry":"simulate_var","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"synthetic.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/synthetic.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bf341efd1d141a30"}},{"code_sha256":"236cfe42ea27ded9","code_sha256_prefix":"236cfe42ea27ded9","entry":"train_model_gista","repo":"icc2115/Neural-GC","repo_kind":"listed","path":"models/cmlp.py","file_url":"https://github.com/icc2115/Neural-GC/blob/HEAD/models/cmlp.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"236cfe42ea27ded9"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d9f3f452bf934377e4225eaafa7ffdc43fcc5687a74a5630d079db96847e1328","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}