{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XFGYDXLABNPOMCJLDX4E3MCSJL","short_pith_number":"pith:XFGYDXLA","schema_version":"1.0","canonical_sha256":"b94d81dd600b5ee6092b1df84db0524aed1ccd8eaa6fdaa35ed79ce6dc428ee8","source":{"kind":"arxiv","id":"1205.4481","version":4},"attestation_state":"computed","paper":{"title":"Stochastic Smoothing for Nonsmooth Minimizations: Accelerating SGD by Exploiting Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Gray, Hua Ouyang","submitted_at":"2012-05-21T03:29:17Z","abstract_excerpt":"In this work we consider the stochastic minimization of nonsmooth convex loss functions, a central problem in machine learning. We propose a novel algorithm called Accelerated Nonsmooth Stochastic Gradient Descent (ANSGD), which exploits the structure of common nonsmooth loss functions to achieve optimal convergence rates for a class of problems including SVMs. It is the first stochastic algorithm that can achieve the optimal O(1/t) rate for minimizing nonsmooth loss functions (with strong convexity). The fast rates are confirmed by empirical comparisons, in which ANSGD significantly outperfor"},"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":"1205.4481","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-21T03:29:17Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"25292a928d169bc48b22372f8a6e54f91d9323bf3966a1e8b97215056b991b34","abstract_canon_sha256":"1fb62920a8b34e9fdcbc16d0b3a4aafc88727b71d16471fd37a3211eced26813"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:24.039155Z","signature_b64":"D5U0V7jMulPBuKa79Ii66I0LFMtdSbXvvFZWyZjfdzPcjuJLu0hpCrv7CqQN4v6B30Y2voFOpw44V4GUbkyiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b94d81dd600b5ee6092b1df84db0524aed1ccd8eaa6fdaa35ed79ce6dc428ee8","last_reissued_at":"2026-05-18T03:44:24.038509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:24.038509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Smoothing for Nonsmooth Minimizations: Accelerating SGD by Exploiting Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Gray, Hua Ouyang","submitted_at":"2012-05-21T03:29:17Z","abstract_excerpt":"In this work we consider the stochastic minimization of nonsmooth convex loss functions, a central problem in machine learning. We propose a novel algorithm called Accelerated Nonsmooth Stochastic Gradient Descent (ANSGD), which exploits the structure of common nonsmooth loss functions to achieve optimal convergence rates for a class of problems including SVMs. It is the first stochastic algorithm that can achieve the optimal O(1/t) rate for minimizing nonsmooth loss functions (with strong convexity). The fast rates are confirmed by empirical comparisons, in which ANSGD significantly outperfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4481","kind":"arxiv","version":4},"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":"1205.4481","created_at":"2026-05-18T03:44:24.038596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4481v4","created_at":"2026-05-18T03:44:24.038596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4481","created_at":"2026-05-18T03:44:24.038596+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFGYDXLABNPO","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFGYDXLABNPOMCJL","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFGYDXLA","created_at":"2026-05-18T12:27:27.928770+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/XFGYDXLABNPOMCJLDX4E3MCSJL","json":"https://pith.science/pith/XFGYDXLABNPOMCJLDX4E3MCSJL.json","graph_json":"https://pith.science/api/pith-number/XFGYDXLABNPOMCJLDX4E3MCSJL/graph.json","events_json":"https://pith.science/api/pith-number/XFGYDXLABNPOMCJLDX4E3MCSJL/events.json","paper":"https://pith.science/paper/XFGYDXLA"},"agent_actions":{"view_html":"https://pith.science/pith/XFGYDXLABNPOMCJLDX4E3MCSJL","download_json":"https://pith.science/pith/XFGYDXLABNPOMCJLDX4E3MCSJL.json","view_paper":"https://pith.science/paper/XFGYDXLA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4481&json=true","fetch_graph":"https://pith.science/api/pith-number/XFGYDXLABNPOMCJLDX4E3MCSJL/graph.json","fetch_events":"https://pith.science/api/pith-number/XFGYDXLABNPOMCJLDX4E3MCSJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFGYDXLABNPOMCJLDX4E3MCSJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFGYDXLABNPOMCJLDX4E3MCSJL/action/storage_attestation","attest_author":"https://pith.science/pith/XFGYDXLABNPOMCJLDX4E3MCSJL/action/author_attestation","sign_citation":"https://pith.science/pith/XFGYDXLABNPOMCJLDX4E3MCSJL/action/citation_signature","submit_replication":"https://pith.science/pith/XFGYDXLABNPOMCJLDX4E3MCSJL/action/replication_record"}},"created_at":"2026-05-18T03:44:24.038596+00:00","updated_at":"2026-05-18T03:44:24.038596+00:00"}