{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BY2DNM5DNKS4BTHLXOFYK6VGQM","short_pith_number":"pith:BY2DNM5D","schema_version":"1.0","canonical_sha256":"0e3436b3a36aa5c0ccebbb8b857aa6832723ff64c57eaa4e8fcc6f120f8f4415","source":{"kind":"arxiv","id":"1903.01461","version":4},"attestation_state":"computed","paper":{"title":"Hedging the Drift: Learning to Optimize under Non-Stationarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"David Simchi-Levi, Ruihao Zhu, Wang Chi Cheung","submitted_at":"2019-03-04T15:51:41Z","abstract_excerpt":"We introduce data-driven decision-making algorithms that achieve state-of-the-art \\emph{dynamic regret} bounds for non-stationary bandit settings. These settings capture applications such as advertisement allocation, dynamic pricing, and traffic network routing in changing environments. We show how the difficulty posed by the (unknown \\emph{a priori} and possibly adversarial) non-stationarity can be overcome by an unconventional marriage between stochastic and adversarial bandit learning algorithms. Our main contribution is a general algorithmic recipe for a wide variety of non-stationary band"},"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":"1903.01461","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-04T15:51:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6337bc0c559e81db5ae59e5fa5e8caef593009edc0407f87e79836d57c3dc942","abstract_canon_sha256":"71721a25ae2683220ca605df94ec452cb2e5e4e13e2d14bbfb9479a93cb96ee9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:24:08.266255Z","signature_b64":"JLeGZUp9HOflCY1zHafn9kjF5vbpExQ/ptrfVTvmIUqENVWF8nVUuf0jcBAaJDd5gQ3VHmoja+AgK1EWX0l1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e3436b3a36aa5c0ccebbb8b857aa6832723ff64c57eaa4e8fcc6f120f8f4415","last_reissued_at":"2026-07-05T02:24:08.265814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:24:08.265814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hedging the Drift: Learning to Optimize under Non-Stationarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"David Simchi-Levi, Ruihao Zhu, Wang Chi Cheung","submitted_at":"2019-03-04T15:51:41Z","abstract_excerpt":"We introduce data-driven decision-making algorithms that achieve state-of-the-art \\emph{dynamic regret} bounds for non-stationary bandit settings. These settings capture applications such as advertisement allocation, dynamic pricing, and traffic network routing in changing environments. We show how the difficulty posed by the (unknown \\emph{a priori} and possibly adversarial) non-stationarity can be overcome by an unconventional marriage between stochastic and adversarial bandit learning algorithms. Our main contribution is a general algorithmic recipe for a wide variety of non-stationary band"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01461","kind":"arxiv","version":4},"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/1903.01461/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":"1903.01461","created_at":"2026-07-05T02:24:08.265873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01461v4","created_at":"2026-07-05T02:24:08.265873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01461","created_at":"2026-07-05T02:24:08.265873+00:00"},{"alias_kind":"pith_short_12","alias_value":"BY2DNM5DNKS4","created_at":"2026-07-05T02:24:08.265873+00:00"},{"alias_kind":"pith_short_16","alias_value":"BY2DNM5DNKS4BTHL","created_at":"2026-07-05T02:24:08.265873+00:00"},{"alias_kind":"pith_short_8","alias_value":"BY2DNM5D","created_at":"2026-07-05T02:24:08.265873+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/BY2DNM5DNKS4BTHLXOFYK6VGQM","json":"https://pith.science/pith/BY2DNM5DNKS4BTHLXOFYK6VGQM.json","graph_json":"https://pith.science/api/pith-number/BY2DNM5DNKS4BTHLXOFYK6VGQM/graph.json","events_json":"https://pith.science/api/pith-number/BY2DNM5DNKS4BTHLXOFYK6VGQM/events.json","paper":"https://pith.science/paper/BY2DNM5D"},"agent_actions":{"view_html":"https://pith.science/pith/BY2DNM5DNKS4BTHLXOFYK6VGQM","download_json":"https://pith.science/pith/BY2DNM5DNKS4BTHLXOFYK6VGQM.json","view_paper":"https://pith.science/paper/BY2DNM5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01461&json=true","fetch_graph":"https://pith.science/api/pith-number/BY2DNM5DNKS4BTHLXOFYK6VGQM/graph.json","fetch_events":"https://pith.science/api/pith-number/BY2DNM5DNKS4BTHLXOFYK6VGQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BY2DNM5DNKS4BTHLXOFYK6VGQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BY2DNM5DNKS4BTHLXOFYK6VGQM/action/storage_attestation","attest_author":"https://pith.science/pith/BY2DNM5DNKS4BTHLXOFYK6VGQM/action/author_attestation","sign_citation":"https://pith.science/pith/BY2DNM5DNKS4BTHLXOFYK6VGQM/action/citation_signature","submit_replication":"https://pith.science/pith/BY2DNM5DNKS4BTHLXOFYK6VGQM/action/replication_record"}},"created_at":"2026-07-05T02:24:08.265873+00:00","updated_at":"2026-07-05T02:24:08.265873+00:00"}