{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:P4XFATTAF7WXOIF5QPWGBULHUB","short_pith_number":"pith:P4XFATTA","schema_version":"1.0","canonical_sha256":"7f2e504e602fed7720bd83ec60d167a04d49dd59c1470e0930eaa59c88e6bdde","source":{"kind":"arxiv","id":"1010.3091","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimal Bayesian Active Learning with Noisy Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Daniel Golovin, Debajyoti Ray","submitted_at":"2010-10-15T08:20:46Z","abstract_excerpt":"We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypothesis sampled from a known prior distribution. In the case of noise-free observations, a greedy algorithm called generalized binary search (GBS) is known to perform near-optimally. We show that if the observations are noisy, perhaps surprisingly, GBS can perform very poorly. We develop EC2, a novel, greedy active learning algorithm and prove that it is competitive with the optimal policy, thus obtaining the first comp"},"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":"1010.3091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-15T08:20:46Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"1d1c2b7872abc030303adbae89c64910f1db2243d5fce6783becaf157499a14c","abstract_canon_sha256":"4d515c1cb48452dfab42080630e08e41d354deb334e6c2935ec8d184c123e99a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:38.886340Z","signature_b64":"YOW0MeoQ26LgeppJ+tvyM3A+vwEFf5Qe3uKeYW7OUwZoUfhZ/WAsYYbDF5cbjvJFrVhi1sURPQJcr214/oA6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f2e504e602fed7720bd83ec60d167a04d49dd59c1470e0930eaa59c88e6bdde","last_reissued_at":"2026-05-18T03:04:38.885471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:38.885471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Bayesian Active Learning with Noisy Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Daniel Golovin, Debajyoti Ray","submitted_at":"2010-10-15T08:20:46Z","abstract_excerpt":"We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypothesis sampled from a known prior distribution. In the case of noise-free observations, a greedy algorithm called generalized binary search (GBS) is known to perform near-optimally. We show that if the observations are noisy, perhaps surprisingly, GBS can perform very poorly. We develop EC2, a novel, greedy active learning algorithm and prove that it is competitive with the optimal policy, thus obtaining the first comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3091","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":"1010.3091","created_at":"2026-05-18T03:04:38.885607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.3091v2","created_at":"2026-05-18T03:04:38.885607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3091","created_at":"2026-05-18T03:04:38.885607+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4XFATTAF7WX","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4XFATTAF7WXOIF5","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4XFATTA","created_at":"2026-05-18T12:26:12.377268+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/P4XFATTAF7WXOIF5QPWGBULHUB","json":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB.json","graph_json":"https://pith.science/api/pith-number/P4XFATTAF7WXOIF5QPWGBULHUB/graph.json","events_json":"https://pith.science/api/pith-number/P4XFATTAF7WXOIF5QPWGBULHUB/events.json","paper":"https://pith.science/paper/P4XFATTA"},"agent_actions":{"view_html":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB","download_json":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB.json","view_paper":"https://pith.science/paper/P4XFATTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.3091&json=true","fetch_graph":"https://pith.science/api/pith-number/P4XFATTAF7WXOIF5QPWGBULHUB/graph.json","fetch_events":"https://pith.science/api/pith-number/P4XFATTAF7WXOIF5QPWGBULHUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB/action/storage_attestation","attest_author":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB/action/author_attestation","sign_citation":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB/action/citation_signature","submit_replication":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB/action/replication_record"}},"created_at":"2026-05-18T03:04:38.885607+00:00","updated_at":"2026-05-18T03:04:38.885607+00:00"}