{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IPAFMZHW6422FBI62GLDH6GF7Y","short_pith_number":"pith:IPAFMZHW","schema_version":"1.0","canonical_sha256":"43c05664f6f735a2851ed19633f8c5fe01f0a8a8d2a44e0164ac128ae3c3469c","source":{"kind":"arxiv","id":"1210.1960","version":1},"attestation_state":"computed","paper":{"title":"Feature Selection via L1-Penalized Squared-Loss Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hirotaka Hachiya, Masashi Sugiyama, Wittawat Jitkrittum","submitted_at":"2012-10-06T14:16:33Z","abstract_excerpt":"Feature selection is a technique to screen out less important features. Many existing supervised feature selection algorithms use redundancy and relevancy as the main criteria to select features. However, feature interaction, potentially a key characteristic in real-world problems, has not received much attention. As an attempt to take feature interaction into account, we propose L1-LSMI, an L1-regularization based algorithm that maximizes a squared-loss variant of mutual information between selected features and outputs. Numerical results show that L1-LSMI performs well in handling redundancy"},"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":"1210.1960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-06T14:16:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2e7567eb73094d4857ba6bb72915709c6e4222c601f66b3412bf4ecac7cb0d5c","abstract_canon_sha256":"cbd2b121c24c52710565aa38ba1b36ea69033b2d27d73086add14dbe3c146bc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:54:05.033372Z","signature_b64":"Hw67Jelfl2uitGiRL9DlyrFoUs7EESg4/Ol82ULrvbCKUg0851jmrUdcyvCDBUQT+GQ4gwR8y7YjqDKP0HH6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43c05664f6f735a2851ed19633f8c5fe01f0a8a8d2a44e0164ac128ae3c3469c","last_reissued_at":"2026-05-18T01:54:05.032931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:54:05.032931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feature Selection via L1-Penalized Squared-Loss Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hirotaka Hachiya, Masashi Sugiyama, Wittawat Jitkrittum","submitted_at":"2012-10-06T14:16:33Z","abstract_excerpt":"Feature selection is a technique to screen out less important features. Many existing supervised feature selection algorithms use redundancy and relevancy as the main criteria to select features. However, feature interaction, potentially a key characteristic in real-world problems, has not received much attention. As an attempt to take feature interaction into account, we propose L1-LSMI, an L1-regularization based algorithm that maximizes a squared-loss variant of mutual information between selected features and outputs. Numerical results show that L1-LSMI performs well in handling redundancy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1960","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":"1210.1960","created_at":"2026-05-18T01:54:05.032998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.1960v1","created_at":"2026-05-18T01:54:05.032998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1960","created_at":"2026-05-18T01:54:05.032998+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPAFMZHW6422","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPAFMZHW6422FBI6","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPAFMZHW","created_at":"2026-05-18T12:27:09.501522+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/IPAFMZHW6422FBI62GLDH6GF7Y","json":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y.json","graph_json":"https://pith.science/api/pith-number/IPAFMZHW6422FBI62GLDH6GF7Y/graph.json","events_json":"https://pith.science/api/pith-number/IPAFMZHW6422FBI62GLDH6GF7Y/events.json","paper":"https://pith.science/paper/IPAFMZHW"},"agent_actions":{"view_html":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y","download_json":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y.json","view_paper":"https://pith.science/paper/IPAFMZHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.1960&json=true","fetch_graph":"https://pith.science/api/pith-number/IPAFMZHW6422FBI62GLDH6GF7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/IPAFMZHW6422FBI62GLDH6GF7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y/action/storage_attestation","attest_author":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y/action/author_attestation","sign_citation":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y/action/citation_signature","submit_replication":"https://pith.science/pith/IPAFMZHW6422FBI62GLDH6GF7Y/action/replication_record"}},"created_at":"2026-05-18T01:54:05.032998+00:00","updated_at":"2026-05-18T01:54:05.032998+00:00"}