{"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/efficient-smoothed-concomitant-lasso","title":"Efficient Smoothed Concomitant Lasso Estimation for High Dimensional Regression","arxiv_id":"1606.02702","date":"2016-06-08","proceeding":null,"authors":["Eugene Ndiaye","Olivier Fercoq","Alexandre Gramfort","Vincent Leclère","Joseph Salmon"],"abstract":"In high dimensional settings, sparse structures are crucial for efficiency,\nboth in term of memory, computation and performance. It is customary to\nconsider $\\ell_1$ penalty to enforce sparsity in such scenarios. Sparsity\nenforcing methods, the Lasso being a canonical example, are popular candidates\nto address high dimension. For efficiency, they rely on tuning a parameter\ntrading data fitting versus sparsity. For the Lasso theory to hold this tuning\nparameter should be proportional to the noise level, yet the latter is often\nunknown in practice. A possible remedy is to jointly optimize over the\nregression parameter as well as over the noise level. This has been considered\nunder several names in the literature: Scaled-Lasso, Square-root Lasso,\nConcomitant Lasso estimation for instance, and could be of interest for\nconfidence sets or uncertainty quantification. In this work, after illustrating\nnumerical difficulties for the Smoothed Concomitant Lasso formulation, we\npropose a modification we coined Smoothed Concomitant Lasso, aimed at\nincreasing numerical stability. We propose an efficient and accurate solver\nleading to a computational cost no more expansive than the one for the Lasso.\nWe leverage on standard ingredients behind the success of fast Lasso solvers: a\ncoordinate descent algorithm, combined with safe screening rules to achieve\nspeed efficiency, by eliminating early irrelevant features.","url_abs":"http://arxiv.org/abs/1606.02702v1","url_pdf":"http://arxiv.org/pdf/1606.02702v1.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":"efficient-smoothed-concomitant-lasso","repo_url":"https://github.com/EugeneNdiaye/smoothed_concomitant_lasso","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"efficient-smoothed-concomitant-lasso","repo_url":"https://github.com/samiatto/colide","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"uncertainty-quantification","task_name":"Uncertainty Quantification"},{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"},{"task_slug":"regression-1","task_name":"regression"}],"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":"EugeneNdiaye/smoothed_concomitant_lasso","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"samiatto/colide","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2209.08037"],"harvested_for_calls":[{"arxiv_id":"2209.08037","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2209.08037"},"call":"get_harvested_code_for_paper(arxiv_id=\"2209.08037\")"}]}],"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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"6e14c101c5b8ecacab070c593cfb7990b2fb15ce059133012ab779249743cc17","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}