{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7A2LQ5HP4X4DUUK5T27PDC3QVC","short_pith_number":"pith:7A2LQ5HP","schema_version":"1.0","canonical_sha256":"f834b874efe5f83a515d9ebef18b70a89f30d4ac482756364c4871dc87d08e5a","source":{"kind":"arxiv","id":"1504.04636","version":2},"attestation_state":"computed","paper":{"title":"Consistent Learning by Composite Proximal Thresholding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Patrick L. Combettes, Saverio Salzo, Silvia Villa","submitted_at":"2015-04-17T20:56:07Z","abstract_excerpt":"We investigate the modeling and the numerical solution of machine learning problems with prediction functions which are linear combinations of elements of a possibly infinite-dimensional dictionary. We propose a novel flexible composite regularization model, which makes it possible to incorporate various priors on the coefficients of the prediction function, including sparsity and hard constraints. We show that the estimators obtained by minimizing the regularized empirical risk are consistent in a statistical sense, and we design an error-tolerant composite proximal thresholding algorithm for"},"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":"1504.04636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-04-17T20:56:07Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"deab238b82b360dd1641d199fba7cfe65b40d4b1ebf517bc14a9acfdadd460fc","abstract_canon_sha256":"3688906915c8ccdb0f532c70be3aa468610bd6e5d25502c13f9f0386fb41f016"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:30.634006Z","signature_b64":"pm6iqQS8iCBgh5xUqIq65iVd3w6PbCWgt8IwldPvVAtcmh7GP02OSaH/JgdmByJAcNdseEZ42+1Ko8GI0j35CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f834b874efe5f83a515d9ebef18b70a89f30d4ac482756364c4871dc87d08e5a","last_reissued_at":"2026-05-18T01:25:30.633598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:30.633598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistent Learning by Composite Proximal Thresholding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Patrick L. Combettes, Saverio Salzo, Silvia Villa","submitted_at":"2015-04-17T20:56:07Z","abstract_excerpt":"We investigate the modeling and the numerical solution of machine learning problems with prediction functions which are linear combinations of elements of a possibly infinite-dimensional dictionary. We propose a novel flexible composite regularization model, which makes it possible to incorporate various priors on the coefficients of the prediction function, including sparsity and hard constraints. We show that the estimators obtained by minimizing the regularized empirical risk are consistent in a statistical sense, and we design an error-tolerant composite proximal thresholding algorithm for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04636","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":"1504.04636","created_at":"2026-05-18T01:25:30.633656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04636v2","created_at":"2026-05-18T01:25:30.633656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04636","created_at":"2026-05-18T01:25:30.633656+00:00"},{"alias_kind":"pith_short_12","alias_value":"7A2LQ5HP4X4D","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"7A2LQ5HP4X4DUUK5","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"7A2LQ5HP","created_at":"2026-05-18T12:29:07.941421+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/7A2LQ5HP4X4DUUK5T27PDC3QVC","json":"https://pith.science/pith/7A2LQ5HP4X4DUUK5T27PDC3QVC.json","graph_json":"https://pith.science/api/pith-number/7A2LQ5HP4X4DUUK5T27PDC3QVC/graph.json","events_json":"https://pith.science/api/pith-number/7A2LQ5HP4X4DUUK5T27PDC3QVC/events.json","paper":"https://pith.science/paper/7A2LQ5HP"},"agent_actions":{"view_html":"https://pith.science/pith/7A2LQ5HP4X4DUUK5T27PDC3QVC","download_json":"https://pith.science/pith/7A2LQ5HP4X4DUUK5T27PDC3QVC.json","view_paper":"https://pith.science/paper/7A2LQ5HP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04636&json=true","fetch_graph":"https://pith.science/api/pith-number/7A2LQ5HP4X4DUUK5T27PDC3QVC/graph.json","fetch_events":"https://pith.science/api/pith-number/7A2LQ5HP4X4DUUK5T27PDC3QVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7A2LQ5HP4X4DUUK5T27PDC3QVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7A2LQ5HP4X4DUUK5T27PDC3QVC/action/storage_attestation","attest_author":"https://pith.science/pith/7A2LQ5HP4X4DUUK5T27PDC3QVC/action/author_attestation","sign_citation":"https://pith.science/pith/7A2LQ5HP4X4DUUK5T27PDC3QVC/action/citation_signature","submit_replication":"https://pith.science/pith/7A2LQ5HP4X4DUUK5T27PDC3QVC/action/replication_record"}},"created_at":"2026-05-18T01:25:30.633656+00:00","updated_at":"2026-05-18T01:25:30.633656+00:00"}