{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RIWZPX5Z3ZVWXDKAIEFUXBAX3D","short_pith_number":"pith:RIWZPX5Z","schema_version":"1.0","canonical_sha256":"8a2d97dfb9de6b6b8d40410b4b8417d8e801392bbd3e1253a3f22f52da506cb3","source":{"kind":"arxiv","id":"1810.03817","version":1},"attestation_state":"computed","paper":{"title":"Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Shahin Shahrampour, Vahid Tarokh","submitted_at":"2018-10-09T05:20:41Z","abstract_excerpt":"Nonlinear kernels can be approximated using finite-dimensional feature maps for efficient risk minimization. Due to the inherent trade-off between the dimension of the (mapped) feature space and the approximation accuracy, the key problem is to identify promising (explicit) features leading to a satisfactory out-of-sample performance. In this work, we tackle this problem by efficiently choosing such features from multiple kernels in a greedy fashion. Our method sequentially selects these explicit features from a set of candidate features using a correlation metric. We establish an out-of-sampl"},"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":"1810.03817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T05:20:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9df1e309cca4180f51953f21f7080bcf983b68cd3719ed7d314c9cbb47b5fa01","abstract_canon_sha256":"3620663e4739cc62d57ded4facc6d11310078a3f6ff513a53f12c694eed77460"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:44.455516Z","signature_b64":"wJOOXTgMeyG7JRihesemm/HEpx0Ca8NwECgfZonTRukId0I84S2Soi88pF9s6Ce4922B348pYeClvDMO0DxwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a2d97dfb9de6b6b8d40410b4b8417d8e801392bbd3e1253a3f22f52da506cb3","last_reissued_at":"2026-05-18T00:03:44.455002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:44.455002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Shahin Shahrampour, Vahid Tarokh","submitted_at":"2018-10-09T05:20:41Z","abstract_excerpt":"Nonlinear kernels can be approximated using finite-dimensional feature maps for efficient risk minimization. Due to the inherent trade-off between the dimension of the (mapped) feature space and the approximation accuracy, the key problem is to identify promising (explicit) features leading to a satisfactory out-of-sample performance. In this work, we tackle this problem by efficiently choosing such features from multiple kernels in a greedy fashion. Our method sequentially selects these explicit features from a set of candidate features using a correlation metric. We establish an out-of-sampl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03817","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":"1810.03817","created_at":"2026-05-18T00:03:44.455088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03817v1","created_at":"2026-05-18T00:03:44.455088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03817","created_at":"2026-05-18T00:03:44.455088+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIWZPX5Z3ZVW","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIWZPX5Z3ZVWXDKA","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIWZPX5Z","created_at":"2026-05-18T12:32:50.500415+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/RIWZPX5Z3ZVWXDKAIEFUXBAX3D","json":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D.json","graph_json":"https://pith.science/api/pith-number/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/graph.json","events_json":"https://pith.science/api/pith-number/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/events.json","paper":"https://pith.science/paper/RIWZPX5Z"},"agent_actions":{"view_html":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D","download_json":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D.json","view_paper":"https://pith.science/paper/RIWZPX5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03817&json=true","fetch_graph":"https://pith.science/api/pith-number/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/graph.json","fetch_events":"https://pith.science/api/pith-number/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/action/storage_attestation","attest_author":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/action/author_attestation","sign_citation":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/action/citation_signature","submit_replication":"https://pith.science/pith/RIWZPX5Z3ZVWXDKAIEFUXBAX3D/action/replication_record"}},"created_at":"2026-05-18T00:03:44.455088+00:00","updated_at":"2026-05-18T00:03:44.455088+00:00"}