{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3AIORTHWBTBHBVS52RDDPT7N43","short_pith_number":"pith:3AIORTHW","schema_version":"1.0","canonical_sha256":"d810e8ccf60cc270d65dd44637cfede6ca31184d85d58ac5ec345ef934e12dfb","source":{"kind":"arxiv","id":"2111.04888","version":4},"attestation_state":"computed","paper":{"title":"Active Linear Regression for $\\ell_p$ Norms and Beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cameron Musco, Christopher Musco, David P. Woodruff, Taisuke Yasuda","submitted_at":"2021-11-09T00:20:01Z","abstract_excerpt":"We study active sampling algorithms for linear regression, which aim to query only a few entries of a target vector $b\\in\\mathbb R^n$ and output a near minimizer to $\\min_{x\\in\\mathbb R^d} \\|Ax-b\\|$, for a design matrix $A\\in\\mathbb R^{n \\times d}$ and loss $\\|\\cdot\\|$.\n  For $p$ norm regression for any $0<p<\\infty$, we give an algorithm based on Lewis weight sampling outputting a $(1+\\epsilon)$-approximate solution using just $\\tilde O(d/\\epsilon^2)$ queries to $b$ for $p\\in(0,1)$, $\\tilde{O}(d/\\epsilon)$ queries for $1<p<2$, and $\\tilde{O}(d^{p/2}/\\epsilon^p)$ queries for $2<p<\\infty$. For $"},"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":"2111.04888","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-09T00:20:01Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"7f7db4cc9f66763f53a69b8a56ed963d949de1dbcda58f94a49a13351cb2606e","abstract_canon_sha256":"b20eff18d23826313cefc95ff4ed4df09116192d3b25f896abbbb1221c136af6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:00:59.738685Z","signature_b64":"MJZXA0DyBm3Y+p0blP9Z3mAlRoLmE6RFiEKwZ3bYOGhRwS/CH42uzszvvtAAXcj1BGmm8B+BF92EuaRJa4gcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d810e8ccf60cc270d65dd44637cfede6ca31184d85d58ac5ec345ef934e12dfb","last_reissued_at":"2026-07-05T05:00:59.738188Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:00:59.738188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active Linear Regression for $\\ell_p$ Norms and Beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cameron Musco, Christopher Musco, David P. Woodruff, Taisuke Yasuda","submitted_at":"2021-11-09T00:20:01Z","abstract_excerpt":"We study active sampling algorithms for linear regression, which aim to query only a few entries of a target vector $b\\in\\mathbb R^n$ and output a near minimizer to $\\min_{x\\in\\mathbb R^d} \\|Ax-b\\|$, for a design matrix $A\\in\\mathbb R^{n \\times d}$ and loss $\\|\\cdot\\|$.\n  For $p$ norm regression for any $0<p<\\infty$, we give an algorithm based on Lewis weight sampling outputting a $(1+\\epsilon)$-approximate solution using just $\\tilde O(d/\\epsilon^2)$ queries to $b$ for $p\\in(0,1)$, $\\tilde{O}(d/\\epsilon)$ queries for $1<p<2$, and $\\tilde{O}(d^{p/2}/\\epsilon^p)$ queries for $2<p<\\infty$. For $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.04888","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.04888/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2111.04888","created_at":"2026-07-05T05:00:59.738245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.04888v4","created_at":"2026-07-05T05:00:59.738245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.04888","created_at":"2026-07-05T05:00:59.738245+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AIORTHWBTBH","created_at":"2026-07-05T05:00:59.738245+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AIORTHWBTBHBVS5","created_at":"2026-07-05T05:00:59.738245+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AIORTHW","created_at":"2026-07-05T05:00:59.738245+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00252","citing_title":"Distributionally Robust Linear Regression With Block Lewis Weights","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3AIORTHWBTBHBVS52RDDPT7N43","json":"https://pith.science/pith/3AIORTHWBTBHBVS52RDDPT7N43.json","graph_json":"https://pith.science/api/pith-number/3AIORTHWBTBHBVS52RDDPT7N43/graph.json","events_json":"https://pith.science/api/pith-number/3AIORTHWBTBHBVS52RDDPT7N43/events.json","paper":"https://pith.science/paper/3AIORTHW"},"agent_actions":{"view_html":"https://pith.science/pith/3AIORTHWBTBHBVS52RDDPT7N43","download_json":"https://pith.science/pith/3AIORTHWBTBHBVS52RDDPT7N43.json","view_paper":"https://pith.science/paper/3AIORTHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.04888&json=true","fetch_graph":"https://pith.science/api/pith-number/3AIORTHWBTBHBVS52RDDPT7N43/graph.json","fetch_events":"https://pith.science/api/pith-number/3AIORTHWBTBHBVS52RDDPT7N43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AIORTHWBTBHBVS52RDDPT7N43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AIORTHWBTBHBVS52RDDPT7N43/action/storage_attestation","attest_author":"https://pith.science/pith/3AIORTHWBTBHBVS52RDDPT7N43/action/author_attestation","sign_citation":"https://pith.science/pith/3AIORTHWBTBHBVS52RDDPT7N43/action/citation_signature","submit_replication":"https://pith.science/pith/3AIORTHWBTBHBVS52RDDPT7N43/action/replication_record"}},"created_at":"2026-07-05T05:00:59.738245+00:00","updated_at":"2026-07-05T05:00:59.738245+00:00"}