{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AZ67ZLSNRMUY6R6Z7ABVCIMGPV","short_pith_number":"pith:AZ67ZLSN","schema_version":"1.0","canonical_sha256":"067dfcae4d8b298f47d9f8035121867d554a2812f65dcad6c93d341486b7e48c","source":{"kind":"arxiv","id":"1610.09726","version":1},"attestation_state":"computed","paper":{"title":"The Multi-fidelity Multi-armed Bandit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Barnab\\'as P\\'oczos, Gautam Dasarathy, Jeff Schneider, Kirthevasan Kandasamy","submitted_at":"2016-10-30T23:07:49Z","abstract_excerpt":"We study a variant of the classical stochastic $K$-armed bandit where observing the outcome of each arm is expensive, but cheap approximations to this outcome are available. For example, in online advertising the performance of an ad can be approximated by displaying it for shorter time periods or to narrower audiences. We formalise this task as a multi-fidelity bandit, where, at each time step, the forecaster may choose to play an arm at any one of $M$ fidelities. The highest fidelity (desired outcome) expends cost $\\lambda^{(m)}$. The $m^{\\text{th}}$ fidelity (an approximation) expends $\\lam"},"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":"1610.09726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-30T23:07:49Z","cross_cats_sorted":[],"title_canon_sha256":"253c0425726633f1a959ccf6104cf381fe5bb5fb557d9b8d6fd45c9bd0752d2b","abstract_canon_sha256":"70ba88bc5dc36dd56ee8f14f71c62fd1800e349686f6e1c3c4f7250e461d9c2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:47.313780Z","signature_b64":"ZOODzbxAgiCm4u5X3CpujkvMcjjwdL588FvqOEmlRVnQHr6kuQDvjz+whi+mMkbZqbk8MR98C2PUcxMAgp0bBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"067dfcae4d8b298f47d9f8035121867d554a2812f65dcad6c93d341486b7e48c","last_reissued_at":"2026-05-18T01:00:47.313345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:47.313345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Multi-fidelity Multi-armed Bandit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Barnab\\'as P\\'oczos, Gautam Dasarathy, Jeff Schneider, Kirthevasan Kandasamy","submitted_at":"2016-10-30T23:07:49Z","abstract_excerpt":"We study a variant of the classical stochastic $K$-armed bandit where observing the outcome of each arm is expensive, but cheap approximations to this outcome are available. For example, in online advertising the performance of an ad can be approximated by displaying it for shorter time periods or to narrower audiences. We formalise this task as a multi-fidelity bandit, where, at each time step, the forecaster may choose to play an arm at any one of $M$ fidelities. The highest fidelity (desired outcome) expends cost $\\lambda^{(m)}$. The $m^{\\text{th}}$ fidelity (an approximation) expends $\\lam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09726","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":"1610.09726","created_at":"2026-05-18T01:00:47.313413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09726v1","created_at":"2026-05-18T01:00:47.313413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09726","created_at":"2026-05-18T01:00:47.313413+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZ67ZLSNRMUY","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZ67ZLSNRMUY6R6Z","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZ67ZLSN","created_at":"2026-05-18T12:30:07.202191+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/AZ67ZLSNRMUY6R6Z7ABVCIMGPV","json":"https://pith.science/pith/AZ67ZLSNRMUY6R6Z7ABVCIMGPV.json","graph_json":"https://pith.science/api/pith-number/AZ67ZLSNRMUY6R6Z7ABVCIMGPV/graph.json","events_json":"https://pith.science/api/pith-number/AZ67ZLSNRMUY6R6Z7ABVCIMGPV/events.json","paper":"https://pith.science/paper/AZ67ZLSN"},"agent_actions":{"view_html":"https://pith.science/pith/AZ67ZLSNRMUY6R6Z7ABVCIMGPV","download_json":"https://pith.science/pith/AZ67ZLSNRMUY6R6Z7ABVCIMGPV.json","view_paper":"https://pith.science/paper/AZ67ZLSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09726&json=true","fetch_graph":"https://pith.science/api/pith-number/AZ67ZLSNRMUY6R6Z7ABVCIMGPV/graph.json","fetch_events":"https://pith.science/api/pith-number/AZ67ZLSNRMUY6R6Z7ABVCIMGPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZ67ZLSNRMUY6R6Z7ABVCIMGPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZ67ZLSNRMUY6R6Z7ABVCIMGPV/action/storage_attestation","attest_author":"https://pith.science/pith/AZ67ZLSNRMUY6R6Z7ABVCIMGPV/action/author_attestation","sign_citation":"https://pith.science/pith/AZ67ZLSNRMUY6R6Z7ABVCIMGPV/action/citation_signature","submit_replication":"https://pith.science/pith/AZ67ZLSNRMUY6R6Z7ABVCIMGPV/action/replication_record"}},"created_at":"2026-05-18T01:00:47.313413+00:00","updated_at":"2026-05-18T01:00:47.313413+00:00"}