{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6PP77UPTCUBOQEJEP6WLXNAZMW","short_pith_number":"pith:6PP77UPT","schema_version":"1.0","canonical_sha256":"f3dfffd1f31502e811247facbbb41965af2bc2bd83ea02b135698fab476c7b8f","source":{"kind":"arxiv","id":"1809.09354","version":2},"attestation_state":"computed","paper":{"title":"Accelerated Coordinate Descent with Arbitrary Sampling and Best Rates for Minibatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Filip Hanzely, Peter Richt\\'arik","submitted_at":"2018-09-25T07:49:52Z","abstract_excerpt":"Accelerated coordinate descent is a widely popular optimization algorithm due to its efficiency on large-dimensional problems. It achieves state-of-the-art complexity on an important class of empirical risk minimization problems. In this paper we design and analyze an accelerated coordinate descent (ACD) method which in each iteration updates a random subset of coordinates according to an arbitrary but fixed probability law, which is a parameter of the method. If all coordinates are updated in each iteration, our method reduces to the classical accelerated gradient descent method AGD of Nester"},"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":"1809.09354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-25T07:49:52Z","cross_cats_sorted":[],"title_canon_sha256":"0e0d415874c664629b3568599caaf86016183679714cd5520cc336e23527789a","abstract_canon_sha256":"36636131774dfad13d0826b671a31925d65cee3d8d75ca3a365c721658317127"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:35.359372Z","signature_b64":"Bf6iB0TcZ75FT0+07ijvverFAZ2Ppja6PcF1wqITmF91lOWEYXrCW/zPdyF3fn3cFxSz4Z5sLxV8nMkf8vtvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3dfffd1f31502e811247facbbb41965af2bc2bd83ea02b135698fab476c7b8f","last_reissued_at":"2026-05-18T00:04:35.358793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:35.358793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Coordinate Descent with Arbitrary Sampling and Best Rates for Minibatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Filip Hanzely, Peter Richt\\'arik","submitted_at":"2018-09-25T07:49:52Z","abstract_excerpt":"Accelerated coordinate descent is a widely popular optimization algorithm due to its efficiency on large-dimensional problems. It achieves state-of-the-art complexity on an important class of empirical risk minimization problems. In this paper we design and analyze an accelerated coordinate descent (ACD) method which in each iteration updates a random subset of coordinates according to an arbitrary but fixed probability law, which is a parameter of the method. If all coordinates are updated in each iteration, our method reduces to the classical accelerated gradient descent method AGD of Nester"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09354","kind":"arxiv","version":2},"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":"1809.09354","created_at":"2026-05-18T00:04:35.358857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09354v2","created_at":"2026-05-18T00:04:35.358857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09354","created_at":"2026-05-18T00:04:35.358857+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PP77UPTCUBO","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PP77UPTCUBOQEJE","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PP77UPT","created_at":"2026-05-18T12:32:11.075285+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/6PP77UPTCUBOQEJEP6WLXNAZMW","json":"https://pith.science/pith/6PP77UPTCUBOQEJEP6WLXNAZMW.json","graph_json":"https://pith.science/api/pith-number/6PP77UPTCUBOQEJEP6WLXNAZMW/graph.json","events_json":"https://pith.science/api/pith-number/6PP77UPTCUBOQEJEP6WLXNAZMW/events.json","paper":"https://pith.science/paper/6PP77UPT"},"agent_actions":{"view_html":"https://pith.science/pith/6PP77UPTCUBOQEJEP6WLXNAZMW","download_json":"https://pith.science/pith/6PP77UPTCUBOQEJEP6WLXNAZMW.json","view_paper":"https://pith.science/paper/6PP77UPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09354&json=true","fetch_graph":"https://pith.science/api/pith-number/6PP77UPTCUBOQEJEP6WLXNAZMW/graph.json","fetch_events":"https://pith.science/api/pith-number/6PP77UPTCUBOQEJEP6WLXNAZMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PP77UPTCUBOQEJEP6WLXNAZMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PP77UPTCUBOQEJEP6WLXNAZMW/action/storage_attestation","attest_author":"https://pith.science/pith/6PP77UPTCUBOQEJEP6WLXNAZMW/action/author_attestation","sign_citation":"https://pith.science/pith/6PP77UPTCUBOQEJEP6WLXNAZMW/action/citation_signature","submit_replication":"https://pith.science/pith/6PP77UPTCUBOQEJEP6WLXNAZMW/action/replication_record"}},"created_at":"2026-05-18T00:04:35.358857+00:00","updated_at":"2026-05-18T00:04:35.358857+00:00"}