{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SDEV2VN4CLC2KGHEEP3C5ZHA5Q","short_pith_number":"pith:SDEV2VN4","schema_version":"1.0","canonical_sha256":"90c95d55bc12c5a518e423f62ee4e0ec2e9d4357520c1498edbfc6477e6e695a","source":{"kind":"arxiv","id":"1505.01461","version":1},"attestation_state":"computed","paper":{"title":"Online Hyperparameter-Free Sparse Estimation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Dave Zachariah, Petre Stoica","submitted_at":"2015-05-06T19:03:25Z","abstract_excerpt":"In this paper we derive an online estimator for sparse parameter vectors which, unlike the LASSO approach, does not require the tuning of any hyperparameters. The algorithm is based on a covariance matching approach and is equivalent to a weighted version of the square-root LASSO. The computational complexity of the estimator is of the same order as that of the online versions of regularized least-squares (RLS) and LASSO. We provide a numerical comparison with feasible and infeasible implementations of the LASSO and RLS to illustrate the advantage of the proposed online hyperparameter-free est"},"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.01461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-06T19:03:25Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"c3820b37bc5e39b5b8299b57f98a6cd4e3a846cefbc98abbbd6d84b1c77e379f","abstract_canon_sha256":"bc4e60e15e3b3b9a314e9037d57221a2b358903aed8366ddde0fa5fb3f2b2dc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:26.660914Z","signature_b64":"OOTX1X1wGftila/SGu8Maxrl0I5Z0fBEiDKAJg8y+v/HPqz8GxkbTEUvdaISEDM1pRo7PEkyzTeAX8UFidWbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90c95d55bc12c5a518e423f62ee4e0ec2e9d4357520c1498edbfc6477e6e695a","last_reissued_at":"2026-05-18T01:58:26.660428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:26.660428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Hyperparameter-Free Sparse Estimation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Dave Zachariah, Petre Stoica","submitted_at":"2015-05-06T19:03:25Z","abstract_excerpt":"In this paper we derive an online estimator for sparse parameter vectors which, unlike the LASSO approach, does not require the tuning of any hyperparameters. The algorithm is based on a covariance matching approach and is equivalent to a weighted version of the square-root LASSO. The computational complexity of the estimator is of the same order as that of the online versions of regularized least-squares (RLS) and LASSO. We provide a numerical comparison with feasible and infeasible implementations of the LASSO and RLS to illustrate the advantage of the proposed online hyperparameter-free est"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01461","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.01461","created_at":"2026-05-18T01:58:26.660508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01461v1","created_at":"2026-05-18T01:58:26.660508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01461","created_at":"2026-05-18T01:58:26.660508+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDEV2VN4CLC2","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDEV2VN4CLC2KGHE","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDEV2VN4","created_at":"2026-05-18T12:29:39.896362+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/SDEV2VN4CLC2KGHEEP3C5ZHA5Q","json":"https://pith.science/pith/SDEV2VN4CLC2KGHEEP3C5ZHA5Q.json","graph_json":"https://pith.science/api/pith-number/SDEV2VN4CLC2KGHEEP3C5ZHA5Q/graph.json","events_json":"https://pith.science/api/pith-number/SDEV2VN4CLC2KGHEEP3C5ZHA5Q/events.json","paper":"https://pith.science/paper/SDEV2VN4"},"agent_actions":{"view_html":"https://pith.science/pith/SDEV2VN4CLC2KGHEEP3C5ZHA5Q","download_json":"https://pith.science/pith/SDEV2VN4CLC2KGHEEP3C5ZHA5Q.json","view_paper":"https://pith.science/paper/SDEV2VN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01461&json=true","fetch_graph":"https://pith.science/api/pith-number/SDEV2VN4CLC2KGHEEP3C5ZHA5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/SDEV2VN4CLC2KGHEEP3C5ZHA5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDEV2VN4CLC2KGHEEP3C5ZHA5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDEV2VN4CLC2KGHEEP3C5ZHA5Q/action/storage_attestation","attest_author":"https://pith.science/pith/SDEV2VN4CLC2KGHEEP3C5ZHA5Q/action/author_attestation","sign_citation":"https://pith.science/pith/SDEV2VN4CLC2KGHEEP3C5ZHA5Q/action/citation_signature","submit_replication":"https://pith.science/pith/SDEV2VN4CLC2KGHEEP3C5ZHA5Q/action/replication_record"}},"created_at":"2026-05-18T01:58:26.660508+00:00","updated_at":"2026-05-18T01:58:26.660508+00:00"}