{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FIA2GQGZR4473K7DCUSSPHY3KH","short_pith_number":"pith:FIA2GQGZ","schema_version":"1.0","canonical_sha256":"2a01a340d98f39fdabe31525279f1b51e1b8bd0872fa1fe629799e86815a1792","source":{"kind":"arxiv","id":"1803.10172","version":1},"attestation_state":"computed","paper":{"title":"Distributed Adaptive Sampling for Kernel Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Lazaric, Daniele Calandriello, Michal Valko","submitted_at":"2018-03-27T16:39:00Z","abstract_excerpt":"Most kernel-based methods, such as kernel or Gaussian process regression, kernel PCA, ICA, or $k$-means clustering, do not scale to large datasets, because constructing and storing the kernel matrix $\\mathbf{K}_n$ requires at least $\\mathcal{O}(n^2)$ time and space for $n$ samples. Recent works show that sampling points with replacement according to their ridge leverage scores (RLS) generates small dictionaries of relevant points with strong spectral approximation guarantees for $\\mathbf{K}_n$. The drawback of RLS-based methods is that computing exact RLS requires constructing and storing the "},"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":"1803.10172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-27T16:39:00Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"b52b759d9fbe70eef2f2365c3f12d690cfaf836fcb3887cdf07e4d1b31024f52","abstract_canon_sha256":"aba9e639435c5980e8554b21dd182592718fa0e3c650d594f2829597c1946d49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:00.188211Z","signature_b64":"ccFpcn67w+LoCsTntwTAXHolCGqCNrAldM+tqjq5fcHLKd+ox68Eb7ZZU0Bt9jefKF2KKTfabOLfEG0rBvYACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a01a340d98f39fdabe31525279f1b51e1b8bd0872fa1fe629799e86815a1792","last_reissued_at":"2026-05-18T00:20:00.187530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:00.187530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Adaptive Sampling for Kernel Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Lazaric, Daniele Calandriello, Michal Valko","submitted_at":"2018-03-27T16:39:00Z","abstract_excerpt":"Most kernel-based methods, such as kernel or Gaussian process regression, kernel PCA, ICA, or $k$-means clustering, do not scale to large datasets, because constructing and storing the kernel matrix $\\mathbf{K}_n$ requires at least $\\mathcal{O}(n^2)$ time and space for $n$ samples. Recent works show that sampling points with replacement according to their ridge leverage scores (RLS) generates small dictionaries of relevant points with strong spectral approximation guarantees for $\\mathbf{K}_n$. The drawback of RLS-based methods is that computing exact RLS requires constructing and storing the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10172","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":"1803.10172","created_at":"2026-05-18T00:20:00.187643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10172v1","created_at":"2026-05-18T00:20:00.187643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10172","created_at":"2026-05-18T00:20:00.187643+00:00"},{"alias_kind":"pith_short_12","alias_value":"FIA2GQGZR447","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FIA2GQGZR4473K7D","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FIA2GQGZ","created_at":"2026-05-18T12:32:22.470017+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/FIA2GQGZR4473K7DCUSSPHY3KH","json":"https://pith.science/pith/FIA2GQGZR4473K7DCUSSPHY3KH.json","graph_json":"https://pith.science/api/pith-number/FIA2GQGZR4473K7DCUSSPHY3KH/graph.json","events_json":"https://pith.science/api/pith-number/FIA2GQGZR4473K7DCUSSPHY3KH/events.json","paper":"https://pith.science/paper/FIA2GQGZ"},"agent_actions":{"view_html":"https://pith.science/pith/FIA2GQGZR4473K7DCUSSPHY3KH","download_json":"https://pith.science/pith/FIA2GQGZR4473K7DCUSSPHY3KH.json","view_paper":"https://pith.science/paper/FIA2GQGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10172&json=true","fetch_graph":"https://pith.science/api/pith-number/FIA2GQGZR4473K7DCUSSPHY3KH/graph.json","fetch_events":"https://pith.science/api/pith-number/FIA2GQGZR4473K7DCUSSPHY3KH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FIA2GQGZR4473K7DCUSSPHY3KH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FIA2GQGZR4473K7DCUSSPHY3KH/action/storage_attestation","attest_author":"https://pith.science/pith/FIA2GQGZR4473K7DCUSSPHY3KH/action/author_attestation","sign_citation":"https://pith.science/pith/FIA2GQGZR4473K7DCUSSPHY3KH/action/citation_signature","submit_replication":"https://pith.science/pith/FIA2GQGZR4473K7DCUSSPHY3KH/action/replication_record"}},"created_at":"2026-05-18T00:20:00.187643+00:00","updated_at":"2026-05-18T00:20:00.187643+00:00"}