{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RYZRAP5MI46CQA6FWTVFJPSSGA","short_pith_number":"pith:RYZRAP5M","schema_version":"1.0","canonical_sha256":"8e33103fac473c2803c5b4ea54be52302f0ab930777c5c978530683e5c76e953","source":{"kind":"arxiv","id":"1811.08990","version":1},"attestation_state":"computed","paper":{"title":"Markov Chain Block Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Tao Sun, Wotao Yin, Yangyang Xu, Yuejiao Sun","submitted_at":"2018-11-22T01:51:15Z","abstract_excerpt":"The method of block coordinate gradient descent (BCD) has been a powerful method for large-scale optimization. This paper considers the BCD method that successively updates a series of blocks selected according to a Markov chain. This kind of block selection is neither i.i.d. random nor cyclic. On the other hand, it is a natural choice for some applications in distributed optimization and Markov decision process, where i.i.d. random and cyclic selections are either infeasible or very expensive. By applying mixing-time properties of a Markov chain, we prove convergence of Markov chain BCD for m"},"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":"1811.08990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-22T01:51:15Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"9c916158cbc919aca357268b8d98b66b45607e8046ce33cbd40e82bf757867d1","abstract_canon_sha256":"518d8542bbb8c6437f0b0997257372b3387ab6eec6465d737a612527dbccf356"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:07.373190Z","signature_b64":"HnKC0KcUF3tt2wpXhneLhyg62yStq3Mo99aQF5RC9TZuiAMB2pFiEoxkK67lGhCUHSjc/FbpAOeilktl0EAxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e33103fac473c2803c5b4ea54be52302f0ab930777c5c978530683e5c76e953","last_reissued_at":"2026-05-18T00:00:07.372630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:07.372630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov Chain Block Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Tao Sun, Wotao Yin, Yangyang Xu, Yuejiao Sun","submitted_at":"2018-11-22T01:51:15Z","abstract_excerpt":"The method of block coordinate gradient descent (BCD) has been a powerful method for large-scale optimization. This paper considers the BCD method that successively updates a series of blocks selected according to a Markov chain. This kind of block selection is neither i.i.d. random nor cyclic. On the other hand, it is a natural choice for some applications in distributed optimization and Markov decision process, where i.i.d. random and cyclic selections are either infeasible or very expensive. By applying mixing-time properties of a Markov chain, we prove convergence of Markov chain BCD for m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08990","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":"1811.08990","created_at":"2026-05-18T00:00:07.372720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08990v1","created_at":"2026-05-18T00:00:07.372720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08990","created_at":"2026-05-18T00:00:07.372720+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYZRAP5MI46C","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYZRAP5MI46CQA6F","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYZRAP5M","created_at":"2026-05-18T12:32:50.500415+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/RYZRAP5MI46CQA6FWTVFJPSSGA","json":"https://pith.science/pith/RYZRAP5MI46CQA6FWTVFJPSSGA.json","graph_json":"https://pith.science/api/pith-number/RYZRAP5MI46CQA6FWTVFJPSSGA/graph.json","events_json":"https://pith.science/api/pith-number/RYZRAP5MI46CQA6FWTVFJPSSGA/events.json","paper":"https://pith.science/paper/RYZRAP5M"},"agent_actions":{"view_html":"https://pith.science/pith/RYZRAP5MI46CQA6FWTVFJPSSGA","download_json":"https://pith.science/pith/RYZRAP5MI46CQA6FWTVFJPSSGA.json","view_paper":"https://pith.science/paper/RYZRAP5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08990&json=true","fetch_graph":"https://pith.science/api/pith-number/RYZRAP5MI46CQA6FWTVFJPSSGA/graph.json","fetch_events":"https://pith.science/api/pith-number/RYZRAP5MI46CQA6FWTVFJPSSGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYZRAP5MI46CQA6FWTVFJPSSGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYZRAP5MI46CQA6FWTVFJPSSGA/action/storage_attestation","attest_author":"https://pith.science/pith/RYZRAP5MI46CQA6FWTVFJPSSGA/action/author_attestation","sign_citation":"https://pith.science/pith/RYZRAP5MI46CQA6FWTVFJPSSGA/action/citation_signature","submit_replication":"https://pith.science/pith/RYZRAP5MI46CQA6FWTVFJPSSGA/action/replication_record"}},"created_at":"2026-05-18T00:00:07.372720+00:00","updated_at":"2026-05-18T00:00:07.372720+00:00"}