{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LGTFA3HVI72OSM4NFYFIOWCI3F","short_pith_number":"pith:LGTFA3HV","schema_version":"1.0","canonical_sha256":"59a6506cf547f4e9338d2e0a875848d9790996f90b70c69ff63fa781dcc7f3d7","source":{"kind":"arxiv","id":"1005.2146","version":1},"attestation_state":"computed","paper":{"title":"On the Finite Time Convergence of Cyclic Coordinate Descent Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.LG","authors_text":"Ambuj Tewari, Ankan Saha","submitted_at":"2010-05-12T16:25:46Z","abstract_excerpt":"Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stability, as well as its competitive performance on $\\ell_1$ regularized smooth optimization problems.  Surprisingly, very little is known about its finite time convergence behavior on these problems. Most existing results either just prove convergence or provide asymptotic rates. We fill this gap in the literature by proving $O(1/k)$ convergence rates (where $k$ is the iteration counter) for two variants of cyclic coord"},"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":"1005.2146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-05-12T16:25:46Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ff4ed3d9fe50db5d2c2ab6de973a3f1071216d3d6f78dae72143cc22b9c7fab5","abstract_canon_sha256":"18924ab33bd40920dee9b528111bcbde5a99ce1714877112937be0fa01b95aef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:07.873665Z","signature_b64":"IL3WL8d+3lXqF0iTMXDPgnw298QQNn0xRgUSJ87hO/sTIEbBxO79HgHiSHv9PQBU+zgOIcW9AzPIkSU245o+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59a6506cf547f4e9338d2e0a875848d9790996f90b70c69ff63fa781dcc7f3d7","last_reissued_at":"2026-05-18T02:24:07.872973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:07.872973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Finite Time Convergence of Cyclic Coordinate Descent Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.LG","authors_text":"Ambuj Tewari, Ankan Saha","submitted_at":"2010-05-12T16:25:46Z","abstract_excerpt":"Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stability, as well as its competitive performance on $\\ell_1$ regularized smooth optimization problems.  Surprisingly, very little is known about its finite time convergence behavior on these problems. Most existing results either just prove convergence or provide asymptotic rates. We fill this gap in the literature by proving $O(1/k)$ convergence rates (where $k$ is the iteration counter) for two variants of cyclic coord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2146","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":"1005.2146","created_at":"2026-05-18T02:24:07.873058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.2146v1","created_at":"2026-05-18T02:24:07.873058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2146","created_at":"2026-05-18T02:24:07.873058+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGTFA3HVI72O","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGTFA3HVI72OSM4N","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGTFA3HV","created_at":"2026-05-18T12:26:10.704358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14373","citing_title":"Turning Stale Gradients into Stable Gradients: Coherent Coordinate Descent with Implicit Landscape Smoothing for Lightweight Zeroth-Order Optimization","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LGTFA3HVI72OSM4NFYFIOWCI3F","json":"https://pith.science/pith/LGTFA3HVI72OSM4NFYFIOWCI3F.json","graph_json":"https://pith.science/api/pith-number/LGTFA3HVI72OSM4NFYFIOWCI3F/graph.json","events_json":"https://pith.science/api/pith-number/LGTFA3HVI72OSM4NFYFIOWCI3F/events.json","paper":"https://pith.science/paper/LGTFA3HV"},"agent_actions":{"view_html":"https://pith.science/pith/LGTFA3HVI72OSM4NFYFIOWCI3F","download_json":"https://pith.science/pith/LGTFA3HVI72OSM4NFYFIOWCI3F.json","view_paper":"https://pith.science/paper/LGTFA3HV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.2146&json=true","fetch_graph":"https://pith.science/api/pith-number/LGTFA3HVI72OSM4NFYFIOWCI3F/graph.json","fetch_events":"https://pith.science/api/pith-number/LGTFA3HVI72OSM4NFYFIOWCI3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGTFA3HVI72OSM4NFYFIOWCI3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGTFA3HVI72OSM4NFYFIOWCI3F/action/storage_attestation","attest_author":"https://pith.science/pith/LGTFA3HVI72OSM4NFYFIOWCI3F/action/author_attestation","sign_citation":"https://pith.science/pith/LGTFA3HVI72OSM4NFYFIOWCI3F/action/citation_signature","submit_replication":"https://pith.science/pith/LGTFA3HVI72OSM4NFYFIOWCI3F/action/replication_record"}},"created_at":"2026-05-18T02:24:07.873058+00:00","updated_at":"2026-05-18T02:24:07.873058+00:00"}