{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CAICKEV4PDHB335VMT2R3OA6FE","short_pith_number":"pith:CAICKEV4","schema_version":"1.0","canonical_sha256":"10102512bc78ce1defb564f51db81e2932389227239da52b086b84fd7aba8f94","source":{"kind":"arxiv","id":"1107.2848","version":1},"attestation_state":"computed","paper":{"title":"Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik","submitted_at":"2011-07-14T15:25:31Z","abstract_excerpt":"In this paper we develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth block-separable convex function and prove that it obtains an $\\epsilon$-accurate solution with probability at least $1-\\rho$ in at most $O(\\tfrac{n}{\\epsilon} \\log \\tfrac{1}{\\rho})$ iterations, where $n$ is the number of blocks. For strongly convex functions the method converges linearly. This extends recent results of Nesterov [Efficiency of coordinate descent methods on huge-scale optimization problems, CORE Discussion Paper #2010/2], which cover the smooth case, to"},"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":"1107.2848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-14T15:25:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"51cf9c7eefe17ccd3e678362bc33908cf808e8952236b52376c2aa3bc33b6ea9","abstract_canon_sha256":"12dce6a53c5c75adc7f7b808b130cc09b89dd46adcebe56ea28cf69437d7f1ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:15.613548Z","signature_b64":"qJ1FZOkd/ydnvYMLZiKS5cZw/EEH5k75cDYO9IQNS8MIQg944nxXwtXI4YC0PKIu+dJTbLUjOcdvce6EadU6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10102512bc78ce1defb564f51db81e2932389227239da52b086b84fd7aba8f94","last_reissued_at":"2026-05-18T04:18:15.613156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:15.613156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik","submitted_at":"2011-07-14T15:25:31Z","abstract_excerpt":"In this paper we develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth block-separable convex function and prove that it obtains an $\\epsilon$-accurate solution with probability at least $1-\\rho$ in at most $O(\\tfrac{n}{\\epsilon} \\log \\tfrac{1}{\\rho})$ iterations, where $n$ is the number of blocks. For strongly convex functions the method converges linearly. This extends recent results of Nesterov [Efficiency of coordinate descent methods on huge-scale optimization problems, CORE Discussion Paper #2010/2], which cover the smooth case, to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2848","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":"1107.2848","created_at":"2026-05-18T04:18:15.613210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2848v1","created_at":"2026-05-18T04:18:15.613210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2848","created_at":"2026-05-18T04:18:15.613210+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAICKEV4PDHB","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAICKEV4PDHB335V","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAICKEV4","created_at":"2026-05-18T12:26:26.731475+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/CAICKEV4PDHB335VMT2R3OA6FE","json":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE.json","graph_json":"https://pith.science/api/pith-number/CAICKEV4PDHB335VMT2R3OA6FE/graph.json","events_json":"https://pith.science/api/pith-number/CAICKEV4PDHB335VMT2R3OA6FE/events.json","paper":"https://pith.science/paper/CAICKEV4"},"agent_actions":{"view_html":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE","download_json":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE.json","view_paper":"https://pith.science/paper/CAICKEV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2848&json=true","fetch_graph":"https://pith.science/api/pith-number/CAICKEV4PDHB335VMT2R3OA6FE/graph.json","fetch_events":"https://pith.science/api/pith-number/CAICKEV4PDHB335VMT2R3OA6FE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE/action/storage_attestation","attest_author":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE/action/author_attestation","sign_citation":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE/action/citation_signature","submit_replication":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE/action/replication_record"}},"created_at":"2026-05-18T04:18:15.613210+00:00","updated_at":"2026-05-18T04:18:15.613210+00:00"}