{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MDSU56DXNUNAPVAHRDYOAJIIYY","short_pith_number":"pith:MDSU56DX","schema_version":"1.0","canonical_sha256":"60e54ef8776d1a07d40788f0e02508c61710e18e20f5822659d28842b7d0ad44","source":{"kind":"arxiv","id":"1407.7573","version":3},"attestation_state":"computed","paper":{"title":"Robust Block Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kimon Fountoulakis, Rachael Tappenden","submitted_at":"2014-07-28T21:15:26Z","abstract_excerpt":"In this paper we present a novel randomized block coordinate descent method for the minimization of a convex composite objective function. The method uses (approximate) partial second-order (curvature) information, so that the algorithm performance is more robust when applied to highly nonseparable or ill conditioned problems. We call the method Robust Coordinate Descent (RCD). At each iteration of RCD, a block of coordinates is sampled randomly, a quadratic model is formed about that block and the model is minimized approximately/inexactly to determine the search direction. An inexpensive lin"},"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":"1407.7573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-28T21:15:26Z","cross_cats_sorted":[],"title_canon_sha256":"a16856cad21a5ec7ea6af38dae7dd419517c6980030e26fea82b708a983f9a0b","abstract_canon_sha256":"6bf7364044f9e8467b4926a292009121c79db60c48538d96d9e093baf401f720"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:39.296348Z","signature_b64":"RGJuGvzayRRYn6/GVhmPLfyp6BM2Mfw70TIB9RBjfo6Dngd1RvGHdo3JYCyOu2iP/YSPjqfvS2XyRnjU6wF7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60e54ef8776d1a07d40788f0e02508c61710e18e20f5822659d28842b7d0ad44","last_reissued_at":"2026-05-18T02:16:39.295614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:39.295614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Block Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kimon Fountoulakis, Rachael Tappenden","submitted_at":"2014-07-28T21:15:26Z","abstract_excerpt":"In this paper we present a novel randomized block coordinate descent method for the minimization of a convex composite objective function. The method uses (approximate) partial second-order (curvature) information, so that the algorithm performance is more robust when applied to highly nonseparable or ill conditioned problems. We call the method Robust Coordinate Descent (RCD). At each iteration of RCD, a block of coordinates is sampled randomly, a quadratic model is formed about that block and the model is minimized approximately/inexactly to determine the search direction. An inexpensive lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7573","kind":"arxiv","version":3},"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":"1407.7573","created_at":"2026-05-18T02:16:39.295733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7573v3","created_at":"2026-05-18T02:16:39.295733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7573","created_at":"2026-05-18T02:16:39.295733+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDSU56DXNUNA","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDSU56DXNUNAPVAH","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDSU56DX","created_at":"2026-05-18T12:28:38.356838+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/MDSU56DXNUNAPVAHRDYOAJIIYY","json":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY.json","graph_json":"https://pith.science/api/pith-number/MDSU56DXNUNAPVAHRDYOAJIIYY/graph.json","events_json":"https://pith.science/api/pith-number/MDSU56DXNUNAPVAHRDYOAJIIYY/events.json","paper":"https://pith.science/paper/MDSU56DX"},"agent_actions":{"view_html":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY","download_json":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY.json","view_paper":"https://pith.science/paper/MDSU56DX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7573&json=true","fetch_graph":"https://pith.science/api/pith-number/MDSU56DXNUNAPVAHRDYOAJIIYY/graph.json","fetch_events":"https://pith.science/api/pith-number/MDSU56DXNUNAPVAHRDYOAJIIYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY/action/storage_attestation","attest_author":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY/action/author_attestation","sign_citation":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY/action/citation_signature","submit_replication":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY/action/replication_record"}},"created_at":"2026-05-18T02:16:39.295733+00:00","updated_at":"2026-05-18T02:16:39.295733+00:00"}