{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N4TYTLO3JH5ZROPDU6RLTPSA7K","short_pith_number":"pith:N4TYTLO3","schema_version":"1.0","canonical_sha256":"6f2789addb49fb98b9e3a7a2b9be40fa9f969ef2c081bbb29bcc67d26c437cbb","source":{"kind":"arxiv","id":"1605.03795","version":3},"attestation_state":"computed","paper":{"title":"Exponential Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexander Novikov, Ivan Oseledets, Mikhail Trofimov","submitted_at":"2016-05-12T13:08:11Z","abstract_excerpt":"Modeling interactions between features improves the performance of machine learning solutions in many domains (e.g. recommender systems or sentiment analysis). In this paper, we introduce Exponential Machines (ExM), a predictor that models all interactions of every order. The key idea is to represent an exponentially large tensor of parameters in a factorized format called Tensor Train (TT). The Tensor Train format regularizes the model and lets you control the number of underlying parameters. To train the model, we develop a stochastic Riemannian optimization procedure, which allows us to fit"},"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.03795","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-12T13:08:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d4b5052002d0c98685b4e603dfc5809005ab5f62782ee0690ffed456f37d3777","abstract_canon_sha256":"9403404afba20790435a8686e4343d3f8dc09702f7039d55caf610e7f1a9e90c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:32.524603Z","signature_b64":"vabDTrajJF38VsP1yzVBipQ9j9NsKQ/y+OvtNgAq6Yjr9gL8wkVWvfZsJoENCsyM2xfblBmto3sRTj5r1P+RAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f2789addb49fb98b9e3a7a2b9be40fa9f969ef2c081bbb29bcc67d26c437cbb","last_reissued_at":"2026-05-18T00:28:32.523946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:32.523946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexander Novikov, Ivan Oseledets, Mikhail Trofimov","submitted_at":"2016-05-12T13:08:11Z","abstract_excerpt":"Modeling interactions between features improves the performance of machine learning solutions in many domains (e.g. recommender systems or sentiment analysis). In this paper, we introduce Exponential Machines (ExM), a predictor that models all interactions of every order. The key idea is to represent an exponentially large tensor of parameters in a factorized format called Tensor Train (TT). The Tensor Train format regularizes the model and lets you control the number of underlying parameters. To train the model, we develop a stochastic Riemannian optimization procedure, which allows us to fit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03795","kind":"arxiv","version":3},"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.03795","created_at":"2026-05-18T00:28:32.524051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03795v3","created_at":"2026-05-18T00:28:32.524051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03795","created_at":"2026-05-18T00:28:32.524051+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4TYTLO3JH5Z","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4TYTLO3JH5ZROPD","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4TYTLO3","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.26238","citing_title":"Beyond Linear Probes: Dynamic Safety Monitoring for Language Models","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2604.06265","citing_title":"SMT-AD: a scalable quantum-inspired anomaly detection approach","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02385","citing_title":"Entanglement is Half the Story: Post-Selection vs. Partial Traces","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N4TYTLO3JH5ZROPDU6RLTPSA7K","json":"https://pith.science/pith/N4TYTLO3JH5ZROPDU6RLTPSA7K.json","graph_json":"https://pith.science/api/pith-number/N4TYTLO3JH5ZROPDU6RLTPSA7K/graph.json","events_json":"https://pith.science/api/pith-number/N4TYTLO3JH5ZROPDU6RLTPSA7K/events.json","paper":"https://pith.science/paper/N4TYTLO3"},"agent_actions":{"view_html":"https://pith.science/pith/N4TYTLO3JH5ZROPDU6RLTPSA7K","download_json":"https://pith.science/pith/N4TYTLO3JH5ZROPDU6RLTPSA7K.json","view_paper":"https://pith.science/paper/N4TYTLO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03795&json=true","fetch_graph":"https://pith.science/api/pith-number/N4TYTLO3JH5ZROPDU6RLTPSA7K/graph.json","fetch_events":"https://pith.science/api/pith-number/N4TYTLO3JH5ZROPDU6RLTPSA7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4TYTLO3JH5ZROPDU6RLTPSA7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4TYTLO3JH5ZROPDU6RLTPSA7K/action/storage_attestation","attest_author":"https://pith.science/pith/N4TYTLO3JH5ZROPDU6RLTPSA7K/action/author_attestation","sign_citation":"https://pith.science/pith/N4TYTLO3JH5ZROPDU6RLTPSA7K/action/citation_signature","submit_replication":"https://pith.science/pith/N4TYTLO3JH5ZROPDU6RLTPSA7K/action/replication_record"}},"created_at":"2026-05-18T00:28:32.524051+00:00","updated_at":"2026-05-18T00:28:32.524051+00:00"}