{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NC7FBZKVL2TVSOJBDW2FHPMJPH","short_pith_number":"pith:NC7FBZKV","schema_version":"1.0","canonical_sha256":"68be50e5555ea75939211db453bd8979e69b4697d537a4675011029dd1434e4a","source":{"kind":"arxiv","id":"1512.09103","version":3},"attestation_state":"computed","paper":{"title":"Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Peter Richt\\'arik, Yang Yuan, Zeyuan Allen-Zhu, Zheng Qu","submitted_at":"2015-12-30T20:30:07Z","abstract_excerpt":"Accelerated coordinate descent is widely used in optimization due to its cheap per-iteration cost and scalability to large-scale problems. Up to a primal-dual transformation, it is also the same as accelerated stochastic gradient descent that is one of the central methods used in machine learning.\n  In this paper, we improve the best known running time of accelerated coordinate descent by a factor up to $\\sqrt{n}$. Our improvement is based on a clean, novel non-uniform sampling that selects each coordinate with a probability proportional to the square root of its smoothness parameter. Our proo"},"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.09103","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-30T20:30:07Z","cross_cats_sorted":["cs.DS","math.NA","stat.ML"],"title_canon_sha256":"94b1e6530e68dae0e460cf5547214ed0926f9fe59ada51c766ee41aa47d3f94b","abstract_canon_sha256":"b58e174251a5093f2b77d40f9c3594be95ebd1404d3a629275a9ee7c3e00436c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:30.646183Z","signature_b64":"xcI2kWLMPKMy2D5mh9CgQ5is+THYG+z/B0C5RqPWMS7QLU2ccCuTwqH1tpp5dh2ZAm5dC6k+Cht1miGryEaBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68be50e5555ea75939211db453bd8979e69b4697d537a4675011029dd1434e4a","last_reissued_at":"2026-05-18T01:13:30.645603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:30.645603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Peter Richt\\'arik, Yang Yuan, Zeyuan Allen-Zhu, Zheng Qu","submitted_at":"2015-12-30T20:30:07Z","abstract_excerpt":"Accelerated coordinate descent is widely used in optimization due to its cheap per-iteration cost and scalability to large-scale problems. Up to a primal-dual transformation, it is also the same as accelerated stochastic gradient descent that is one of the central methods used in machine learning.\n  In this paper, we improve the best known running time of accelerated coordinate descent by a factor up to $\\sqrt{n}$. Our improvement is based on a clean, novel non-uniform sampling that selects each coordinate with a probability proportional to the square root of its smoothness parameter. Our proo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09103","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":"1512.09103","created_at":"2026-05-18T01:13:30.645693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.09103v3","created_at":"2026-05-18T01:13:30.645693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09103","created_at":"2026-05-18T01:13:30.645693+00:00"},{"alias_kind":"pith_short_12","alias_value":"NC7FBZKVL2TV","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NC7FBZKVL2TVSOJB","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NC7FBZKV","created_at":"2026-05-18T12:29:32.376354+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/NC7FBZKVL2TVSOJBDW2FHPMJPH","json":"https://pith.science/pith/NC7FBZKVL2TVSOJBDW2FHPMJPH.json","graph_json":"https://pith.science/api/pith-number/NC7FBZKVL2TVSOJBDW2FHPMJPH/graph.json","events_json":"https://pith.science/api/pith-number/NC7FBZKVL2TVSOJBDW2FHPMJPH/events.json","paper":"https://pith.science/paper/NC7FBZKV"},"agent_actions":{"view_html":"https://pith.science/pith/NC7FBZKVL2TVSOJBDW2FHPMJPH","download_json":"https://pith.science/pith/NC7FBZKVL2TVSOJBDW2FHPMJPH.json","view_paper":"https://pith.science/paper/NC7FBZKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.09103&json=true","fetch_graph":"https://pith.science/api/pith-number/NC7FBZKVL2TVSOJBDW2FHPMJPH/graph.json","fetch_events":"https://pith.science/api/pith-number/NC7FBZKVL2TVSOJBDW2FHPMJPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NC7FBZKVL2TVSOJBDW2FHPMJPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NC7FBZKVL2TVSOJBDW2FHPMJPH/action/storage_attestation","attest_author":"https://pith.science/pith/NC7FBZKVL2TVSOJBDW2FHPMJPH/action/author_attestation","sign_citation":"https://pith.science/pith/NC7FBZKVL2TVSOJBDW2FHPMJPH/action/citation_signature","submit_replication":"https://pith.science/pith/NC7FBZKVL2TVSOJBDW2FHPMJPH/action/replication_record"}},"created_at":"2026-05-18T01:13:30.645693+00:00","updated_at":"2026-05-18T01:13:30.645693+00:00"}