{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:R7FD7Z6BSOFSLVLI26G6GHBALO","short_pith_number":"pith:R7FD7Z6B","schema_version":"1.0","canonical_sha256":"8fca3fe7c1938b25d568d78de31c205b95f89ba95e3f32baf4ab9e0e783d5377","source":{"kind":"arxiv","id":"1707.03372","version":1},"attestation_state":"computed","paper":{"title":"Fast Amortized Inference and Learning in Log-linear Models with Randomly Perturbed Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Levy, Stefano Ermon, Stephen Mussmann","submitted_at":"2017-07-11T17:23:10Z","abstract_excerpt":"Inference in log-linear models scales linearly in the size of output space in the worst-case. This is often a bottleneck in natural language processing and computer vision tasks when the output space is feasibly enumerable but very large. We propose a method to perform inference in log-linear models with sublinear amortized cost. Our idea hinges on using Gumbel random variable perturbations and a pre-computed Maximum Inner Product Search data structure to access the most-likely elements in sublinear amortized time. Our method yields provable runtime and accuracy guarantees. Further, we present"},"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":"1707.03372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-11T17:23:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b1177138e3cc068d797eefad928595a70563976dfa2c0d6803b7d415eef07a55","abstract_canon_sha256":"2dc8068670be068dde7552afc3210a0bc789a54c7fc043cd94706117ef8eb0f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:29.215679Z","signature_b64":"op/k2G3kpq059WsNEe4hMNHzp7Q822SYfXXdZT6/3cWsEcXMVkPVMV4qrbYY/O2R/emSYOFfs9RXMY81gf8hAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fca3fe7c1938b25d568d78de31c205b95f89ba95e3f32baf4ab9e0e783d5377","last_reissued_at":"2026-05-18T00:40:29.215218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:29.215218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Amortized Inference and Learning in Log-linear Models with Randomly Perturbed Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Levy, Stefano Ermon, Stephen Mussmann","submitted_at":"2017-07-11T17:23:10Z","abstract_excerpt":"Inference in log-linear models scales linearly in the size of output space in the worst-case. This is often a bottleneck in natural language processing and computer vision tasks when the output space is feasibly enumerable but very large. We propose a method to perform inference in log-linear models with sublinear amortized cost. Our idea hinges on using Gumbel random variable perturbations and a pre-computed Maximum Inner Product Search data structure to access the most-likely elements in sublinear amortized time. Our method yields provable runtime and accuracy guarantees. Further, we present"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03372","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":"1707.03372","created_at":"2026-05-18T00:40:29.215283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03372v1","created_at":"2026-05-18T00:40:29.215283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03372","created_at":"2026-05-18T00:40:29.215283+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7FD7Z6BSOFS","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7FD7Z6BSOFSLVLI","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7FD7Z6B","created_at":"2026-05-18T12:31:39.905425+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/R7FD7Z6BSOFSLVLI26G6GHBALO","json":"https://pith.science/pith/R7FD7Z6BSOFSLVLI26G6GHBALO.json","graph_json":"https://pith.science/api/pith-number/R7FD7Z6BSOFSLVLI26G6GHBALO/graph.json","events_json":"https://pith.science/api/pith-number/R7FD7Z6BSOFSLVLI26G6GHBALO/events.json","paper":"https://pith.science/paper/R7FD7Z6B"},"agent_actions":{"view_html":"https://pith.science/pith/R7FD7Z6BSOFSLVLI26G6GHBALO","download_json":"https://pith.science/pith/R7FD7Z6BSOFSLVLI26G6GHBALO.json","view_paper":"https://pith.science/paper/R7FD7Z6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03372&json=true","fetch_graph":"https://pith.science/api/pith-number/R7FD7Z6BSOFSLVLI26G6GHBALO/graph.json","fetch_events":"https://pith.science/api/pith-number/R7FD7Z6BSOFSLVLI26G6GHBALO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7FD7Z6BSOFSLVLI26G6GHBALO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7FD7Z6BSOFSLVLI26G6GHBALO/action/storage_attestation","attest_author":"https://pith.science/pith/R7FD7Z6BSOFSLVLI26G6GHBALO/action/author_attestation","sign_citation":"https://pith.science/pith/R7FD7Z6BSOFSLVLI26G6GHBALO/action/citation_signature","submit_replication":"https://pith.science/pith/R7FD7Z6BSOFSLVLI26G6GHBALO/action/replication_record"}},"created_at":"2026-05-18T00:40:29.215283+00:00","updated_at":"2026-05-18T00:40:29.215283+00:00"}