{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CSJCICBW3X52K6COREHIYQR2AA","short_pith_number":"pith:CSJCICBW","schema_version":"1.0","canonical_sha256":"1492240836ddfba5784e890e8c423a00213e84e139b28e155f936b8d1ddf2698","source":{"kind":"arxiv","id":"1708.04527","version":1},"attestation_state":"computed","paper":{"title":"The Trimmed Lasso: Sparsity and Robustness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.ST","stat.CO","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Dimitris Bertsimas, Martin S. Copenhaver, Rahul Mazumder","submitted_at":"2017-08-15T14:56:28Z","abstract_excerpt":"Nonconvex penalty methods for sparse modeling in linear regression have been a topic of fervent interest in recent years. Herein, we study a family of nonconvex penalty functions that we call the trimmed Lasso and that offers exact control over the desired level of sparsity of estimators. We analyze its structural properties and in doing so show the following:\n  1) Drawing parallels between robust statistics and robust optimization, we show that the trimmed-Lasso-regularized least squares problem can be viewed as a generalized form of total least squares under a specific model of uncertainty. "},"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":"1708.04527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-08-15T14:56:28Z","cross_cats_sorted":["math.OC","math.ST","stat.CO","stat.ML","stat.TH"],"title_canon_sha256":"6b4a6f8d20def0a9f3e432e4ca8ba13175c8365c335f9d45b1f9d5c37c9d82b3","abstract_canon_sha256":"7665fb40e470d352fc34b0f5d5da85e008761ff6e82a232a862b4d556d50d747"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:59.084770Z","signature_b64":"KR5C1rPF8bElAPiI9WXmrPY5oJPH58bxBBHvF59m0i02sCrfxjt0eAORZc6PbgvwISNeIilHH+vuFR7vrvCGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1492240836ddfba5784e890e8c423a00213e84e139b28e155f936b8d1ddf2698","last_reissued_at":"2026-05-18T00:37:59.084307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:59.084307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Trimmed Lasso: Sparsity and Robustness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.ST","stat.CO","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Dimitris Bertsimas, Martin S. Copenhaver, Rahul Mazumder","submitted_at":"2017-08-15T14:56:28Z","abstract_excerpt":"Nonconvex penalty methods for sparse modeling in linear regression have been a topic of fervent interest in recent years. Herein, we study a family of nonconvex penalty functions that we call the trimmed Lasso and that offers exact control over the desired level of sparsity of estimators. We analyze its structural properties and in doing so show the following:\n  1) Drawing parallels between robust statistics and robust optimization, we show that the trimmed-Lasso-regularized least squares problem can be viewed as a generalized form of total least squares under a specific model of uncertainty. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04527","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":"1708.04527","created_at":"2026-05-18T00:37:59.084397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04527v1","created_at":"2026-05-18T00:37:59.084397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04527","created_at":"2026-05-18T00:37:59.084397+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSJCICBW3X52","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSJCICBW3X52K6CO","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSJCICBW","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07523","citing_title":"RoseCDL: Robust and Scalable Convolutional Dictionary Learning for Rare event and Anomaly Detection","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CSJCICBW3X52K6COREHIYQR2AA","json":"https://pith.science/pith/CSJCICBW3X52K6COREHIYQR2AA.json","graph_json":"https://pith.science/api/pith-number/CSJCICBW3X52K6COREHIYQR2AA/graph.json","events_json":"https://pith.science/api/pith-number/CSJCICBW3X52K6COREHIYQR2AA/events.json","paper":"https://pith.science/paper/CSJCICBW"},"agent_actions":{"view_html":"https://pith.science/pith/CSJCICBW3X52K6COREHIYQR2AA","download_json":"https://pith.science/pith/CSJCICBW3X52K6COREHIYQR2AA.json","view_paper":"https://pith.science/paper/CSJCICBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04527&json=true","fetch_graph":"https://pith.science/api/pith-number/CSJCICBW3X52K6COREHIYQR2AA/graph.json","fetch_events":"https://pith.science/api/pith-number/CSJCICBW3X52K6COREHIYQR2AA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSJCICBW3X52K6COREHIYQR2AA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSJCICBW3X52K6COREHIYQR2AA/action/storage_attestation","attest_author":"https://pith.science/pith/CSJCICBW3X52K6COREHIYQR2AA/action/author_attestation","sign_citation":"https://pith.science/pith/CSJCICBW3X52K6COREHIYQR2AA/action/citation_signature","submit_replication":"https://pith.science/pith/CSJCICBW3X52K6COREHIYQR2AA/action/replication_record"}},"created_at":"2026-05-18T00:37:59.084397+00:00","updated_at":"2026-05-18T00:37:59.084397+00:00"}