{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DT2EXYGGDBSQYUWWC7JZUGWVWJ","short_pith_number":"pith:DT2EXYGG","schema_version":"1.0","canonical_sha256":"1cf44be0c618650c52d617d39a1ad5b276258e6cb646a9de7c4c33a6196a814f","source":{"kind":"arxiv","id":"1805.06258","version":1},"attestation_state":"computed","paper":{"title":"Structured nonlinear variable selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandros Kalousis, Magda Gregorov\\'a, St\\'ephane Marchand-Maillet","submitted_at":"2018-05-16T11:57:31Z","abstract_excerpt":"We investigate structured sparsity methods for variable selection in regression problems where the target depends nonlinearly on the inputs. We focus on general nonlinear functions not limiting a priori the function space to additive models. We propose two new regularizers based on partial derivatives as nonlinear equivalents of group lasso and elastic net. We formulate the problem within the framework of learning in reproducing kernel Hilbert spaces and show how the variational problem can be reformulated into a more practical finite dimensional equivalent. We develop a new algorithm derived "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.06258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-16T11:57:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"00632c6948a9cbf9acf51ebd0e7608e8f416ddb1d71371e766ae5d66b2e450fc","abstract_canon_sha256":"57a29b911a01db68476620f3d6affbb5f2c4941796e4afdbc1a4eee47c222563"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:48.274537Z","signature_b64":"bGsIUc5vUy9XJtB41QG8TrYjtn750wCwOP42MRtrR2UpMotwkheXKp5mJNwFWYPKHJENP8edMRseLG+D/NLnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf44be0c618650c52d617d39a1ad5b276258e6cb646a9de7c4c33a6196a814f","last_reissued_at":"2026-05-18T00:15:48.274032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:48.274032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured nonlinear variable selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandros Kalousis, Magda Gregorov\\'a, St\\'ephane Marchand-Maillet","submitted_at":"2018-05-16T11:57:31Z","abstract_excerpt":"We investigate structured sparsity methods for variable selection in regression problems where the target depends nonlinearly on the inputs. We focus on general nonlinear functions not limiting a priori the function space to additive models. We propose two new regularizers based on partial derivatives as nonlinear equivalents of group lasso and elastic net. We formulate the problem within the framework of learning in reproducing kernel Hilbert spaces and show how the variational problem can be reformulated into a more practical finite dimensional equivalent. We develop a new algorithm derived "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06258","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.06258","created_at":"2026-05-18T00:15:48.274108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06258v1","created_at":"2026-05-18T00:15:48.274108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06258","created_at":"2026-05-18T00:15:48.274108+00:00"},{"alias_kind":"pith_short_12","alias_value":"DT2EXYGGDBSQ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DT2EXYGGDBSQYUWW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DT2EXYGG","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06959","citing_title":"Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DT2EXYGGDBSQYUWWC7JZUGWVWJ","json":"https://pith.science/pith/DT2EXYGGDBSQYUWWC7JZUGWVWJ.json","graph_json":"https://pith.science/api/pith-number/DT2EXYGGDBSQYUWWC7JZUGWVWJ/graph.json","events_json":"https://pith.science/api/pith-number/DT2EXYGGDBSQYUWWC7JZUGWVWJ/events.json","paper":"https://pith.science/paper/DT2EXYGG"},"agent_actions":{"view_html":"https://pith.science/pith/DT2EXYGGDBSQYUWWC7JZUGWVWJ","download_json":"https://pith.science/pith/DT2EXYGGDBSQYUWWC7JZUGWVWJ.json","view_paper":"https://pith.science/paper/DT2EXYGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06258&json=true","fetch_graph":"https://pith.science/api/pith-number/DT2EXYGGDBSQYUWWC7JZUGWVWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DT2EXYGGDBSQYUWWC7JZUGWVWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DT2EXYGGDBSQYUWWC7JZUGWVWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DT2EXYGGDBSQYUWWC7JZUGWVWJ/action/storage_attestation","attest_author":"https://pith.science/pith/DT2EXYGGDBSQYUWWC7JZUGWVWJ/action/author_attestation","sign_citation":"https://pith.science/pith/DT2EXYGGDBSQYUWWC7JZUGWVWJ/action/citation_signature","submit_replication":"https://pith.science/pith/DT2EXYGGDBSQYUWWC7JZUGWVWJ/action/replication_record"}},"created_at":"2026-05-18T00:15:48.274108+00:00","updated_at":"2026-05-18T00:15:48.274108+00:00"}