{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HOIHKGTZZWMCDXTOZRIN2U4E5L","short_pith_number":"pith:HOIHKGTZ","schema_version":"1.0","canonical_sha256":"3b90751a79cd9821de6ecc50dd5384ead2b060d111bffc1b79a307f6afcc1b47","source":{"kind":"arxiv","id":"1505.03410","version":3},"attestation_state":"computed","paper":{"title":"Mind the duality gap: safer rules for the Lasso","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Joseph Salmon, Olivier Fercoq","submitted_at":"2015-05-13T14:50:34Z","abstract_excerpt":"Screening rules allow to early discard irrelevant variables from the optimization in Lasso problems, or its derivatives, making solvers faster. In this paper, we propose new versions of the so-called $\\textit{safe rules}$ for the Lasso. Based on duality gap considerations, our new rules create safe test regions whose diameters converge to zero, provided that one relies on a converging solver. This property helps screening out more variables, for a wider range of regularization parameter values. In addition to faster convergence, we prove that we correctly identify the active sets (supports) of"},"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":"1505.03410","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-13T14:50:34Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"title_canon_sha256":"417f0f00aad6a42866344bbd28c704996f51dc892e9c089a42a5f89b2605b2d1","abstract_canon_sha256":"98709fbdce5ad46c1d156c28121222b5dff97f3fe43fce3a0da53a33335874da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:18.129886Z","signature_b64":"K+PAgt+QqI3KZ6y9AcPOJir92DjzYmrmZSyuyMmnInjtMFVO+usGvP9ntDWUuCB+CaKrdqJkSOH2joRLCJQvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b90751a79cd9821de6ecc50dd5384ead2b060d111bffc1b79a307f6afcc1b47","last_reissued_at":"2026-05-18T01:25:18.129165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:18.129165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mind the duality gap: safer rules for the Lasso","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Joseph Salmon, Olivier Fercoq","submitted_at":"2015-05-13T14:50:34Z","abstract_excerpt":"Screening rules allow to early discard irrelevant variables from the optimization in Lasso problems, or its derivatives, making solvers faster. In this paper, we propose new versions of the so-called $\\textit{safe rules}$ for the Lasso. Based on duality gap considerations, our new rules create safe test regions whose diameters converge to zero, provided that one relies on a converging solver. This property helps screening out more variables, for a wider range of regularization parameter values. In addition to faster convergence, we prove that we correctly identify the active sets (supports) of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03410","kind":"arxiv","version":3},"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":"1505.03410","created_at":"2026-05-18T01:25:18.129274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03410v3","created_at":"2026-05-18T01:25:18.129274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03410","created_at":"2026-05-18T01:25:18.129274+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOIHKGTZZWMC","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOIHKGTZZWMCDXTO","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOIHKGTZ","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09171","citing_title":"SHIELD: Scalable Optimal Control with Certification using Duality and Convexity","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09171","citing_title":"SHIELD: Scalable Optimal Control with Certification using Duality and Convexity","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HOIHKGTZZWMCDXTOZRIN2U4E5L","json":"https://pith.science/pith/HOIHKGTZZWMCDXTOZRIN2U4E5L.json","graph_json":"https://pith.science/api/pith-number/HOIHKGTZZWMCDXTOZRIN2U4E5L/graph.json","events_json":"https://pith.science/api/pith-number/HOIHKGTZZWMCDXTOZRIN2U4E5L/events.json","paper":"https://pith.science/paper/HOIHKGTZ"},"agent_actions":{"view_html":"https://pith.science/pith/HOIHKGTZZWMCDXTOZRIN2U4E5L","download_json":"https://pith.science/pith/HOIHKGTZZWMCDXTOZRIN2U4E5L.json","view_paper":"https://pith.science/paper/HOIHKGTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03410&json=true","fetch_graph":"https://pith.science/api/pith-number/HOIHKGTZZWMCDXTOZRIN2U4E5L/graph.json","fetch_events":"https://pith.science/api/pith-number/HOIHKGTZZWMCDXTOZRIN2U4E5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOIHKGTZZWMCDXTOZRIN2U4E5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOIHKGTZZWMCDXTOZRIN2U4E5L/action/storage_attestation","attest_author":"https://pith.science/pith/HOIHKGTZZWMCDXTOZRIN2U4E5L/action/author_attestation","sign_citation":"https://pith.science/pith/HOIHKGTZZWMCDXTOZRIN2U4E5L/action/citation_signature","submit_replication":"https://pith.science/pith/HOIHKGTZZWMCDXTOZRIN2U4E5L/action/replication_record"}},"created_at":"2026-05-18T01:25:18.129274+00:00","updated_at":"2026-05-18T01:25:18.129274+00:00"}