{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6CSU53FVUSNRC6SULGJH3URDR7","short_pith_number":"pith:6CSU53FV","schema_version":"1.0","canonical_sha256":"f0a54eecb5a49b117a5459927dd2238fe0905b5e3b80c27f85e1469c67ffbb7d","source":{"kind":"arxiv","id":"1109.2415","version":2},"attestation_state":"computed","paper":{"title":"Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Francis Bach (INRIA Paris - Rocquencourt, LIENS), Mark Schmidt (INRIA Paris - Rocquencourt, Nicolas Le Roux (INRIA Paris - Rocquencourt","submitted_at":"2011-09-12T09:45:02Z","abstract_excerpt":"We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity operator with respect to the non-smooth term. We show that both the basic proximal-gradient method and the accelerated proximal-gradient method achieve the same convergence rate as in the error-free case, provided that the errors decrease at appropriate rates.Using these rates, we perform as well as or better than a carefully chosen fixed error level on a se"},"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":"1109.2415","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-12T09:45:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1341921bcae838e515e53b43f4b558b64e71ec5818dbd3f1bbfd70fd277aacde","abstract_canon_sha256":"b48ff6a5bc2a1c6b114e369efa44c743c93efe328707056f0d8c5e7226616e25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:17.487128Z","signature_b64":"wa78VqamHDxHn8I1JoeG97h2WV8GLUzXBvJS+DM37ZtwXEjTOC0VQxu97WW0wlJTrjM8L7wXXvvLVYK0fLMIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a54eecb5a49b117a5459927dd2238fe0905b5e3b80c27f85e1469c67ffbb7d","last_reissued_at":"2026-05-18T04:07:17.486302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:17.486302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Francis Bach (INRIA Paris - Rocquencourt, LIENS), Mark Schmidt (INRIA Paris - Rocquencourt, Nicolas Le Roux (INRIA Paris - Rocquencourt","submitted_at":"2011-09-12T09:45:02Z","abstract_excerpt":"We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity operator with respect to the non-smooth term. We show that both the basic proximal-gradient method and the accelerated proximal-gradient method achieve the same convergence rate as in the error-free case, provided that the errors decrease at appropriate rates.Using these rates, we perform as well as or better than a carefully chosen fixed error level on a se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2415","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":"1109.2415","created_at":"2026-05-18T04:07:17.486452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2415v2","created_at":"2026-05-18T04:07:17.486452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2415","created_at":"2026-05-18T04:07:17.486452+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CSU53FVUSNR","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CSU53FVUSNRC6SU","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CSU53FV","created_at":"2026-05-18T12:26:22.705136+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/6CSU53FVUSNRC6SULGJH3URDR7","json":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7.json","graph_json":"https://pith.science/api/pith-number/6CSU53FVUSNRC6SULGJH3URDR7/graph.json","events_json":"https://pith.science/api/pith-number/6CSU53FVUSNRC6SULGJH3URDR7/events.json","paper":"https://pith.science/paper/6CSU53FV"},"agent_actions":{"view_html":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7","download_json":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7.json","view_paper":"https://pith.science/paper/6CSU53FV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2415&json=true","fetch_graph":"https://pith.science/api/pith-number/6CSU53FVUSNRC6SULGJH3URDR7/graph.json","fetch_events":"https://pith.science/api/pith-number/6CSU53FVUSNRC6SULGJH3URDR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7/action/storage_attestation","attest_author":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7/action/author_attestation","sign_citation":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7/action/citation_signature","submit_replication":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7/action/replication_record"}},"created_at":"2026-05-18T04:07:17.486452+00:00","updated_at":"2026-05-18T04:07:17.486452+00:00"}