{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:B2P72FDSRVC4EKGQDNIEAKURBE","short_pith_number":"pith:B2P72FDS","schema_version":"1.0","canonical_sha256":"0e9ffd14728d45c228d01b50402a9109040a84440635a5bf70423905f52577f5","source":{"kind":"arxiv","id":"1907.09916","version":1},"attestation_state":"computed","paper":{"title":"A Hardware-Efficient ADMM-Based SVM Training Algorithm for Edge Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Chia-Hsiang Yang, Shuo-An Huang","submitted_at":"2019-07-23T14:40:53Z","abstract_excerpt":"This work demonstrates a hardware-efficient support vector machine (SVM) training algorithm via the alternative direction method of multipliers (ADMM) optimizer. Low-rank approximation is exploited to reduce the dimension of the kernel matrix by employing the Nystr\\\"{o}m method. Verified in four datasets, the proposed ADMM-based training algorithm with rank approximation reduces 32$\\times$ of matrix dimension with only 2% drop in inference accuracy. Compared to the conventional sequential minimal optimization (SMO) algorithm, the ADMM-based training algorithm is able to achieve a 9.8$\\times$10"},"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":"1907.09916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-23T14:40:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3cf11fde62e6439964d585d23c166b8ac61baab769ed87325dc9106b7ef9a39b","abstract_canon_sha256":"f64a7d95add96bd22a6b50706c220d451b36c938280de4b32599ddf0927cf49c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:49.712235Z","signature_b64":"u7aLDZ+xKjMTiE6D5GxJPFlLBrn78R6cIrPOyLiY/edspAhzheT3p2hRGxhUSLMiZCWFzWwtXZ447XEx6erSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e9ffd14728d45c228d01b50402a9109040a84440635a5bf70423905f52577f5","last_reissued_at":"2026-05-17T23:39:49.711541Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:49.711541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hardware-Efficient ADMM-Based SVM Training Algorithm for Edge Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Chia-Hsiang Yang, Shuo-An Huang","submitted_at":"2019-07-23T14:40:53Z","abstract_excerpt":"This work demonstrates a hardware-efficient support vector machine (SVM) training algorithm via the alternative direction method of multipliers (ADMM) optimizer. Low-rank approximation is exploited to reduce the dimension of the kernel matrix by employing the Nystr\\\"{o}m method. Verified in four datasets, the proposed ADMM-based training algorithm with rank approximation reduces 32$\\times$ of matrix dimension with only 2% drop in inference accuracy. Compared to the conventional sequential minimal optimization (SMO) algorithm, the ADMM-based training algorithm is able to achieve a 9.8$\\times$10"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09916","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":"1907.09916","created_at":"2026-05-17T23:39:49.711645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09916v1","created_at":"2026-05-17T23:39:49.711645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09916","created_at":"2026-05-17T23:39:49.711645+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2P72FDSRVC4","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2P72FDSRVC4EKGQ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2P72FDS","created_at":"2026-05-18T12:33:12.712433+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/B2P72FDSRVC4EKGQDNIEAKURBE","json":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE.json","graph_json":"https://pith.science/api/pith-number/B2P72FDSRVC4EKGQDNIEAKURBE/graph.json","events_json":"https://pith.science/api/pith-number/B2P72FDSRVC4EKGQDNIEAKURBE/events.json","paper":"https://pith.science/paper/B2P72FDS"},"agent_actions":{"view_html":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE","download_json":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE.json","view_paper":"https://pith.science/paper/B2P72FDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09916&json=true","fetch_graph":"https://pith.science/api/pith-number/B2P72FDSRVC4EKGQDNIEAKURBE/graph.json","fetch_events":"https://pith.science/api/pith-number/B2P72FDSRVC4EKGQDNIEAKURBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE/action/storage_attestation","attest_author":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE/action/author_attestation","sign_citation":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE/action/citation_signature","submit_replication":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE/action/replication_record"}},"created_at":"2026-05-17T23:39:49.711645+00:00","updated_at":"2026-05-17T23:39:49.711645+00:00"}