{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6YDD2TG7WORLD6KKG6RAHVTYRA","short_pith_number":"pith:6YDD2TG7","schema_version":"1.0","canonical_sha256":"f6063d4cdfb3a2b1f94a37a203d67888034716dd656205de595ae405803554e2","source":{"kind":"arxiv","id":"1109.4603","version":1},"attestation_state":"computed","paper":{"title":"Explicit Approximations of the Gaussian Kernel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrew Cotter, Joseph Keshet, Nathan Srebro","submitted_at":"2011-09-21T18:11:05Z","abstract_excerpt":"We investigate training and using Gaussian kernel SVMs by approximating the kernel with an explicit finite- dimensional polynomial feature representation based on the Taylor expansion of the exponential. Although not as efficient as the recently-proposed random Fourier features [Rahimi and Recht, 2007] in terms of the number of features, we show how this polynomial representation can provide a better approximation in terms of the computational cost involved. This makes our \"Taylor features\" especially attractive for use on very large data sets, in conjunction with online or stochastic training"},"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":"1109.4603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-21T18:11:05Z","cross_cats_sorted":[],"title_canon_sha256":"0be3476fe4530d2a25cac5937c66538f82213b69bdebc3266606686929d18446","abstract_canon_sha256":"234d66c7e3bad172b6bbb7eb8001a2c3d2209160cdcf99d884c2d8c23bf9b69a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:34.377686Z","signature_b64":"yUidpPEZscy23eb/550f6fwHShpY2nE7NgDmECPv1xt64HCEJjyEmbHRd5L4sOal+q9i5Hm/yPyI5qhkEryQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6063d4cdfb3a2b1f94a37a203d67888034716dd656205de595ae405803554e2","last_reissued_at":"2026-05-18T04:12:34.376947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:34.376947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit Approximations of the Gaussian Kernel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrew Cotter, Joseph Keshet, Nathan Srebro","submitted_at":"2011-09-21T18:11:05Z","abstract_excerpt":"We investigate training and using Gaussian kernel SVMs by approximating the kernel with an explicit finite- dimensional polynomial feature representation based on the Taylor expansion of the exponential. Although not as efficient as the recently-proposed random Fourier features [Rahimi and Recht, 2007] in terms of the number of features, we show how this polynomial representation can provide a better approximation in terms of the computational cost involved. This makes our \"Taylor features\" especially attractive for use on very large data sets, in conjunction with online or stochastic training"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4603","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":"1109.4603","created_at":"2026-05-18T04:12:34.377093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4603v1","created_at":"2026-05-18T04:12:34.377093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4603","created_at":"2026-05-18T04:12:34.377093+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YDD2TG7WORL","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YDD2TG7WORLD6KK","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YDD2TG7","created_at":"2026-05-18T12:26:22.705136+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/6YDD2TG7WORLD6KKG6RAHVTYRA","json":"https://pith.science/pith/6YDD2TG7WORLD6KKG6RAHVTYRA.json","graph_json":"https://pith.science/api/pith-number/6YDD2TG7WORLD6KKG6RAHVTYRA/graph.json","events_json":"https://pith.science/api/pith-number/6YDD2TG7WORLD6KKG6RAHVTYRA/events.json","paper":"https://pith.science/paper/6YDD2TG7"},"agent_actions":{"view_html":"https://pith.science/pith/6YDD2TG7WORLD6KKG6RAHVTYRA","download_json":"https://pith.science/pith/6YDD2TG7WORLD6KKG6RAHVTYRA.json","view_paper":"https://pith.science/paper/6YDD2TG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4603&json=true","fetch_graph":"https://pith.science/api/pith-number/6YDD2TG7WORLD6KKG6RAHVTYRA/graph.json","fetch_events":"https://pith.science/api/pith-number/6YDD2TG7WORLD6KKG6RAHVTYRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YDD2TG7WORLD6KKG6RAHVTYRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YDD2TG7WORLD6KKG6RAHVTYRA/action/storage_attestation","attest_author":"https://pith.science/pith/6YDD2TG7WORLD6KKG6RAHVTYRA/action/author_attestation","sign_citation":"https://pith.science/pith/6YDD2TG7WORLD6KKG6RAHVTYRA/action/citation_signature","submit_replication":"https://pith.science/pith/6YDD2TG7WORLD6KKG6RAHVTYRA/action/replication_record"}},"created_at":"2026-05-18T04:12:34.377093+00:00","updated_at":"2026-05-18T04:12:34.377093+00:00"}