{"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-biconvex-analysis-for-lasso-l1-reweighting","title":"A biconvex analysis for Lasso l1 reweighting","arxiv_id":"1812.02990","date":"2018-12-07","proceeding":null,"authors":["Sophie M. Fosson"],"abstract":"l1 reweighting algorithms are very popular in sparse signal recovery and\ncompressed sensing, since in the practice they have been observed to outperform\nclassical l1 methods. Nevertheless, the theoretical analysis of their\nconvergence is a critical point, and generally is limited to the convergence of\nthe functional to a local minimum or to subsequence convergence. In this\nletter, we propose a new convergence analysis of a Lasso l1 reweighting method,\nbased on the observation that the algorithm is an alternated convex search for\na biconvex problem. Based on that, we are able to prove the numerical\nconvergence of the sequence of the iterates generated by the algorithm. This is\nnot yet the convergence of the sequence, but it is close enough for practical\nand numerical purposes. Furthermore, we propose an alternative iterative soft\nthresholding procedure, which is faster than the main algorithm.","url_abs":"http://arxiv.org/abs/1812.02990v1","url_pdf":"http://arxiv.org/pdf/1812.02990v1.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-biconvex-analysis-for-lasso-l1-reweighting","repo_url":"https://github.com/sophie27/Lasso-l1-reweigthing","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"compressed-sensing","task_name":"compressed sensing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"sophie27/Lasso-l1-reweigthing","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":"48e590cb238df52e90457cd708c614a2b98da7cf5655ff9edc13ffac2e2326dc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}