{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NAY73KC4SR5WUCXUAOYRWVSAJA","short_pith_number":"pith:NAY73KC4","schema_version":"1.0","canonical_sha256":"6831fda85c947b6a0af403b11b564048006022ac83917be5074384d80d8bd6c0","source":{"kind":"arxiv","id":"1504.01697","version":1},"attestation_state":"computed","paper":{"title":"Tensor machines for learning target-specific polynomial features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Gittens, Jiyan Yang","submitted_at":"2015-04-07T18:21:37Z","abstract_excerpt":"Recent years have demonstrated that using random feature maps can significantly decrease the training and testing times of kernel-based algorithms without significantly lowering their accuracy. Regrettably, because random features are target-agnostic, typically thousands of such features are necessary to achieve acceptable accuracies. In this work, we consider the problem of learning a small number of explicit polynomial features. Our approach, named Tensor Machines, finds a parsimonious set of features by optimizing over the hypothesis class introduced by Kar and Karnick for random feature ma"},"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":"1504.01697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-07T18:21:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1bd985fc6f49103b0db9053cbf9801c3df29d1c95f4538aeedb47a5bdd244f49","abstract_canon_sha256":"22a40673e92bd2a4900111d0436e03e5c6f677fbe699b8dc1ab4f79020c9025d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:26.407343Z","signature_b64":"W4D+rzen2MWzGc6jd3bJPFu5UGmA6/HS9uWzdVWpuPnXOMiJPUbsW8NQXXQ981DQ2HK4fFx5hqUaORpBT6cIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6831fda85c947b6a0af403b11b564048006022ac83917be5074384d80d8bd6c0","last_reissued_at":"2026-05-18T02:19:26.406061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:26.406061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor machines for learning target-specific polynomial features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Gittens, Jiyan Yang","submitted_at":"2015-04-07T18:21:37Z","abstract_excerpt":"Recent years have demonstrated that using random feature maps can significantly decrease the training and testing times of kernel-based algorithms without significantly lowering their accuracy. Regrettably, because random features are target-agnostic, typically thousands of such features are necessary to achieve acceptable accuracies. In this work, we consider the problem of learning a small number of explicit polynomial features. Our approach, named Tensor Machines, finds a parsimonious set of features by optimizing over the hypothesis class introduced by Kar and Karnick for random feature ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01697","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":"1504.01697","created_at":"2026-05-18T02:19:26.406620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01697v1","created_at":"2026-05-18T02:19:26.406620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01697","created_at":"2026-05-18T02:19:26.406620+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAY73KC4SR5W","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAY73KC4SR5WUCXU","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAY73KC4","created_at":"2026-05-18T12:29:32.376354+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/NAY73KC4SR5WUCXUAOYRWVSAJA","json":"https://pith.science/pith/NAY73KC4SR5WUCXUAOYRWVSAJA.json","graph_json":"https://pith.science/api/pith-number/NAY73KC4SR5WUCXUAOYRWVSAJA/graph.json","events_json":"https://pith.science/api/pith-number/NAY73KC4SR5WUCXUAOYRWVSAJA/events.json","paper":"https://pith.science/paper/NAY73KC4"},"agent_actions":{"view_html":"https://pith.science/pith/NAY73KC4SR5WUCXUAOYRWVSAJA","download_json":"https://pith.science/pith/NAY73KC4SR5WUCXUAOYRWVSAJA.json","view_paper":"https://pith.science/paper/NAY73KC4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01697&json=true","fetch_graph":"https://pith.science/api/pith-number/NAY73KC4SR5WUCXUAOYRWVSAJA/graph.json","fetch_events":"https://pith.science/api/pith-number/NAY73KC4SR5WUCXUAOYRWVSAJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAY73KC4SR5WUCXUAOYRWVSAJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAY73KC4SR5WUCXUAOYRWVSAJA/action/storage_attestation","attest_author":"https://pith.science/pith/NAY73KC4SR5WUCXUAOYRWVSAJA/action/author_attestation","sign_citation":"https://pith.science/pith/NAY73KC4SR5WUCXUAOYRWVSAJA/action/citation_signature","submit_replication":"https://pith.science/pith/NAY73KC4SR5WUCXUAOYRWVSAJA/action/replication_record"}},"created_at":"2026-05-18T02:19:26.406620+00:00","updated_at":"2026-05-18T02:19:26.406620+00:00"}