{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6YZYW4L5ANIE7XF6SQV67IAOPW","short_pith_number":"pith:6YZYW4L5","schema_version":"1.0","canonical_sha256":"f6338b717d03504fdcbe942befa00e7db196873555ff2b67e76d54f50ab6d17b","source":{"kind":"arxiv","id":"2006.06448","version":4},"attestation_state":"computed","paper":{"title":"Probabilistic Best Subset Selection via Gradient-Based Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Bowei Yan, Mingyuan Zhou, Mingzhang Yin, Nhat Ho, Xiaoning Qian","submitted_at":"2020-06-11T13:57:29Z","abstract_excerpt":"In high-dimensional statistics, variable selection recovers the latent sparse patterns from all possible covariate combinations. This paper proposes a novel optimization method to solve the exact L0-regularized regression problem, which is also known as the best subset selection. We reformulate the optimization problem from a discrete space to a continuous one via probabilistic reparameterization. The new objective function is differentiable but its gradient often cannot be computed in a closed form. Then we propose a family of unbiased gradient estimators to optimize the best subset selection"},"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":"2006.06448","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2020-06-11T13:57:29Z","cross_cats_sorted":[],"title_canon_sha256":"a1766d49be8d7795845825d010cbdc38e00e687759c0e061e8f680b7969e0f94","abstract_canon_sha256":"31577fbae8c60003a4f22687ce73284821db23e3d61f07d90d0f96f2e9d359b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:05.792485Z","signature_b64":"hOkwVSOyyKECvTrxAca8eVnnMZEHq92okD6OSbxMNW1GepD0krRjeX0Z//3gYkRpq1oYINuzeUVpgZw68uGrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6338b717d03504fdcbe942befa00e7db196873555ff2b67e76d54f50ab6d17b","last_reissued_at":"2026-07-05T04:28:05.791993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:05.791993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Best Subset Selection via Gradient-Based Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Bowei Yan, Mingyuan Zhou, Mingzhang Yin, Nhat Ho, Xiaoning Qian","submitted_at":"2020-06-11T13:57:29Z","abstract_excerpt":"In high-dimensional statistics, variable selection recovers the latent sparse patterns from all possible covariate combinations. This paper proposes a novel optimization method to solve the exact L0-regularized regression problem, which is also known as the best subset selection. We reformulate the optimization problem from a discrete space to a continuous one via probabilistic reparameterization. The new objective function is differentiable but its gradient often cannot be computed in a closed form. Then we propose a family of unbiased gradient estimators to optimize the best subset selection"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.06448","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/2006.06448/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":"2006.06448","created_at":"2026-07-05T04:28:05.792065+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.06448v4","created_at":"2026-07-05T04:28:05.792065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.06448","created_at":"2026-07-05T04:28:05.792065+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YZYW4L5ANIE","created_at":"2026-07-05T04:28:05.792065+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YZYW4L5ANIE7XF6","created_at":"2026-07-05T04:28:05.792065+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YZYW4L5","created_at":"2026-07-05T04:28:05.792065+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.17469","citing_title":"Efficient compression of neural networks and datasets","ref_index":69,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6YZYW4L5ANIE7XF6SQV67IAOPW","json":"https://pith.science/pith/6YZYW4L5ANIE7XF6SQV67IAOPW.json","graph_json":"https://pith.science/api/pith-number/6YZYW4L5ANIE7XF6SQV67IAOPW/graph.json","events_json":"https://pith.science/api/pith-number/6YZYW4L5ANIE7XF6SQV67IAOPW/events.json","paper":"https://pith.science/paper/6YZYW4L5"},"agent_actions":{"view_html":"https://pith.science/pith/6YZYW4L5ANIE7XF6SQV67IAOPW","download_json":"https://pith.science/pith/6YZYW4L5ANIE7XF6SQV67IAOPW.json","view_paper":"https://pith.science/paper/6YZYW4L5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.06448&json=true","fetch_graph":"https://pith.science/api/pith-number/6YZYW4L5ANIE7XF6SQV67IAOPW/graph.json","fetch_events":"https://pith.science/api/pith-number/6YZYW4L5ANIE7XF6SQV67IAOPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YZYW4L5ANIE7XF6SQV67IAOPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YZYW4L5ANIE7XF6SQV67IAOPW/action/storage_attestation","attest_author":"https://pith.science/pith/6YZYW4L5ANIE7XF6SQV67IAOPW/action/author_attestation","sign_citation":"https://pith.science/pith/6YZYW4L5ANIE7XF6SQV67IAOPW/action/citation_signature","submit_replication":"https://pith.science/pith/6YZYW4L5ANIE7XF6SQV67IAOPW/action/replication_record"}},"created_at":"2026-07-05T04:28:05.792065+00:00","updated_at":"2026-07-05T04:28:05.792065+00:00"}