{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UYOFAH7375O2MXXCDMR6CAJCLY","short_pith_number":"pith:UYOFAH73","schema_version":"1.0","canonical_sha256":"a61c501ffbff5da65ee21b23e101225e3042058436693420bee2b56b54dab75c","source":{"kind":"arxiv","id":"1512.04680","version":1},"attestation_state":"computed","paper":{"title":"Improved Iteration Complexity Bounds of Cyclic Block Coordinate Descent for Convex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mingyi Hong, Ruoyu Sun","submitted_at":"2015-12-15T08:44:44Z","abstract_excerpt":"The iteration complexity of the block-coordinate descent (BCD) type algorithm has been under extensive investigation. It was recently shown that for convex problems the classical cyclic BCGD (block coordinate gradient descent) achieves an $\\mathcal{O}(1/r)$ complexity ($r$ is the number of passes of all blocks). However, such bounds are at least linearly depend on $K$ (the number of variable blocks), and are at least $K$ times worse than those of the gradient descent (GD) and proximal gradient (PG) methods. In this paper, we aim to close such theoretical performance gap between cyclic BCD and "},"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":"1512.04680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-15T08:44:44Z","cross_cats_sorted":[],"title_canon_sha256":"53592880a1da9e630867225c69824d450fadd52420caa4350beccdf8158c00c1","abstract_canon_sha256":"2c32edcd2ee17baa855ecae0d3297e6f8b483ce7add5d058d5fcffde50088fc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:19.688227Z","signature_b64":"90EAQOOPUxyktmUGjjuOeBrG/B3IXf2SNDds5B2VepW5Ff77c6IMLxFo+4zFyHu8TZHSKW3anyct3DYEBlkSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a61c501ffbff5da65ee21b23e101225e3042058436693420bee2b56b54dab75c","last_reissued_at":"2026-05-18T01:24:19.687767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:19.687767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Iteration Complexity Bounds of Cyclic Block Coordinate Descent for Convex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mingyi Hong, Ruoyu Sun","submitted_at":"2015-12-15T08:44:44Z","abstract_excerpt":"The iteration complexity of the block-coordinate descent (BCD) type algorithm has been under extensive investigation. It was recently shown that for convex problems the classical cyclic BCGD (block coordinate gradient descent) achieves an $\\mathcal{O}(1/r)$ complexity ($r$ is the number of passes of all blocks). However, such bounds are at least linearly depend on $K$ (the number of variable blocks), and are at least $K$ times worse than those of the gradient descent (GD) and proximal gradient (PG) methods. In this paper, we aim to close such theoretical performance gap between cyclic BCD and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04680","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":"1512.04680","created_at":"2026-05-18T01:24:19.687852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04680v1","created_at":"2026-05-18T01:24:19.687852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04680","created_at":"2026-05-18T01:24:19.687852+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYOFAH7375O2","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYOFAH7375O2MXXC","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYOFAH73","created_at":"2026-05-18T12:29:44.643036+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/UYOFAH7375O2MXXCDMR6CAJCLY","json":"https://pith.science/pith/UYOFAH7375O2MXXCDMR6CAJCLY.json","graph_json":"https://pith.science/api/pith-number/UYOFAH7375O2MXXCDMR6CAJCLY/graph.json","events_json":"https://pith.science/api/pith-number/UYOFAH7375O2MXXCDMR6CAJCLY/events.json","paper":"https://pith.science/paper/UYOFAH73"},"agent_actions":{"view_html":"https://pith.science/pith/UYOFAH7375O2MXXCDMR6CAJCLY","download_json":"https://pith.science/pith/UYOFAH7375O2MXXCDMR6CAJCLY.json","view_paper":"https://pith.science/paper/UYOFAH73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04680&json=true","fetch_graph":"https://pith.science/api/pith-number/UYOFAH7375O2MXXCDMR6CAJCLY/graph.json","fetch_events":"https://pith.science/api/pith-number/UYOFAH7375O2MXXCDMR6CAJCLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYOFAH7375O2MXXCDMR6CAJCLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYOFAH7375O2MXXCDMR6CAJCLY/action/storage_attestation","attest_author":"https://pith.science/pith/UYOFAH7375O2MXXCDMR6CAJCLY/action/author_attestation","sign_citation":"https://pith.science/pith/UYOFAH7375O2MXXCDMR6CAJCLY/action/citation_signature","submit_replication":"https://pith.science/pith/UYOFAH7375O2MXXCDMR6CAJCLY/action/replication_record"}},"created_at":"2026-05-18T01:24:19.687852+00:00","updated_at":"2026-05-18T01:24:19.687852+00:00"}