{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PZ6N3E3PYKIRQKR6RJ2EB3S5NM","short_pith_number":"pith:PZ6N3E3P","schema_version":"1.0","canonical_sha256":"7e7cdd936fc291182a3e8a7440ee5d6b39df1d4fbd6f09885c96689a4022ef0b","source":{"kind":"arxiv","id":"2005.09021","version":3},"attestation_state":"computed","paper":{"title":"The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Boaz Nadler, Ronen Basri, Tal Amir","submitted_at":"2020-05-18T18:43:06Z","abstract_excerpt":"We present a new approach to solve the sparse approximation or best subset selection problem, namely find a $k$-sparse vector ${\\bf x}\\in\\mathbb{R}^d$ that minimizes the $\\ell_2$ residual $\\lVert A{\\bf x}-{\\bf y} \\rVert_2$. We consider a regularized approach, whereby this residual is penalized by the non-convex $\\textit{trimmed lasso}$, defined as the $\\ell_1$-norm of ${\\bf x}$ excluding its $k$ largest-magnitude entries. We prove that the trimmed lasso has several appealing theoretical properties, and in particular derive sparse recovery guarantees assuming successful optimization of the pena"},"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":"2005.09021","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-18T18:43:06Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"7326e616f70a7ed7e25014b035b60891d4084179d762e29acd6fdc4fc3bac0bb","abstract_canon_sha256":"f91f3a6b5404a0c9daf99b5a4bf3685dd3e6ecbbea3ad73b245747e2b6f5c22e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:50:19.423563Z","signature_b64":"J8hvGYQ3rusc9OHLAt9MjJ1ahBjTLWoC/ViGZUPzaj3fuqB7ksVxCrTT23UmnPO1RA/7CzcuiZw1c5isgkObDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e7cdd936fc291182a3e8a7440ee5d6b39df1d4fbd6f09885c96689a4022ef0b","last_reissued_at":"2026-07-05T02:50:19.423109Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:50:19.423109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Boaz Nadler, Ronen Basri, Tal Amir","submitted_at":"2020-05-18T18:43:06Z","abstract_excerpt":"We present a new approach to solve the sparse approximation or best subset selection problem, namely find a $k$-sparse vector ${\\bf x}\\in\\mathbb{R}^d$ that minimizes the $\\ell_2$ residual $\\lVert A{\\bf x}-{\\bf y} \\rVert_2$. We consider a regularized approach, whereby this residual is penalized by the non-convex $\\textit{trimmed lasso}$, defined as the $\\ell_1$-norm of ${\\bf x}$ excluding its $k$ largest-magnitude entries. We prove that the trimmed lasso has several appealing theoretical properties, and in particular derive sparse recovery guarantees assuming successful optimization of the pena"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.09021","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.09021/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.09021","created_at":"2026-07-05T02:50:19.423167+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.09021v3","created_at":"2026-07-05T02:50:19.423167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.09021","created_at":"2026-07-05T02:50:19.423167+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZ6N3E3PYKIR","created_at":"2026-07-05T02:50:19.423167+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZ6N3E3PYKIRQKR6","created_at":"2026-07-05T02:50:19.423167+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZ6N3E3P","created_at":"2026-07-05T02:50:19.423167+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/PZ6N3E3PYKIRQKR6RJ2EB3S5NM","json":"https://pith.science/pith/PZ6N3E3PYKIRQKR6RJ2EB3S5NM.json","graph_json":"https://pith.science/api/pith-number/PZ6N3E3PYKIRQKR6RJ2EB3S5NM/graph.json","events_json":"https://pith.science/api/pith-number/PZ6N3E3PYKIRQKR6RJ2EB3S5NM/events.json","paper":"https://pith.science/paper/PZ6N3E3P"},"agent_actions":{"view_html":"https://pith.science/pith/PZ6N3E3PYKIRQKR6RJ2EB3S5NM","download_json":"https://pith.science/pith/PZ6N3E3PYKIRQKR6RJ2EB3S5NM.json","view_paper":"https://pith.science/paper/PZ6N3E3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.09021&json=true","fetch_graph":"https://pith.science/api/pith-number/PZ6N3E3PYKIRQKR6RJ2EB3S5NM/graph.json","fetch_events":"https://pith.science/api/pith-number/PZ6N3E3PYKIRQKR6RJ2EB3S5NM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZ6N3E3PYKIRQKR6RJ2EB3S5NM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZ6N3E3PYKIRQKR6RJ2EB3S5NM/action/storage_attestation","attest_author":"https://pith.science/pith/PZ6N3E3PYKIRQKR6RJ2EB3S5NM/action/author_attestation","sign_citation":"https://pith.science/pith/PZ6N3E3PYKIRQKR6RJ2EB3S5NM/action/citation_signature","submit_replication":"https://pith.science/pith/PZ6N3E3PYKIRQKR6RJ2EB3S5NM/action/replication_record"}},"created_at":"2026-07-05T02:50:19.423167+00:00","updated_at":"2026-07-05T02:50:19.423167+00:00"}