{"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/lasso-regularization-paths-for-narmax-models","title":"Lasso Regularization Paths for NARMAX Models via Coordinate Descent","arxiv_id":"1710.00598","date":"2017-10-02","proceeding":null,"authors":["Antônio H. Ribeiro","Luis A. Aguirre"],"abstract":"We propose a new algorithm for estimating NARMAX models with $L_1$\nregularization for models represented as a linear combination of basis\nfunctions. Due to the $L_1$-norm penalty the Lasso estimation tends to produce\nsome coefficients that are exactly zero and hence gives interpretable models.\nThe novelty of the contribution is the inclusion of error regressors in the\nLasso estimation (which yields a nonlinear regression problem). The proposed\nalgorithm uses cyclical coordinate descent to compute the parameters of the\nNARMAX models for the entire regularization path. It deals with the error terms\nby updating the regressor matrix along with the parameter vector. In\ncomparative timings we find that the modification does not reduce the\ncomputational efficiency of the original algorithm and can provide the most\nimportant regressors in very few inexpensive iterations. The method is\nillustrated for linear and polynomial models by means of two examples.","url_abs":"http://arxiv.org/abs/1710.00598v2","url_pdf":"http://arxiv.org/pdf/1710.00598v2.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":"lasso-regularization-paths-for-narmax-models","repo_url":"https://github.com/antonior92/NarmaxLasso.jl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"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":"antonior92/NarmaxLasso.jl","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":"d26c28b36882fa252e6bb097e2133f07a472a58e748cf981dcc1530c2f73afdb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}