{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KHLIKA4AKUQDTZRUCJC2ZHENVP","short_pith_number":"pith:KHLIKA4A","schema_version":"1.0","canonical_sha256":"51d6850380552039e6341245ac9c8dabc2b434a820158072cb6cbb507915d06f","source":{"kind":"arxiv","id":"1707.03073","version":2},"attestation_state":"computed","paper":{"title":"TAPAS: Two-pass Approximate Adaptive Sampling for Softmax","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Li Zhang, Sally Goldman, Yu Bai","submitted_at":"2017-07-10T22:01:44Z","abstract_excerpt":"TAPAS is a novel adaptive sampling method for the softmax model. It uses a two pass sampling strategy where the examples used to approximate the gradient of the partition function are first sampled according to a squashed population distribution and then resampled adaptively using the context and current model. We describe an efficient distributed implementation of TAPAS. We show, on both synthetic data and a large real dataset, that TAPAS has low computational overhead and works well for minimizing the rank loss for multi-class classification problems with a very large label space."},"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.03073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-10T22:01:44Z","cross_cats_sorted":[],"title_canon_sha256":"b3efe2bd834bb945fbc794b605ebb957d075d8151b6ae8a391d11a234c843934","abstract_canon_sha256":"d56f9c466121fd17b51b4ac49934f3fa8c76eb81a2e1569b7872bd4381efbbf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.886531Z","signature_b64":"ux/3pHS+dsrodzg7baC9YyzZyQgw+NPCX69aTN6/aJkVVx/0Rxx76gIMIKYGExSEI4g6AgyKhTl6TJDe+yhCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51d6850380552039e6341245ac9c8dabc2b434a820158072cb6cbb507915d06f","last_reissued_at":"2026-05-18T00:40:18.885877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.885877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TAPAS: Two-pass Approximate Adaptive Sampling for Softmax","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Li Zhang, Sally Goldman, Yu Bai","submitted_at":"2017-07-10T22:01:44Z","abstract_excerpt":"TAPAS is a novel adaptive sampling method for the softmax model. It uses a two pass sampling strategy where the examples used to approximate the gradient of the partition function are first sampled according to a squashed population distribution and then resampled adaptively using the context and current model. We describe an efficient distributed implementation of TAPAS. We show, on both synthetic data and a large real dataset, that TAPAS has low computational overhead and works well for minimizing the rank loss for multi-class classification problems with a very large label space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03073","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":"1707.03073","created_at":"2026-05-18T00:40:18.885967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03073v2","created_at":"2026-05-18T00:40:18.885967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03073","created_at":"2026-05-18T00:40:18.885967+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHLIKA4AKUQD","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHLIKA4AKUQDTZRU","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHLIKA4A","created_at":"2026-05-18T12:31:24.725408+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/KHLIKA4AKUQDTZRUCJC2ZHENVP","json":"https://pith.science/pith/KHLIKA4AKUQDTZRUCJC2ZHENVP.json","graph_json":"https://pith.science/api/pith-number/KHLIKA4AKUQDTZRUCJC2ZHENVP/graph.json","events_json":"https://pith.science/api/pith-number/KHLIKA4AKUQDTZRUCJC2ZHENVP/events.json","paper":"https://pith.science/paper/KHLIKA4A"},"agent_actions":{"view_html":"https://pith.science/pith/KHLIKA4AKUQDTZRUCJC2ZHENVP","download_json":"https://pith.science/pith/KHLIKA4AKUQDTZRUCJC2ZHENVP.json","view_paper":"https://pith.science/paper/KHLIKA4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03073&json=true","fetch_graph":"https://pith.science/api/pith-number/KHLIKA4AKUQDTZRUCJC2ZHENVP/graph.json","fetch_events":"https://pith.science/api/pith-number/KHLIKA4AKUQDTZRUCJC2ZHENVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHLIKA4AKUQDTZRUCJC2ZHENVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHLIKA4AKUQDTZRUCJC2ZHENVP/action/storage_attestation","attest_author":"https://pith.science/pith/KHLIKA4AKUQDTZRUCJC2ZHENVP/action/author_attestation","sign_citation":"https://pith.science/pith/KHLIKA4AKUQDTZRUCJC2ZHENVP/action/citation_signature","submit_replication":"https://pith.science/pith/KHLIKA4AKUQDTZRUCJC2ZHENVP/action/replication_record"}},"created_at":"2026-05-18T00:40:18.885967+00:00","updated_at":"2026-05-18T00:40:18.885967+00:00"}