{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LZ6K5T4NTOWLC2QFBUNW3Z75I5","short_pith_number":"pith:LZ6K5T4N","schema_version":"1.0","canonical_sha256":"5e7caecf8d9bacb16a050d1b6de7fd47739019b880e754c028dcf3629af584d6","source":{"kind":"arxiv","id":"1810.13258","version":2},"attestation_state":"computed","paper":{"title":"On Fast Leverage Score Sampling and Optimal Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Rudi, Daniele Calandriello, Lorenzo Rosasco, Luigi Carratino","submitted_at":"2018-10-31T12:54:56Z","abstract_excerpt":"Leverage score sampling provides an appealing way to perform approximate computations for large matrices. Indeed, it allows to derive faithful approximations with a complexity adapted to the problem at hand. Yet, performing leverage scores sampling is a challenge in its own right requiring further approximations. In this paper, we study the problem of leverage score sampling for positive definite matrices defined by a kernel. Our contribution is twofold. First we provide a novel algorithm for leverage score sampling and second, we exploit the proposed method in statistical learning by deriving"},"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.13258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-31T12:54:56Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"6e47f7bcd248f0f4ae62cdab6f48853d1e2b8664496e215f0b7b850b118cd991","abstract_canon_sha256":"0fe5dbb63423c2d4b29629f0998237fad6d858d172811b71407505041a7453e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:38.294796Z","signature_b64":"4dLwErjZ+MiI0lpytGhSfjV9eEJZ+MIrD/xhp82GSzcLSdgbs/ZCTpppB8ALtS5u0+uGhl42QsuBpb+jc+W1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e7caecf8d9bacb16a050d1b6de7fd47739019b880e754c028dcf3629af584d6","last_reissued_at":"2026-05-17T23:55:38.294340Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:38.294340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Fast Leverage Score Sampling and Optimal Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Rudi, Daniele Calandriello, Lorenzo Rosasco, Luigi Carratino","submitted_at":"2018-10-31T12:54:56Z","abstract_excerpt":"Leverage score sampling provides an appealing way to perform approximate computations for large matrices. Indeed, it allows to derive faithful approximations with a complexity adapted to the problem at hand. Yet, performing leverage scores sampling is a challenge in its own right requiring further approximations. In this paper, we study the problem of leverage score sampling for positive definite matrices defined by a kernel. Our contribution is twofold. First we provide a novel algorithm for leverage score sampling and second, we exploit the proposed method in statistical learning by deriving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13258","kind":"arxiv","version":2},"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.13258","created_at":"2026-05-17T23:55:38.294421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.13258v2","created_at":"2026-05-17T23:55:38.294421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13258","created_at":"2026-05-17T23:55:38.294421+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZ6K5T4NTOWL","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZ6K5T4NTOWLC2QF","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZ6K5T4N","created_at":"2026-05-18T12:32:37.024351+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/LZ6K5T4NTOWLC2QFBUNW3Z75I5","json":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5.json","graph_json":"https://pith.science/api/pith-number/LZ6K5T4NTOWLC2QFBUNW3Z75I5/graph.json","events_json":"https://pith.science/api/pith-number/LZ6K5T4NTOWLC2QFBUNW3Z75I5/events.json","paper":"https://pith.science/paper/LZ6K5T4N"},"agent_actions":{"view_html":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5","download_json":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5.json","view_paper":"https://pith.science/paper/LZ6K5T4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.13258&json=true","fetch_graph":"https://pith.science/api/pith-number/LZ6K5T4NTOWLC2QFBUNW3Z75I5/graph.json","fetch_events":"https://pith.science/api/pith-number/LZ6K5T4NTOWLC2QFBUNW3Z75I5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5/action/storage_attestation","attest_author":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5/action/author_attestation","sign_citation":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5/action/citation_signature","submit_replication":"https://pith.science/pith/LZ6K5T4NTOWLC2QFBUNW3Z75I5/action/replication_record"}},"created_at":"2026-05-17T23:55:38.294421+00:00","updated_at":"2026-05-17T23:55:38.294421+00:00"}