{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SDDFNYUJ4NFDYJ6YBNBDAHFK5C","short_pith_number":"pith:SDDFNYUJ","schema_version":"1.0","canonical_sha256":"90c656e289e34a3c27d80b42301caae89da62151d99cb8737f04878793f673db","source":{"kind":"arxiv","id":"1605.07332","version":2},"attestation_state":"computed","paper":{"title":"Relevant sparse codes with variational information bottleneck","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Gasper Tkacik, Matthew Chalk, Olivier Marre","submitted_at":"2016-05-24T08:16:54Z","abstract_excerpt":"In many applications, it is desirable to extract only the relevant aspects of data. A principled way to do this is the information bottleneck (IB) method, where one seeks a code that maximizes information about a 'relevance' variable, Y, while constraining the information encoded about the original data, X. Unfortunately however, the IB method is computationally demanding when data are high-dimensional and/or non-gaussian. Here we propose an approximate variational scheme for maximizing a lower bound on the IB objective, analogous to variational EM. Using this method, we derive an IB algorithm"},"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":"1605.07332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-24T08:16:54Z","cross_cats_sorted":[],"title_canon_sha256":"1a9e5b361456c7f9dc8c3ba5bd57fac9768db34afe56cdb659105b12429fcd82","abstract_canon_sha256":"2500320dc0e6b38c9f04a1604228793e387119f2bb9eb9f407a12d9d97e07fd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:15.649556Z","signature_b64":"gxxjkKuYfxcqa2zzBd9f0vBWIRtA6e4HjW3yUGCVbATfvoYsHrhutEALXDkdF8QnTLYRA5D5lVlS5mgBKw19Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90c656e289e34a3c27d80b42301caae89da62151d99cb8737f04878793f673db","last_reissued_at":"2026-05-18T01:01:15.648880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:15.648880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relevant sparse codes with variational information bottleneck","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Gasper Tkacik, Matthew Chalk, Olivier Marre","submitted_at":"2016-05-24T08:16:54Z","abstract_excerpt":"In many applications, it is desirable to extract only the relevant aspects of data. A principled way to do this is the information bottleneck (IB) method, where one seeks a code that maximizes information about a 'relevance' variable, Y, while constraining the information encoded about the original data, X. Unfortunately however, the IB method is computationally demanding when data are high-dimensional and/or non-gaussian. Here we propose an approximate variational scheme for maximizing a lower bound on the IB objective, analogous to variational EM. Using this method, we derive an IB algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07332","kind":"arxiv","version":2},"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":"1605.07332","created_at":"2026-05-18T01:01:15.648990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07332v2","created_at":"2026-05-18T01:01:15.648990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07332","created_at":"2026-05-18T01:01:15.648990+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDDFNYUJ4NFD","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDDFNYUJ4NFDYJ6Y","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDDFNYUJ","created_at":"2026-05-18T12:30:44.179134+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/SDDFNYUJ4NFDYJ6YBNBDAHFK5C","json":"https://pith.science/pith/SDDFNYUJ4NFDYJ6YBNBDAHFK5C.json","graph_json":"https://pith.science/api/pith-number/SDDFNYUJ4NFDYJ6YBNBDAHFK5C/graph.json","events_json":"https://pith.science/api/pith-number/SDDFNYUJ4NFDYJ6YBNBDAHFK5C/events.json","paper":"https://pith.science/paper/SDDFNYUJ"},"agent_actions":{"view_html":"https://pith.science/pith/SDDFNYUJ4NFDYJ6YBNBDAHFK5C","download_json":"https://pith.science/pith/SDDFNYUJ4NFDYJ6YBNBDAHFK5C.json","view_paper":"https://pith.science/paper/SDDFNYUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07332&json=true","fetch_graph":"https://pith.science/api/pith-number/SDDFNYUJ4NFDYJ6YBNBDAHFK5C/graph.json","fetch_events":"https://pith.science/api/pith-number/SDDFNYUJ4NFDYJ6YBNBDAHFK5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDDFNYUJ4NFDYJ6YBNBDAHFK5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDDFNYUJ4NFDYJ6YBNBDAHFK5C/action/storage_attestation","attest_author":"https://pith.science/pith/SDDFNYUJ4NFDYJ6YBNBDAHFK5C/action/author_attestation","sign_citation":"https://pith.science/pith/SDDFNYUJ4NFDYJ6YBNBDAHFK5C/action/citation_signature","submit_replication":"https://pith.science/pith/SDDFNYUJ4NFDYJ6YBNBDAHFK5C/action/replication_record"}},"created_at":"2026-05-18T01:01:15.648990+00:00","updated_at":"2026-05-18T01:01:15.648990+00:00"}