{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WJVH6DZQUKLABESJE7QCOMEYB6","short_pith_number":"pith:WJVH6DZQ","schema_version":"1.0","canonical_sha256":"b26a7f0f30a29600924927e02730980f95015ce534c77321a6012cc7f2d9140c","source":{"kind":"arxiv","id":"1608.02010","version":1},"attestation_state":"computed","paper":{"title":"Communication-Efficient Parallel Block Minimization for Kernel Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Inderjit S. Dhillon, Si Si","submitted_at":"2016-08-05T20:15:51Z","abstract_excerpt":"Kernel machines often yield superior predictive performance on various tasks; however, they suffer from severe computational challenges. In this paper, we show how to overcome the important challenge of speeding up kernel machines. In particular, we develop a parallel block minimization framework for solving kernel machines, including kernel SVM and kernel logistic regression. Our framework proceeds by dividing the problem into smaller subproblems by forming a block-diagonal approximation of the Hessian matrix. The subproblems are then solved approximately in parallel. After that, a communicat"},"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":"1608.02010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-05T20:15:51Z","cross_cats_sorted":[],"title_canon_sha256":"a24c0f75f8da0076651714e1a3c83b906d4fb1b1b1c29ed49a04e06e75f845be","abstract_canon_sha256":"37a04d325a8d72292426b63a9f1bce7e7ea2ff5e17daa5055abf8e07c1e653fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:41.156930Z","signature_b64":"krM7sBUTSKeqCh07grvfRxBbJwEhpHBEefzW/waNQrPoTPaoREHn0PvDYo333uNSyuXHFui1ZWro+pTnOAMjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b26a7f0f30a29600924927e02730980f95015ce534c77321a6012cc7f2d9140c","last_reissued_at":"2026-05-18T01:09:41.156554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:41.156554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-Efficient Parallel Block Minimization for Kernel Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Inderjit S. Dhillon, Si Si","submitted_at":"2016-08-05T20:15:51Z","abstract_excerpt":"Kernel machines often yield superior predictive performance on various tasks; however, they suffer from severe computational challenges. In this paper, we show how to overcome the important challenge of speeding up kernel machines. In particular, we develop a parallel block minimization framework for solving kernel machines, including kernel SVM and kernel logistic regression. Our framework proceeds by dividing the problem into smaller subproblems by forming a block-diagonal approximation of the Hessian matrix. The subproblems are then solved approximately in parallel. After that, a communicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02010","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":"1608.02010","created_at":"2026-05-18T01:09:41.156608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.02010v1","created_at":"2026-05-18T01:09:41.156608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02010","created_at":"2026-05-18T01:09:41.156608+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJVH6DZQUKLA","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJVH6DZQUKLABESJ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJVH6DZQ","created_at":"2026-05-18T12:30:48.956258+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/WJVH6DZQUKLABESJE7QCOMEYB6","json":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6.json","graph_json":"https://pith.science/api/pith-number/WJVH6DZQUKLABESJE7QCOMEYB6/graph.json","events_json":"https://pith.science/api/pith-number/WJVH6DZQUKLABESJE7QCOMEYB6/events.json","paper":"https://pith.science/paper/WJVH6DZQ"},"agent_actions":{"view_html":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6","download_json":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6.json","view_paper":"https://pith.science/paper/WJVH6DZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.02010&json=true","fetch_graph":"https://pith.science/api/pith-number/WJVH6DZQUKLABESJE7QCOMEYB6/graph.json","fetch_events":"https://pith.science/api/pith-number/WJVH6DZQUKLABESJE7QCOMEYB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6/action/storage_attestation","attest_author":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6/action/author_attestation","sign_citation":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6/action/citation_signature","submit_replication":"https://pith.science/pith/WJVH6DZQUKLABESJE7QCOMEYB6/action/replication_record"}},"created_at":"2026-05-18T01:09:41.156608+00:00","updated_at":"2026-05-18T01:09:41.156608+00:00"}