{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UP6OUASSDVXTJAJODQ4KDU7SIU","short_pith_number":"pith:UP6OUASS","schema_version":"1.0","canonical_sha256":"a3fcea02521d6f34812e1c38a1d3f2450a7242a9a6ec8c528165bac7dee4edcf","source":{"kind":"arxiv","id":"1810.04247","version":7},"attestation_state":"computed","paper":{"title":"Feature Selection using Stochastic Gates","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ofir Lindenbaum, Sahand Negahban, Yutaro Yamada, Yuval Kluger","submitted_at":"2018-10-09T21:17:37Z","abstract_excerpt":"Feature selection problems have been extensively studied for linear estimation, for instance, Lasso, but less emphasis has been placed on feature selection for non-linear functions. In this study, we propose a method for feature selection in high-dimensional non-linear function estimation problems. The new procedure is based on minimizing the $\\ell_0$ norm of the vector of indicator variables that represent if a feature is selected or not. Our approach relies on the continuous relaxation of Bernoulli distributions, which allows our model to learn the parameters of the approximate Bernoulli dis"},"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":"1810.04247","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T21:17:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"99619a5ce9a202cf229db7b786dad0b428a653a55f7dc09d6d6eaa1dafa50084","abstract_canon_sha256":"7406fc8a17e84dfd8f4907d3b0eb90d28f4f181186710f412351c524e5f96dfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:58.038925Z","signature_b64":"vryeHNyStRJtoWLCqEH3SPW/PJLmO4Zmx82Y8c3rp6XsykpvZC6MTm0osK8CaaSqglQNPthXP7stwVwcmIL2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3fcea02521d6f34812e1c38a1d3f2450a7242a9a6ec8c528165bac7dee4edcf","last_reissued_at":"2026-07-05T01:21:58.038463Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:58.038463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feature Selection using Stochastic Gates","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ofir Lindenbaum, Sahand Negahban, Yutaro Yamada, Yuval Kluger","submitted_at":"2018-10-09T21:17:37Z","abstract_excerpt":"Feature selection problems have been extensively studied for linear estimation, for instance, Lasso, but less emphasis has been placed on feature selection for non-linear functions. In this study, we propose a method for feature selection in high-dimensional non-linear function estimation problems. The new procedure is based on minimizing the $\\ell_0$ norm of the vector of indicator variables that represent if a feature is selected or not. Our approach relies on the continuous relaxation of Bernoulli distributions, which allows our model to learn the parameters of the approximate Bernoulli dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04247","kind":"arxiv","version":7},"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/1810.04247/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":"1810.04247","created_at":"2026-07-05T01:21:58.038532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04247v7","created_at":"2026-07-05T01:21:58.038532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04247","created_at":"2026-07-05T01:21:58.038532+00:00"},{"alias_kind":"pith_short_12","alias_value":"UP6OUASSDVXT","created_at":"2026-07-05T01:21:58.038532+00:00"},{"alias_kind":"pith_short_16","alias_value":"UP6OUASSDVXTJAJO","created_at":"2026-07-05T01:21:58.038532+00:00"},{"alias_kind":"pith_short_8","alias_value":"UP6OUASS","created_at":"2026-07-05T01:21:58.038532+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/UP6OUASSDVXTJAJODQ4KDU7SIU","json":"https://pith.science/pith/UP6OUASSDVXTJAJODQ4KDU7SIU.json","graph_json":"https://pith.science/api/pith-number/UP6OUASSDVXTJAJODQ4KDU7SIU/graph.json","events_json":"https://pith.science/api/pith-number/UP6OUASSDVXTJAJODQ4KDU7SIU/events.json","paper":"https://pith.science/paper/UP6OUASS"},"agent_actions":{"view_html":"https://pith.science/pith/UP6OUASSDVXTJAJODQ4KDU7SIU","download_json":"https://pith.science/pith/UP6OUASSDVXTJAJODQ4KDU7SIU.json","view_paper":"https://pith.science/paper/UP6OUASS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04247&json=true","fetch_graph":"https://pith.science/api/pith-number/UP6OUASSDVXTJAJODQ4KDU7SIU/graph.json","fetch_events":"https://pith.science/api/pith-number/UP6OUASSDVXTJAJODQ4KDU7SIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UP6OUASSDVXTJAJODQ4KDU7SIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UP6OUASSDVXTJAJODQ4KDU7SIU/action/storage_attestation","attest_author":"https://pith.science/pith/UP6OUASSDVXTJAJODQ4KDU7SIU/action/author_attestation","sign_citation":"https://pith.science/pith/UP6OUASSDVXTJAJODQ4KDU7SIU/action/citation_signature","submit_replication":"https://pith.science/pith/UP6OUASSDVXTJAJODQ4KDU7SIU/action/replication_record"}},"created_at":"2026-07-05T01:21:58.038532+00:00","updated_at":"2026-07-05T01:21:58.038532+00:00"}