{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:R6UNCJIAME4F7K3DPCRE73LGLX","short_pith_number":"pith:R6UNCJIA","schema_version":"1.0","canonical_sha256":"8fa8d1250061385fab6378a24fed665df8fb354173e0b97f8369226aa0542f43","source":{"kind":"arxiv","id":"1511.09159","version":1},"attestation_state":"computed","paper":{"title":"Proximal gradient method for huberized support vector machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"stat.ML","authors_text":"Amit Chakraborty, Ioannis Akrotirianakis, Yangyang Xu","submitted_at":"2015-11-30T05:02:02Z","abstract_excerpt":"The Support Vector Machine (SVM) has been used in a wide variety of classification problems. The original SVM uses the hinge loss function, which is non-differentiable and makes the problem difficult to solve in particular for regularized SVMs, such as with $\\ell_1$-regularization. This paper considers the Huberized SVM (HSVM), which uses a differentiable approximation of the hinge loss function. We first explore the use of the Proximal Gradient (PG) method to solving binary-class HSVM (B-HSVM) and then generalize it to multi-class HSVM (M-HSVM). Under strong convexity assumptions, we show tha"},"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":"1511.09159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-30T05:02:02Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"d1de7117d1f6aad73bab7030aed5837091455e8956f47bdf41b713614df53058","abstract_canon_sha256":"26936a4615090d77fb6b1cb91e470b15bd2937dd5d8da3d267071a8212712616"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:40.926069Z","signature_b64":"EMKu4ZVbKzo7dBtXoLxwOvCharzpvA34hEeizs09nWH86p/2kF4O6GigwNEHwdZk9bA3aJqfsmCIODcuEELgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fa8d1250061385fab6378a24fed665df8fb354173e0b97f8369226aa0542f43","last_reissued_at":"2026-05-18T01:25:40.925520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:40.925520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximal gradient method for huberized support vector machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"stat.ML","authors_text":"Amit Chakraborty, Ioannis Akrotirianakis, Yangyang Xu","submitted_at":"2015-11-30T05:02:02Z","abstract_excerpt":"The Support Vector Machine (SVM) has been used in a wide variety of classification problems. The original SVM uses the hinge loss function, which is non-differentiable and makes the problem difficult to solve in particular for regularized SVMs, such as with $\\ell_1$-regularization. This paper considers the Huberized SVM (HSVM), which uses a differentiable approximation of the hinge loss function. We first explore the use of the Proximal Gradient (PG) method to solving binary-class HSVM (B-HSVM) and then generalize it to multi-class HSVM (M-HSVM). Under strong convexity assumptions, we show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09159","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":"1511.09159","created_at":"2026-05-18T01:25:40.925609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.09159v1","created_at":"2026-05-18T01:25:40.925609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09159","created_at":"2026-05-18T01:25:40.925609+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6UNCJIAME4F","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6UNCJIAME4F7K3D","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6UNCJIA","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/R6UNCJIAME4F7K3DPCRE73LGLX","json":"https://pith.science/pith/R6UNCJIAME4F7K3DPCRE73LGLX.json","graph_json":"https://pith.science/api/pith-number/R6UNCJIAME4F7K3DPCRE73LGLX/graph.json","events_json":"https://pith.science/api/pith-number/R6UNCJIAME4F7K3DPCRE73LGLX/events.json","paper":"https://pith.science/paper/R6UNCJIA"},"agent_actions":{"view_html":"https://pith.science/pith/R6UNCJIAME4F7K3DPCRE73LGLX","download_json":"https://pith.science/pith/R6UNCJIAME4F7K3DPCRE73LGLX.json","view_paper":"https://pith.science/paper/R6UNCJIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.09159&json=true","fetch_graph":"https://pith.science/api/pith-number/R6UNCJIAME4F7K3DPCRE73LGLX/graph.json","fetch_events":"https://pith.science/api/pith-number/R6UNCJIAME4F7K3DPCRE73LGLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6UNCJIAME4F7K3DPCRE73LGLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6UNCJIAME4F7K3DPCRE73LGLX/action/storage_attestation","attest_author":"https://pith.science/pith/R6UNCJIAME4F7K3DPCRE73LGLX/action/author_attestation","sign_citation":"https://pith.science/pith/R6UNCJIAME4F7K3DPCRE73LGLX/action/citation_signature","submit_replication":"https://pith.science/pith/R6UNCJIAME4F7K3DPCRE73LGLX/action/replication_record"}},"created_at":"2026-05-18T01:25:40.925609+00:00","updated_at":"2026-05-18T01:25:40.925609+00:00"}