{"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/structured-nonlinear-variable-selection","title":"Structured nonlinear variable selection","arxiv_id":"1805.06258","date":"2018-05-16","proceeding":null,"authors":["Magda Gregorová","Alexandros Kalousis","Stéphane Marchand-Maillet"],"abstract":"We investigate structured sparsity methods for variable selection in\nregression problems where the target depends nonlinearly on the inputs. We\nfocus on general nonlinear functions not limiting a priori the function space\nto additive models. We propose two new regularizers based on partial\nderivatives as nonlinear equivalents of group lasso and elastic net. We\nformulate the problem within the framework of learning in reproducing kernel\nHilbert spaces and show how the variational problem can be reformulated into a\nmore practical finite dimensional equivalent. We develop a new algorithm\nderived from the ADMM principles that relies solely on closed forms of the\nproximal operators. We explore the empirical properties of our new algorithm\nfor Nonlinear Variable Selection based on Derivatives (NVSD) on a set of\nexperiments and confirm favourable properties of our structured-sparsity models\nand the algorithm in terms of both prediction and variable selection accuracy.","url_abs":"http://arxiv.org/abs/1805.06258v1","url_pdf":"http://arxiv.org/pdf/1805.06258v1.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":"structured-nonlinear-variable-selection","repo_url":"https://bitbucket.org/dmmlgeneva/nvsd_uai2018","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"additive-models","task_name":"Additive models"},{"task_slug":"variable-selection","task_name":"Variable Selection"}],"methods":[{"method_slug":"admm","method_name":"ADMM"}],"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":"bitbucket.org/dmmlgeneva/nvsd_uai2018","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":"5b21625072e79fa7576b15a04341cca456f37040c957f0920c39ab2f91c56e5e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}