{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NLADDYAA4AIDYRQGP4CWRRYZF4","short_pith_number":"pith:NLADDYAA","schema_version":"1.0","canonical_sha256":"6ac031e000e0103c46067f0568c7192f0df3ae4585759fa9117f7bd358d03453","source":{"kind":"arxiv","id":"1009.3515","version":2},"attestation_state":"computed","paper":{"title":"Safe Feature Elimination in Sparse Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Laurent El Ghaoui, Tarek Rabbani, Vivian Viallon","submitted_at":"2010-09-17T21:29:09Z","abstract_excerpt":"We investigate fast methods that allow to quickly eliminate variables (features) in supervised learning problems involving a convex loss function and a $l_1$-norm penalty, leading to a potentially substantial reduction in the number of variables prior to running the supervised learning algorithm. The methods are not heuristic: they only eliminate features that are {\\em guaranteed} to be absent after solving the learning problem. Our framework applies to a large class of problems, including support vector machine classification, logistic regression and least-squares.\n  The complexity of the fea"},"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":"1009.3515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-17T21:29:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f2bf99252be3681ab61ef00e4ab1625f6b047ff7db43f8b29c999fb634b055df","abstract_canon_sha256":"81b3356abf34fed8909a2f9ab72e9f135110a44be32ce86b1c076ba39d775c54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:16.648188Z","signature_b64":"aECBrRozi1xlLEsC+pORX4esCHd9mk+hu1PDtSBCH8XU0agdBJd4mKGDpfMBmcc2Jk+MUs6O4cBX18FrEtq0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ac031e000e0103c46067f0568c7192f0df3ae4585759fa9117f7bd358d03453","last_reissued_at":"2026-05-18T04:38:16.647488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:16.647488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Safe Feature Elimination in Sparse Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Laurent El Ghaoui, Tarek Rabbani, Vivian Viallon","submitted_at":"2010-09-17T21:29:09Z","abstract_excerpt":"We investigate fast methods that allow to quickly eliminate variables (features) in supervised learning problems involving a convex loss function and a $l_1$-norm penalty, leading to a potentially substantial reduction in the number of variables prior to running the supervised learning algorithm. The methods are not heuristic: they only eliminate features that are {\\em guaranteed} to be absent after solving the learning problem. Our framework applies to a large class of problems, including support vector machine classification, logistic regression and least-squares.\n  The complexity of the fea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3515","kind":"arxiv","version":2},"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":"1009.3515","created_at":"2026-05-18T04:38:16.647600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3515v2","created_at":"2026-05-18T04:38:16.647600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3515","created_at":"2026-05-18T04:38:16.647600+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLADDYAA4AID","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLADDYAA4AIDYRQG","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLADDYAA","created_at":"2026-05-18T12:26:10.704358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4","json":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4.json","graph_json":"https://pith.science/api/pith-number/NLADDYAA4AIDYRQGP4CWRRYZF4/graph.json","events_json":"https://pith.science/api/pith-number/NLADDYAA4AIDYRQGP4CWRRYZF4/events.json","paper":"https://pith.science/paper/NLADDYAA"},"agent_actions":{"view_html":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4","download_json":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4.json","view_paper":"https://pith.science/paper/NLADDYAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3515&json=true","fetch_graph":"https://pith.science/api/pith-number/NLADDYAA4AIDYRQGP4CWRRYZF4/graph.json","fetch_events":"https://pith.science/api/pith-number/NLADDYAA4AIDYRQGP4CWRRYZF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4/action/storage_attestation","attest_author":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4/action/author_attestation","sign_citation":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4/action/citation_signature","submit_replication":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4/action/replication_record"}},"created_at":"2026-05-18T04:38:16.647600+00:00","updated_at":"2026-05-18T04:38:16.647600+00:00"}