{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KZ6AA63TGVKWXZWPBUQ4NT2MQH","short_pith_number":"pith:KZ6AA63T","schema_version":"1.0","canonical_sha256":"567c007b7335556be6cf0d21c6cf4c81ed29095fd71ae0ce8e6decffdc5ba13d","source":{"kind":"arxiv","id":"1502.03175","version":3},"attestation_state":"computed","paper":{"title":"Proximal Algorithms in Statistics and Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Brandon T. Willard, James G. Scott, Nicholas G. Polson","submitted_at":"2015-02-11T02:21:49Z","abstract_excerpt":"In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form solutions of proximal operators and envelope representations based on the Moreau, Forward-Backward, Douglas-Rachford and Half-Quadratic envelopes. Envelope representations lead to novel proximal algorithms for statistical optimisation of composite objective functions which include both non-smooth and non-convex objectives. We illustrate our methodology with regu"},"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":"1502.03175","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-11T02:21:49Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"3d0490d2bc91e3b77575d2a8ce21a5ee592803a6e5d20888c7b9ce7edb66e5b1","abstract_canon_sha256":"17cb43820dd78cfec75855437a1df3098925211e032734dffc449ade8443e4b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:57.769348Z","signature_b64":"ni3iL75em/TuI4OiI5XS22yhAH/h0gYBsz8K5GuLxtE0cYQOazGmlWSa8m3MeKB3MAgcpw+40uaA8p6p2474Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"567c007b7335556be6cf0d21c6cf4c81ed29095fd71ae0ce8e6decffdc5ba13d","last_reissued_at":"2026-05-18T01:59:57.768715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:57.768715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximal Algorithms in Statistics and Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Brandon T. Willard, James G. Scott, Nicholas G. Polson","submitted_at":"2015-02-11T02:21:49Z","abstract_excerpt":"In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form solutions of proximal operators and envelope representations based on the Moreau, Forward-Backward, Douglas-Rachford and Half-Quadratic envelopes. Envelope representations lead to novel proximal algorithms for statistical optimisation of composite objective functions which include both non-smooth and non-convex objectives. We illustrate our methodology with regu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03175","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":"1502.03175","created_at":"2026-05-18T01:59:57.768810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03175v3","created_at":"2026-05-18T01:59:57.768810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03175","created_at":"2026-05-18T01:59:57.768810+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZ6AA63TGVKW","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZ6AA63TGVKWXZWP","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZ6AA63T","created_at":"2026-05-18T12:29:29.992203+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/KZ6AA63TGVKWXZWPBUQ4NT2MQH","json":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH.json","graph_json":"https://pith.science/api/pith-number/KZ6AA63TGVKWXZWPBUQ4NT2MQH/graph.json","events_json":"https://pith.science/api/pith-number/KZ6AA63TGVKWXZWPBUQ4NT2MQH/events.json","paper":"https://pith.science/paper/KZ6AA63T"},"agent_actions":{"view_html":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH","download_json":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH.json","view_paper":"https://pith.science/paper/KZ6AA63T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03175&json=true","fetch_graph":"https://pith.science/api/pith-number/KZ6AA63TGVKWXZWPBUQ4NT2MQH/graph.json","fetch_events":"https://pith.science/api/pith-number/KZ6AA63TGVKWXZWPBUQ4NT2MQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH/action/storage_attestation","attest_author":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH/action/author_attestation","sign_citation":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH/action/citation_signature","submit_replication":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH/action/replication_record"}},"created_at":"2026-05-18T01:59:57.768810+00:00","updated_at":"2026-05-18T01:59:57.768810+00:00"}