{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HUEREJZ3ZWAHPUCUF4QZTAL2VZ","short_pith_number":"pith:HUEREJZ3","schema_version":"1.0","canonical_sha256":"3d0912273bcd8077d0542f2199817aae71c811477dedd71af0361dafdc376c54","source":{"kind":"arxiv","id":"1702.07842","version":2},"attestation_state":"computed","paper":{"title":"Accelerated Stochastic Greedy Coordinate Descent by Soft Thresholding Projection onto Simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chaobing Song, Shaobo Cui, Shu-Tao Xia, Yong Jiang","submitted_at":"2017-02-25T07:06:09Z","abstract_excerpt":"In this paper we study the well-known greedy coordinate descent (GCD) algorithm to solve $\\ell_1$-regularized problems and improve GCD by the two popular strategies: Nesterov's acceleration and stochastic optimization. Firstly, we propose a new rule for greedy selection based on an $\\ell_1$-norm square approximation which is nontrivial to solve but convex, then an efficient algorithm called \"SOft ThreshOlding PrOjection (SOTOPO)\" is proposed to exactly solve the $\\ell_1$-regularized $\\ell_1$-norm square approximation problem, which is induced by the new rule. Based on the new rule and the SOTO"},"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":"1702.07842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-25T07:06:09Z","cross_cats_sorted":[],"title_canon_sha256":"bace09ad1aac5f20f004954531968422474b15d2e46e0050b576ff2dfbf02d94","abstract_canon_sha256":"2e38106207e45bb76ce2a0a80d672df1317740bd8dd9447f1661849916f6c3c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:47.749826Z","signature_b64":"faqRrUuZ0KgOHNp0EY03bq6fKNwwiY1UQH1oJLG+kgTewEWSuwFp83LPO0QaQgB3h1PvzE5xd3xC4CFjGD2EDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d0912273bcd8077d0542f2199817aae71c811477dedd71af0361dafdc376c54","last_reissued_at":"2026-05-18T00:41:47.749253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:47.749253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Stochastic Greedy Coordinate Descent by Soft Thresholding Projection onto Simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chaobing Song, Shaobo Cui, Shu-Tao Xia, Yong Jiang","submitted_at":"2017-02-25T07:06:09Z","abstract_excerpt":"In this paper we study the well-known greedy coordinate descent (GCD) algorithm to solve $\\ell_1$-regularized problems and improve GCD by the two popular strategies: Nesterov's acceleration and stochastic optimization. Firstly, we propose a new rule for greedy selection based on an $\\ell_1$-norm square approximation which is nontrivial to solve but convex, then an efficient algorithm called \"SOft ThreshOlding PrOjection (SOTOPO)\" is proposed to exactly solve the $\\ell_1$-regularized $\\ell_1$-norm square approximation problem, which is induced by the new rule. Based on the new rule and the SOTO"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07842","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":"1702.07842","created_at":"2026-05-18T00:41:47.749358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07842v2","created_at":"2026-05-18T00:41:47.749358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07842","created_at":"2026-05-18T00:41:47.749358+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUEREJZ3ZWAH","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUEREJZ3ZWAHPUCU","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUEREJZ3","created_at":"2026-05-18T12:31:18.294218+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/HUEREJZ3ZWAHPUCUF4QZTAL2VZ","json":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ.json","graph_json":"https://pith.science/api/pith-number/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/graph.json","events_json":"https://pith.science/api/pith-number/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/events.json","paper":"https://pith.science/paper/HUEREJZ3"},"agent_actions":{"view_html":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ","download_json":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ.json","view_paper":"https://pith.science/paper/HUEREJZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07842&json=true","fetch_graph":"https://pith.science/api/pith-number/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/graph.json","fetch_events":"https://pith.science/api/pith-number/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/action/storage_attestation","attest_author":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/action/author_attestation","sign_citation":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/action/citation_signature","submit_replication":"https://pith.science/pith/HUEREJZ3ZWAHPUCUF4QZTAL2VZ/action/replication_record"}},"created_at":"2026-05-18T00:41:47.749358+00:00","updated_at":"2026-05-18T00:41:47.749358+00:00"}