{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6PCJOC3Z6RBZCRDQI4FQHCJAMB","short_pith_number":"pith:6PCJOC3Z","schema_version":"1.0","canonical_sha256":"f3c4970b79f443914470470b038920605206e71d3a128af6f68a90fa39315b0e","source":{"kind":"arxiv","id":"1505.06659","version":1},"attestation_state":"computed","paper":{"title":"Statistical and Algorithmic Perspectives on Randomized Sketching for Ordinary Least-Squares -- ICML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Garvesh Raskutti, Michael Mahoney","submitted_at":"2015-05-25T15:10:53Z","abstract_excerpt":"We consider statistical and algorithmic aspects of solving large-scale least-squares (LS) problems using randomized sketching algorithms. Prior results show that, from an \\emph{algorithmic perspective}, when using sketching matrices constructed from random projections and leverage-score sampling, if the number of samples $r$ much smaller than the original sample size $n$, then the worst-case (WC) error is the same as solving the original problem, up to a very small relative error. From a \\emph{statistical perspective}, one typically considers the mean-squared error performance of randomized sk"},"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":"1505.06659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-25T15:10:53Z","cross_cats_sorted":[],"title_canon_sha256":"6c4cc28d35fdbdce75a8a4a226ec2ed06a550175651a858cbde77272eb35ba0f","abstract_canon_sha256":"ea11efc9b921e403dffe6ec0392b2120898f96c7f3a3cd8f43121650cae411e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:44.347353Z","signature_b64":"Hz0ogW/giCo39hb2eazIdfJ4pioNoLToEjhfj2tM2looUsXsitdvQiNRUDC9zlp4GeftT1PbvkneHW0aEMVqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3c4970b79f443914470470b038920605206e71d3a128af6f68a90fa39315b0e","last_reissued_at":"2026-05-18T02:03:44.346614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:44.346614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical and Algorithmic Perspectives on Randomized Sketching for Ordinary Least-Squares -- ICML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Garvesh Raskutti, Michael Mahoney","submitted_at":"2015-05-25T15:10:53Z","abstract_excerpt":"We consider statistical and algorithmic aspects of solving large-scale least-squares (LS) problems using randomized sketching algorithms. Prior results show that, from an \\emph{algorithmic perspective}, when using sketching matrices constructed from random projections and leverage-score sampling, if the number of samples $r$ much smaller than the original sample size $n$, then the worst-case (WC) error is the same as solving the original problem, up to a very small relative error. From a \\emph{statistical perspective}, one typically considers the mean-squared error performance of randomized sk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06659","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":"1505.06659","created_at":"2026-05-18T02:03:44.346722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06659v1","created_at":"2026-05-18T02:03:44.346722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06659","created_at":"2026-05-18T02:03:44.346722+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PCJOC3Z6RBZ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PCJOC3Z6RBZCRDQ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PCJOC3Z","created_at":"2026-05-18T12:29:07.941421+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/6PCJOC3Z6RBZCRDQI4FQHCJAMB","json":"https://pith.science/pith/6PCJOC3Z6RBZCRDQI4FQHCJAMB.json","graph_json":"https://pith.science/api/pith-number/6PCJOC3Z6RBZCRDQI4FQHCJAMB/graph.json","events_json":"https://pith.science/api/pith-number/6PCJOC3Z6RBZCRDQI4FQHCJAMB/events.json","paper":"https://pith.science/paper/6PCJOC3Z"},"agent_actions":{"view_html":"https://pith.science/pith/6PCJOC3Z6RBZCRDQI4FQHCJAMB","download_json":"https://pith.science/pith/6PCJOC3Z6RBZCRDQI4FQHCJAMB.json","view_paper":"https://pith.science/paper/6PCJOC3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06659&json=true","fetch_graph":"https://pith.science/api/pith-number/6PCJOC3Z6RBZCRDQI4FQHCJAMB/graph.json","fetch_events":"https://pith.science/api/pith-number/6PCJOC3Z6RBZCRDQI4FQHCJAMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PCJOC3Z6RBZCRDQI4FQHCJAMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PCJOC3Z6RBZCRDQI4FQHCJAMB/action/storage_attestation","attest_author":"https://pith.science/pith/6PCJOC3Z6RBZCRDQI4FQHCJAMB/action/author_attestation","sign_citation":"https://pith.science/pith/6PCJOC3Z6RBZCRDQI4FQHCJAMB/action/citation_signature","submit_replication":"https://pith.science/pith/6PCJOC3Z6RBZCRDQI4FQHCJAMB/action/replication_record"}},"created_at":"2026-05-18T02:03:44.346722+00:00","updated_at":"2026-05-18T02:03:44.346722+00:00"}