{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LPEYJVPLSAIQON4F4FXUDEBI5J","short_pith_number":"pith:LPEYJVPL","schema_version":"1.0","canonical_sha256":"5bc984d5eb9011073785e16f419028ea7da288a12950dfe17ad37065f3a47539","source":{"kind":"arxiv","id":"1709.05216","version":1},"attestation_state":"computed","paper":{"title":"Optimal Learning for Sequential Decision Making for Expensive Cost Functions with Stochastic Binary Feedbacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Chu Wang, Warren Powell, Yingfei Wang","submitted_at":"2017-09-13T22:01:20Z","abstract_excerpt":"We consider the problem of sequentially making decisions that are rewarded by \"successes\" and \"failures\" which can be predicted through an unknown relationship that depends on a partially controllable vector of attributes for each instance. The learner takes an active role in selecting samples from the instance pool. The goal is to maximize the probability of success in either offline (training) or online (testing) phases. Our problem is motivated by real-world applications where observations are time-consuming and/or expensive. We develop a knowledge gradient policy using an online Bayesian l"},"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":"1709.05216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-13T22:01:20Z","cross_cats_sorted":[],"title_canon_sha256":"c28d1f8a7a27cd98538a50e2c3a778557f67018cb56902c398396dc69de98ce5","abstract_canon_sha256":"14dcf6af417d50cccc924ede22eb0e54056150c8da8b51623d4ba5e9a021c6ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:06.378253Z","signature_b64":"MHwCngJ7ytc6iMeu+799N1WW35VO7QGWfvzY8WL/o4AK/T4H2azZT2HpyA0LQDWypl0KNPud6pqS9RGVbYSaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bc984d5eb9011073785e16f419028ea7da288a12950dfe17ad37065f3a47539","last_reissued_at":"2026-05-18T00:35:06.377750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:06.377750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Learning for Sequential Decision Making for Expensive Cost Functions with Stochastic Binary Feedbacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Chu Wang, Warren Powell, Yingfei Wang","submitted_at":"2017-09-13T22:01:20Z","abstract_excerpt":"We consider the problem of sequentially making decisions that are rewarded by \"successes\" and \"failures\" which can be predicted through an unknown relationship that depends on a partially controllable vector of attributes for each instance. The learner takes an active role in selecting samples from the instance pool. The goal is to maximize the probability of success in either offline (training) or online (testing) phases. Our problem is motivated by real-world applications where observations are time-consuming and/or expensive. We develop a knowledge gradient policy using an online Bayesian l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05216","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":"1709.05216","created_at":"2026-05-18T00:35:06.377823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05216v1","created_at":"2026-05-18T00:35:06.377823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05216","created_at":"2026-05-18T00:35:06.377823+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPEYJVPLSAIQ","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPEYJVPLSAIQON4F","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPEYJVPL","created_at":"2026-05-18T12:31:28.150371+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/LPEYJVPLSAIQON4F4FXUDEBI5J","json":"https://pith.science/pith/LPEYJVPLSAIQON4F4FXUDEBI5J.json","graph_json":"https://pith.science/api/pith-number/LPEYJVPLSAIQON4F4FXUDEBI5J/graph.json","events_json":"https://pith.science/api/pith-number/LPEYJVPLSAIQON4F4FXUDEBI5J/events.json","paper":"https://pith.science/paper/LPEYJVPL"},"agent_actions":{"view_html":"https://pith.science/pith/LPEYJVPLSAIQON4F4FXUDEBI5J","download_json":"https://pith.science/pith/LPEYJVPLSAIQON4F4FXUDEBI5J.json","view_paper":"https://pith.science/paper/LPEYJVPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05216&json=true","fetch_graph":"https://pith.science/api/pith-number/LPEYJVPLSAIQON4F4FXUDEBI5J/graph.json","fetch_events":"https://pith.science/api/pith-number/LPEYJVPLSAIQON4F4FXUDEBI5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPEYJVPLSAIQON4F4FXUDEBI5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPEYJVPLSAIQON4F4FXUDEBI5J/action/storage_attestation","attest_author":"https://pith.science/pith/LPEYJVPLSAIQON4F4FXUDEBI5J/action/author_attestation","sign_citation":"https://pith.science/pith/LPEYJVPLSAIQON4F4FXUDEBI5J/action/citation_signature","submit_replication":"https://pith.science/pith/LPEYJVPLSAIQON4F4FXUDEBI5J/action/replication_record"}},"created_at":"2026-05-18T00:35:06.377823+00:00","updated_at":"2026-05-18T00:35:06.377823+00:00"}