{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RSPOSVGU2SUC3ZLRBRVS5DW566","short_pith_number":"pith:RSPOSVGU","schema_version":"1.0","canonical_sha256":"8c9ee954d4d4a82de5710c6b2e8eddf791d610d85f2d588ae082d982b6b884b6","source":{"kind":"arxiv","id":"1506.02530","version":1},"attestation_state":"computed","paper":{"title":"Linear Convergence of the Randomized Feasible Descent Method Under the Weak Strong Convexity Assumption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chenxin Ma, Martin Tak\\'a\\v{c}, Rachael Tappenden","submitted_at":"2015-06-08T14:54:08Z","abstract_excerpt":"In this paper we generalize the framework of the feasible descent method (FDM) to a randomized (R-FDM) and a coordinate-wise random feasible descent method (RC-FDM) framework. We show that the famous SDCA algorithm for optimizing the SVM dual problem, or the stochastic coordinate descent method for the LASSO problem, fits into the framework of RC-FDM. We prove linear convergence for both R-FDM and RC-FDM under the weak strong convexity assumption. Moreover, we show that the duality gap converges linearly for RC-FDM, which implies that the duality gap also converges linearly for SDCA applied to"},"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":"1506.02530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-08T14:54:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"695c7a571de49a19b007f7457c6d070e73eba229aa86d209859a8d5738106dfa","abstract_canon_sha256":"bdc6b8422c9aadbbf60be67562826111ded4f948b17f952f7c61e4722a7e2021"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:50.828557Z","signature_b64":"VUjCpCrUCI2h0NyQUBe/eGe9xksiEKu2S+dHBV/7++mJ9ko+s6G1sQgvKuGJMIVjDdUCxfoEuy5CdSN63PKHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c9ee954d4d4a82de5710c6b2e8eddf791d610d85f2d588ae082d982b6b884b6","last_reissued_at":"2026-05-18T01:55:50.827853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:50.827853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Convergence of the Randomized Feasible Descent Method Under the Weak Strong Convexity Assumption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chenxin Ma, Martin Tak\\'a\\v{c}, Rachael Tappenden","submitted_at":"2015-06-08T14:54:08Z","abstract_excerpt":"In this paper we generalize the framework of the feasible descent method (FDM) to a randomized (R-FDM) and a coordinate-wise random feasible descent method (RC-FDM) framework. We show that the famous SDCA algorithm for optimizing the SVM dual problem, or the stochastic coordinate descent method for the LASSO problem, fits into the framework of RC-FDM. We prove linear convergence for both R-FDM and RC-FDM under the weak strong convexity assumption. Moreover, we show that the duality gap converges linearly for RC-FDM, which implies that the duality gap also converges linearly for SDCA applied to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02530","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":"1506.02530","created_at":"2026-05-18T01:55:50.827942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02530v1","created_at":"2026-05-18T01:55:50.827942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02530","created_at":"2026-05-18T01:55:50.827942+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSPOSVGU2SUC","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSPOSVGU2SUC3ZLR","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSPOSVGU","created_at":"2026-05-18T12:29:39.896362+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/RSPOSVGU2SUC3ZLRBRVS5DW566","json":"https://pith.science/pith/RSPOSVGU2SUC3ZLRBRVS5DW566.json","graph_json":"https://pith.science/api/pith-number/RSPOSVGU2SUC3ZLRBRVS5DW566/graph.json","events_json":"https://pith.science/api/pith-number/RSPOSVGU2SUC3ZLRBRVS5DW566/events.json","paper":"https://pith.science/paper/RSPOSVGU"},"agent_actions":{"view_html":"https://pith.science/pith/RSPOSVGU2SUC3ZLRBRVS5DW566","download_json":"https://pith.science/pith/RSPOSVGU2SUC3ZLRBRVS5DW566.json","view_paper":"https://pith.science/paper/RSPOSVGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02530&json=true","fetch_graph":"https://pith.science/api/pith-number/RSPOSVGU2SUC3ZLRBRVS5DW566/graph.json","fetch_events":"https://pith.science/api/pith-number/RSPOSVGU2SUC3ZLRBRVS5DW566/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSPOSVGU2SUC3ZLRBRVS5DW566/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSPOSVGU2SUC3ZLRBRVS5DW566/action/storage_attestation","attest_author":"https://pith.science/pith/RSPOSVGU2SUC3ZLRBRVS5DW566/action/author_attestation","sign_citation":"https://pith.science/pith/RSPOSVGU2SUC3ZLRBRVS5DW566/action/citation_signature","submit_replication":"https://pith.science/pith/RSPOSVGU2SUC3ZLRBRVS5DW566/action/replication_record"}},"created_at":"2026-05-18T01:55:50.827942+00:00","updated_at":"2026-05-18T01:55:50.827942+00:00"}