{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YHFSS3EDRSYXA55PAF7J36TTQ4","short_pith_number":"pith:YHFSS3ED","schema_version":"1.0","canonical_sha256":"c1cb296c838cb17077af017e9dfa738702f895a0d52fa7e75b3a479e183d542f","source":{"kind":"arxiv","id":"1608.04826","version":1},"attestation_state":"computed","paper":{"title":"A better convergence analysis of the block coordinate descent method for large scale machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Rujie Liu, Ziqiang Shi","submitted_at":"2016-08-17T01:19:42Z","abstract_excerpt":"This paper considers the problems of unconstrained minimization of large scale smooth convex functions having block-coordinate-wise Lipschitz continuous gradients. The block coordinate descent (BCD) method are among the first optimization schemes suggested for solving such problems \\cite{nesterov2012efficiency}. We obtain a new lower (to our best knowledge the lowest currently) bound that is $16p^3$ times smaller than the best known on the information-based complexity of BCD method based on an effective technique called Performance Estimation Problem (PEP) proposed by Drori and Teboulle \\cite{"},"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":"1608.04826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T01:19:42Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"3f7859e28c9870f6fc47f1b7e3ad5694ccc01bfdfe5d948eba187c6ff24d7e18","abstract_canon_sha256":"e5869c28f1dff65fe11180cda7f4ef68735628ad50f21c08cbd532c05287b438"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:33.442112Z","signature_b64":"VNZZmfYYq7IxoSSv8tfh+c0EfmmGguqJriV8aNnO9bKAu40LxnM8nq8sIwiu8fUw9m70e6fOrImGiAERtJdNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1cb296c838cb17077af017e9dfa738702f895a0d52fa7e75b3a479e183d542f","last_reissued_at":"2026-05-18T01:08:33.441562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:33.441562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A better convergence analysis of the block coordinate descent method for large scale machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Rujie Liu, Ziqiang Shi","submitted_at":"2016-08-17T01:19:42Z","abstract_excerpt":"This paper considers the problems of unconstrained minimization of large scale smooth convex functions having block-coordinate-wise Lipschitz continuous gradients. The block coordinate descent (BCD) method are among the first optimization schemes suggested for solving such problems \\cite{nesterov2012efficiency}. We obtain a new lower (to our best knowledge the lowest currently) bound that is $16p^3$ times smaller than the best known on the information-based complexity of BCD method based on an effective technique called Performance Estimation Problem (PEP) proposed by Drori and Teboulle \\cite{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04826","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":"1608.04826","created_at":"2026-05-18T01:08:33.441667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04826v1","created_at":"2026-05-18T01:08:33.441667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04826","created_at":"2026-05-18T01:08:33.441667+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHFSS3EDRSYX","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHFSS3EDRSYXA55P","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHFSS3ED","created_at":"2026-05-18T12:30:53.716459+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/YHFSS3EDRSYXA55PAF7J36TTQ4","json":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4.json","graph_json":"https://pith.science/api/pith-number/YHFSS3EDRSYXA55PAF7J36TTQ4/graph.json","events_json":"https://pith.science/api/pith-number/YHFSS3EDRSYXA55PAF7J36TTQ4/events.json","paper":"https://pith.science/paper/YHFSS3ED"},"agent_actions":{"view_html":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4","download_json":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4.json","view_paper":"https://pith.science/paper/YHFSS3ED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04826&json=true","fetch_graph":"https://pith.science/api/pith-number/YHFSS3EDRSYXA55PAF7J36TTQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/YHFSS3EDRSYXA55PAF7J36TTQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4/action/storage_attestation","attest_author":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4/action/author_attestation","sign_citation":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4/action/citation_signature","submit_replication":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4/action/replication_record"}},"created_at":"2026-05-18T01:08:33.441667+00:00","updated_at":"2026-05-18T01:08:33.441667+00:00"}