{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HCMHZU2LV53DBRKFB2IDKXMSRH","short_pith_number":"pith:HCMHZU2L","schema_version":"1.0","canonical_sha256":"38987cd34baf7630c5450e90355d9289f94aadc9258af2b354cc2139327e9b82","source":{"kind":"arxiv","id":"1507.05185","version":1},"attestation_state":"computed","paper":{"title":"Fast Sparse Least-Squares Regression with Non-Asymptotic Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Lijun Zhang, Qihang Lin, Rong Jin, Tianbao Yang","submitted_at":"2015-07-18T13:16:09Z","abstract_excerpt":"In this paper, we study a fast approximation method for {\\it large-scale high-dimensional} sparse least-squares regression problem by exploiting the Johnson-Lindenstrauss (JL) transforms, which embed a set of high-dimensional vectors into a low-dimensional space. In particular, we propose to apply the JL transforms to the data matrix and the target vector and then to solve a sparse least-squares problem on the compressed data with a {\\it slightly larger regularization parameter}. Theoretically, we establish the optimization error bound of the learned model for two different sparsity-inducing r"},"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":"1507.05185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-18T13:16:09Z","cross_cats_sorted":["cs.CC","stat.ML","stat.TH"],"title_canon_sha256":"9d2fdcb0bcb6c2eb5fc1be9ce09aff231293a4cea260f04a210b67535604b020","abstract_canon_sha256":"15119d7c6ec2bdf3a13281e79e8e73a3aa9bc0610ebc36c1a0af6665e16cc060"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:39.348236Z","signature_b64":"+W6pYutv+GgFINZN5gHkDjVH+yJCdXA3mjYz5eoPktMdIbXZDwcv4ycVB9RgqdtEX4TLDPgOg9q/bM56FPozCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38987cd34baf7630c5450e90355d9289f94aadc9258af2b354cc2139327e9b82","last_reissued_at":"2026-05-18T01:36:39.347492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:39.347492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Sparse Least-Squares Regression with Non-Asymptotic Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Lijun Zhang, Qihang Lin, Rong Jin, Tianbao Yang","submitted_at":"2015-07-18T13:16:09Z","abstract_excerpt":"In this paper, we study a fast approximation method for {\\it large-scale high-dimensional} sparse least-squares regression problem by exploiting the Johnson-Lindenstrauss (JL) transforms, which embed a set of high-dimensional vectors into a low-dimensional space. In particular, we propose to apply the JL transforms to the data matrix and the target vector and then to solve a sparse least-squares problem on the compressed data with a {\\it slightly larger regularization parameter}. Theoretically, we establish the optimization error bound of the learned model for two different sparsity-inducing r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05185","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":"1507.05185","created_at":"2026-05-18T01:36:39.347621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05185v1","created_at":"2026-05-18T01:36:39.347621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05185","created_at":"2026-05-18T01:36:39.347621+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCMHZU2LV53D","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCMHZU2LV53DBRKF","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCMHZU2L","created_at":"2026-05-18T12:29:22.688609+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/HCMHZU2LV53DBRKFB2IDKXMSRH","json":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH.json","graph_json":"https://pith.science/api/pith-number/HCMHZU2LV53DBRKFB2IDKXMSRH/graph.json","events_json":"https://pith.science/api/pith-number/HCMHZU2LV53DBRKFB2IDKXMSRH/events.json","paper":"https://pith.science/paper/HCMHZU2L"},"agent_actions":{"view_html":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH","download_json":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH.json","view_paper":"https://pith.science/paper/HCMHZU2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05185&json=true","fetch_graph":"https://pith.science/api/pith-number/HCMHZU2LV53DBRKFB2IDKXMSRH/graph.json","fetch_events":"https://pith.science/api/pith-number/HCMHZU2LV53DBRKFB2IDKXMSRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH/action/storage_attestation","attest_author":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH/action/author_attestation","sign_citation":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH/action/citation_signature","submit_replication":"https://pith.science/pith/HCMHZU2LV53DBRKFB2IDKXMSRH/action/replication_record"}},"created_at":"2026-05-18T01:36:39.347621+00:00","updated_at":"2026-05-18T01:36:39.347621+00:00"}