{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4N73GLIK3O3OLXLOKOCBBZULCH","short_pith_number":"pith:4N73GLIK","schema_version":"1.0","canonical_sha256":"e37fb32d0adbb6e5dd6e538410e68b11f838cee13ff1bac9eadca979780c8e2c","source":{"kind":"arxiv","id":"1906.08158","version":2},"attestation_state":"computed","paper":{"title":"BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Kirsch, Joost van Amersfoort, Yarin Gal","submitted_at":"2019-06-19T15:35:07Z","abstract_excerpt":"We develop BatchBALD, a tractable approximation to the mutual information between a batch of points and model parameters, which we use as an acquisition function to select multiple informative points jointly for the task of deep Bayesian active learning. BatchBALD is a greedy linear-time $1 - \\frac{1}{e}$-approximate algorithm amenable to dynamic programming and efficient caching. We compare BatchBALD to the commonly used approach for batch data acquisition and find that the current approach acquires similar and redundant points, sometimes performing worse than randomly acquiring data. We fini"},"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":"1906.08158","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T15:35:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6d976448384fb858aebfcf896023769d626c8251898c418e3c7a3b97cc241b6c","abstract_canon_sha256":"044454d2202f161094b8f48512703bce8b20fe960a9a282f750d4b814bfc920f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:06.573198Z","signature_b64":"3eLzaO6o+g/ZPT9PwgtQJ8DVvgU+NLg5BxhyhLhl+GevZB2fcF7QtBuan53JYRjymttkPRffqt41vMQQi/kPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37fb32d0adbb6e5dd6e538410e68b11f838cee13ff1bac9eadca979780c8e2c","last_reissued_at":"2026-07-05T00:15:06.572684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:06.572684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Kirsch, Joost van Amersfoort, Yarin Gal","submitted_at":"2019-06-19T15:35:07Z","abstract_excerpt":"We develop BatchBALD, a tractable approximation to the mutual information between a batch of points and model parameters, which we use as an acquisition function to select multiple informative points jointly for the task of deep Bayesian active learning. BatchBALD is a greedy linear-time $1 - \\frac{1}{e}$-approximate algorithm amenable to dynamic programming and efficient caching. We compare BatchBALD to the commonly used approach for batch data acquisition and find that the current approach acquires similar and redundant points, sometimes performing worse than randomly acquiring data. We fini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08158","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/1906.08158/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":"1906.08158","created_at":"2026-07-05T00:15:06.572750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08158v2","created_at":"2026-07-05T00:15:06.572750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08158","created_at":"2026-07-05T00:15:06.572750+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N73GLIK3O3O","created_at":"2026-07-05T00:15:06.572750+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N73GLIK3O3OLXLO","created_at":"2026-07-05T00:15:06.572750+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N73GLIK","created_at":"2026-07-05T00:15:06.572750+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19714","citing_title":"AURA: Adaptive Uncertainty-aware Refinement for LLM-as-a-Judge Auditing","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14752","citing_title":"Cognitive-Uncertainty Guided Knowledge Distillation for Accurate Classification of Student Misconceptions","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08977","citing_title":"Testing the Assumptions of Active Learning for Translation Tasks with Few Samples","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4N73GLIK3O3OLXLOKOCBBZULCH","json":"https://pith.science/pith/4N73GLIK3O3OLXLOKOCBBZULCH.json","graph_json":"https://pith.science/api/pith-number/4N73GLIK3O3OLXLOKOCBBZULCH/graph.json","events_json":"https://pith.science/api/pith-number/4N73GLIK3O3OLXLOKOCBBZULCH/events.json","paper":"https://pith.science/paper/4N73GLIK"},"agent_actions":{"view_html":"https://pith.science/pith/4N73GLIK3O3OLXLOKOCBBZULCH","download_json":"https://pith.science/pith/4N73GLIK3O3OLXLOKOCBBZULCH.json","view_paper":"https://pith.science/paper/4N73GLIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08158&json=true","fetch_graph":"https://pith.science/api/pith-number/4N73GLIK3O3OLXLOKOCBBZULCH/graph.json","fetch_events":"https://pith.science/api/pith-number/4N73GLIK3O3OLXLOKOCBBZULCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N73GLIK3O3OLXLOKOCBBZULCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N73GLIK3O3OLXLOKOCBBZULCH/action/storage_attestation","attest_author":"https://pith.science/pith/4N73GLIK3O3OLXLOKOCBBZULCH/action/author_attestation","sign_citation":"https://pith.science/pith/4N73GLIK3O3OLXLOKOCBBZULCH/action/citation_signature","submit_replication":"https://pith.science/pith/4N73GLIK3O3OLXLOKOCBBZULCH/action/replication_record"}},"created_at":"2026-07-05T00:15:06.572750+00:00","updated_at":"2026-07-05T00:15:06.572750+00:00"}