{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TW5WKD2UJKONPOS7Y3EWKRGR2T","short_pith_number":"pith:TW5WKD2U","schema_version":"1.0","canonical_sha256":"9dbb650f544a9cd7ba5fc6c96544d1d4d182c0b0bf46489a9589a5b77a459ced","source":{"kind":"arxiv","id":"2012.14966","version":2},"attestation_state":"computed","paper":{"title":"Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Albert Gu, Amit Blonder, Atri Rudra, Christopher R\\'e, Matthew Eichhorn, Megan Leszczynski, Nimit S. Sohoni, Tri Dao","submitted_at":"2020-12-29T22:51:29Z","abstract_excerpt":"Modern neural network architectures use structured linear transformations, such as low-rank matrices, sparse matrices, permutations, and the Fourier transform, to improve inference speed and reduce memory usage compared to general linear maps. However, choosing which of the myriad structured transformations to use (and its associated parameterization) is a laborious task that requires trading off speed, space, and accuracy. We consider a different approach: we introduce a family of matrices called kaleidoscope matrices (K-matrices) that provably capture any structured matrix with near-optimal "},"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":"2012.14966","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-29T22:51:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e04a82bf100474ee059ee155b83f9542f2e783ff778cad301dc237f459f17f96","abstract_canon_sha256":"f68465dcc41ad048ce57bf51adba74c3948dc1b553c42e19fb61eaf4c9d4b947"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:29.924545Z","signature_b64":"dUce+rGnL5CSBtBS1xsJ+srIh2aPGznfuKyryrqLjPcPDJ5HblY1qXWeSOMNsACMgG11nmhPkvOO7B8c8aIwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dbb650f544a9cd7ba5fc6c96544d1d4d182c0b0bf46489a9589a5b77a459ced","last_reissued_at":"2026-07-05T02:04:29.924088Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:29.924088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Albert Gu, Amit Blonder, Atri Rudra, Christopher R\\'e, Matthew Eichhorn, Megan Leszczynski, Nimit S. Sohoni, Tri Dao","submitted_at":"2020-12-29T22:51:29Z","abstract_excerpt":"Modern neural network architectures use structured linear transformations, such as low-rank matrices, sparse matrices, permutations, and the Fourier transform, to improve inference speed and reduce memory usage compared to general linear maps. However, choosing which of the myriad structured transformations to use (and its associated parameterization) is a laborious task that requires trading off speed, space, and accuracy. We consider a different approach: we introduce a family of matrices called kaleidoscope matrices (K-matrices) that provably capture any structured matrix with near-optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.14966","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.14966/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":"2012.14966","created_at":"2026-07-05T02:04:29.924142+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.14966v2","created_at":"2026-07-05T02:04:29.924142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.14966","created_at":"2026-07-05T02:04:29.924142+00:00"},{"alias_kind":"pith_short_12","alias_value":"TW5WKD2UJKON","created_at":"2026-07-05T02:04:29.924142+00:00"},{"alias_kind":"pith_short_16","alias_value":"TW5WKD2UJKONPOS7","created_at":"2026-07-05T02:04:29.924142+00:00"},{"alias_kind":"pith_short_8","alias_value":"TW5WKD2U","created_at":"2026-07-05T02:04:29.924142+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/TW5WKD2UJKONPOS7Y3EWKRGR2T","json":"https://pith.science/pith/TW5WKD2UJKONPOS7Y3EWKRGR2T.json","graph_json":"https://pith.science/api/pith-number/TW5WKD2UJKONPOS7Y3EWKRGR2T/graph.json","events_json":"https://pith.science/api/pith-number/TW5WKD2UJKONPOS7Y3EWKRGR2T/events.json","paper":"https://pith.science/paper/TW5WKD2U"},"agent_actions":{"view_html":"https://pith.science/pith/TW5WKD2UJKONPOS7Y3EWKRGR2T","download_json":"https://pith.science/pith/TW5WKD2UJKONPOS7Y3EWKRGR2T.json","view_paper":"https://pith.science/paper/TW5WKD2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.14966&json=true","fetch_graph":"https://pith.science/api/pith-number/TW5WKD2UJKONPOS7Y3EWKRGR2T/graph.json","fetch_events":"https://pith.science/api/pith-number/TW5WKD2UJKONPOS7Y3EWKRGR2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TW5WKD2UJKONPOS7Y3EWKRGR2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TW5WKD2UJKONPOS7Y3EWKRGR2T/action/storage_attestation","attest_author":"https://pith.science/pith/TW5WKD2UJKONPOS7Y3EWKRGR2T/action/author_attestation","sign_citation":"https://pith.science/pith/TW5WKD2UJKONPOS7Y3EWKRGR2T/action/citation_signature","submit_replication":"https://pith.science/pith/TW5WKD2UJKONPOS7Y3EWKRGR2T/action/replication_record"}},"created_at":"2026-07-05T02:04:29.924142+00:00","updated_at":"2026-07-05T02:04:29.924142+00:00"}