{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L3CSMHSIWALXEZFPWE5KLSB2GD","short_pith_number":"pith:L3CSMHSI","canonical_record":{"source":{"id":"1210.5034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-18T06:27:10Z","cross_cats_sorted":["cs.CV","cs.NA"],"title_canon_sha256":"a22c1a89310b23448015aae61fc1f69beb098e77c1984a176708ca941a5abdb0","abstract_canon_sha256":"617547a32fe9d761b90492e773fa11823fc9ab1bfb289b3fc1508aa8e1d787b2"},"schema_version":"1.0"},"canonical_sha256":"5ec5261e48b0177264afb13aa5c83a30d1e0ff31879545afe0feae2616aec4fd","source":{"kind":"arxiv","id":"1210.5034","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5034","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5034v2","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5034","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"L3CSMHSIWALX","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L3CSMHSIWALXEZFP","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L3CSMHSI","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L3CSMHSIWALXEZFPWE5KLSB2GD","target":"record","payload":{"canonical_record":{"source":{"id":"1210.5034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-18T06:27:10Z","cross_cats_sorted":["cs.CV","cs.NA"],"title_canon_sha256":"a22c1a89310b23448015aae61fc1f69beb098e77c1984a176708ca941a5abdb0","abstract_canon_sha256":"617547a32fe9d761b90492e773fa11823fc9ab1bfb289b3fc1508aa8e1d787b2"},"schema_version":"1.0"},"canonical_sha256":"5ec5261e48b0177264afb13aa5c83a30d1e0ff31879545afe0feae2616aec4fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:43.753569Z","signature_b64":"fWswvkBoiYzZu/qsziw4FM0IZOC5oDbUDFhT6O5VpH7S21HGFd/OyCOGRIB75HE84x8K/k7SZ+qNzdkNi6wwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ec5261e48b0177264afb13aa5c83a30d1e0ff31879545afe0feae2616aec4fd","last_reissued_at":"2026-05-18T03:42:43.752939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:43.752939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.5034","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPBOugNtMhS5joFSrSEkScfYdrSmVC23aA7cmUXx0pNTlkK6M16sjRDj4SRRxX2bjrovXsAJ9jDqMaF2XvVMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:28:51.349704Z"},"content_sha256":"ff57ac6a2e05f410e634d3520f2ee39bf31f82c1c89ad9ded3e21d7edbc0c53c","schema_version":"1.0","event_id":"sha256:ff57ac6a2e05f410e634d3520f2ee39bf31f82c1c89ad9ded3e21d7edbc0c53c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L3CSMHSIWALXEZFPWE5KLSB2GD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Computational Trade-Off of Inexact Proximal Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NA"],"primary_cat":"cs.LG","authors_text":"LSIS), Luca Baldassarre (EPFL), Pierre Machart (LIF, Sandrine Anthoine (LATP)","submitted_at":"2012-10-18T06:27:10Z","abstract_excerpt":"In this paper, we investigate the trade-off between convergence rate and computational cost when minimizing a composite functional with proximal-gradient methods, which are popular optimisation tools in machine learning. We consider the case when the proximity operator is computed via an iterative procedure, which provides an approximation of the exact proximity operator. In that case, we obtain algorithms with two nested loops. We show that the strategy that minimizes the computational cost to reach a solution with a desired accuracy in finite time is to set the number of inner iterations to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5034","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goUgrPa7/2dYlPZTA8ENO/DEJhiKAdgF363amRAYZiUtU9fnHiswmZjkEPMwJprAJ/iB18YnRAOxLCigx1uEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:28:51.350063Z"},"content_sha256":"4e3e155ddd9414a4cbed74f6b2260f593c3f5549e8688664338704c452c5fafb","schema_version":"1.0","event_id":"sha256:4e3e155ddd9414a4cbed74f6b2260f593c3f5549e8688664338704c452c5fafb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3CSMHSIWALXEZFPWE5KLSB2GD/bundle.json","state_url":"https://pith.science/pith/L3CSMHSIWALXEZFPWE5KLSB2GD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3CSMHSIWALXEZFPWE5KLSB2GD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T10:28:51Z","links":{"resolver":"https://pith.science/pith/L3CSMHSIWALXEZFPWE5KLSB2GD","bundle":"https://pith.science/pith/L3CSMHSIWALXEZFPWE5KLSB2GD/bundle.json","state":"https://pith.science/pith/L3CSMHSIWALXEZFPWE5KLSB2GD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3CSMHSIWALXEZFPWE5KLSB2GD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L3CSMHSIWALXEZFPWE5KLSB2GD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"617547a32fe9d761b90492e773fa11823fc9ab1bfb289b3fc1508aa8e1d787b2","cross_cats_sorted":["cs.CV","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-18T06:27:10Z","title_canon_sha256":"a22c1a89310b23448015aae61fc1f69beb098e77c1984a176708ca941a5abdb0"},"schema_version":"1.0","source":{"id":"1210.5034","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5034","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5034v2","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5034","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"L3CSMHSIWALX","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L3CSMHSIWALXEZFP","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L3CSMHSI","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:4e3e155ddd9414a4cbed74f6b2260f593c3f5549e8688664338704c452c5fafb","target":"graph","created_at":"2026-05-18T03:42:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we investigate the trade-off between convergence rate and computational cost when minimizing a composite functional with proximal-gradient methods, which are popular optimisation tools in machine learning. We consider the case when the proximity operator is computed via an iterative procedure, which provides an approximation of the exact proximity operator. In that case, we obtain algorithms with two nested loops. We show that the strategy that minimizes the computational cost to reach a solution with a desired accuracy in finite time is to set the number of inner iterations to ","authors_text":"LSIS), Luca Baldassarre (EPFL), Pierre Machart (LIF, Sandrine Anthoine (LATP)","cross_cats":["cs.CV","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-18T06:27:10Z","title":"Optimal Computational Trade-Off of Inexact Proximal Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5034","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ff57ac6a2e05f410e634d3520f2ee39bf31f82c1c89ad9ded3e21d7edbc0c53c","target":"record","created_at":"2026-05-18T03:42:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"617547a32fe9d761b90492e773fa11823fc9ab1bfb289b3fc1508aa8e1d787b2","cross_cats_sorted":["cs.CV","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-18T06:27:10Z","title_canon_sha256":"a22c1a89310b23448015aae61fc1f69beb098e77c1984a176708ca941a5abdb0"},"schema_version":"1.0","source":{"id":"1210.5034","kind":"arxiv","version":2}},"canonical_sha256":"5ec5261e48b0177264afb13aa5c83a30d1e0ff31879545afe0feae2616aec4fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ec5261e48b0177264afb13aa5c83a30d1e0ff31879545afe0feae2616aec4fd","first_computed_at":"2026-05-18T03:42:43.752939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:43.752939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fWswvkBoiYzZu/qsziw4FM0IZOC5oDbUDFhT6O5VpH7S21HGFd/OyCOGRIB75HE84x8K/k7SZ+qNzdkNi6wwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:43.753569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.5034","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff57ac6a2e05f410e634d3520f2ee39bf31f82c1c89ad9ded3e21d7edbc0c53c","sha256:4e3e155ddd9414a4cbed74f6b2260f593c3f5549e8688664338704c452c5fafb"],"state_sha256":"abbe25bd5aaa0c48981fee2ee8abcb506b3e8c3c7b56c52b20c1605b095a9ede"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/GsQ8N5g1qnZr6yBwZuvp3ucpdUUajpb66nHcxh0Ui4POxbwgKcOKKl3f3ocdjo9AvQwe0nQZpAwKuI7/kiEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:28:51.352065Z","bundle_sha256":"0787eab588fae34b1aae48aec6710aff997872c4320ae48c9742575840af635e"}}