{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NNRRANJ3YJU3LYAB3QHSBKB232","short_pith_number":"pith:NNRRANJ3","schema_version":"1.0","canonical_sha256":"6b6310353bc269b5e001dc0f20a83adeb1b0dae63ffac14121304d7561e76d5a","source":{"kind":"arxiv","id":"1805.05189","version":1},"attestation_state":"computed","paper":{"title":"Randomized Smoothing SVRG for Large-scale Nonsmooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Wenjie Huang","submitted_at":"2018-05-11T04:05:34Z","abstract_excerpt":"In this paper, we consider the problem of minimizing the average of a large number of nonsmooth and convex functions. Such problems often arise in typical machine learning problems as empirical risk minimization, but are computationally very challenging. We develop and analyze a new algorithm that achieves robust linear convergence rate, and both its time complexity and gradient complexity are superior than state-of-art nonsmooth algorithms and subgradient-based schemes. Besides, our algorithm works without any extra error bound conditions on the objective function as well as the common strong"},"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":"1805.05189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-11T04:05:34Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"0546c858ef332ca1802ce92048bb481e2d73a1965995cef1a3c8e2f22925de81","abstract_canon_sha256":"e20e39b3de4f88f01c9c5b355a71fceb76fbb06e48e9b510ecc0e7f2d4b1e0d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:41.507989Z","signature_b64":"6dx9/e32QPhC6UpbVxfVw74JZjjNR/zcmxOS7QtCHV4MoObM1vAhJi3Ijw/sXku5nW2/2F6tJmj9IXk1w2D5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b6310353bc269b5e001dc0f20a83adeb1b0dae63ffac14121304d7561e76d5a","last_reissued_at":"2026-05-18T00:15:41.507359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:41.507359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Smoothing SVRG for Large-scale Nonsmooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Wenjie Huang","submitted_at":"2018-05-11T04:05:34Z","abstract_excerpt":"In this paper, we consider the problem of minimizing the average of a large number of nonsmooth and convex functions. Such problems often arise in typical machine learning problems as empirical risk minimization, but are computationally very challenging. We develop and analyze a new algorithm that achieves robust linear convergence rate, and both its time complexity and gradient complexity are superior than state-of-art nonsmooth algorithms and subgradient-based schemes. Besides, our algorithm works without any extra error bound conditions on the objective function as well as the common strong"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05189","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":"1805.05189","created_at":"2026-05-18T00:15:41.507452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05189v1","created_at":"2026-05-18T00:15:41.507452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05189","created_at":"2026-05-18T00:15:41.507452+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNRRANJ3YJU3","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNRRANJ3YJU3LYAB","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNRRANJ3","created_at":"2026-05-18T12:32:40.477152+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/NNRRANJ3YJU3LYAB3QHSBKB232","json":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232.json","graph_json":"https://pith.science/api/pith-number/NNRRANJ3YJU3LYAB3QHSBKB232/graph.json","events_json":"https://pith.science/api/pith-number/NNRRANJ3YJU3LYAB3QHSBKB232/events.json","paper":"https://pith.science/paper/NNRRANJ3"},"agent_actions":{"view_html":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232","download_json":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232.json","view_paper":"https://pith.science/paper/NNRRANJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05189&json=true","fetch_graph":"https://pith.science/api/pith-number/NNRRANJ3YJU3LYAB3QHSBKB232/graph.json","fetch_events":"https://pith.science/api/pith-number/NNRRANJ3YJU3LYAB3QHSBKB232/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232/action/storage_attestation","attest_author":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232/action/author_attestation","sign_citation":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232/action/citation_signature","submit_replication":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232/action/replication_record"}},"created_at":"2026-05-18T00:15:41.507452+00:00","updated_at":"2026-05-18T00:15:41.507452+00:00"}