{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:467ZRZDMVYWIEJJ6AKDHSJXLU2","short_pith_number":"pith:467ZRZDM","schema_version":"1.0","canonical_sha256":"e7bf98e46cae2c82253e02867926eba68b54acec75d6ad92881c1e6522bc9925","source":{"kind":"arxiv","id":"1907.04543","version":4},"attestation_state":"computed","paper":{"title":"An Optimistic Perspective on Offline Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dale Schuurmans, Mohammad Norouzi, Rishabh Agarwal","submitted_at":"2019-07-10T07:23:27Z","abstract_excerpt":"Off-policy reinforcement learning (RL) using a fixed offline dataset of logged interactions is an important consideration in real world applications. This paper studies offline RL using the DQN replay dataset comprising the entire replay experience of a DQN agent on 60 Atari 2600 games. We demonstrate that recent off-policy deep RL algorithms, even when trained solely on this fixed dataset, outperform the fully trained DQN agent. To enhance generalization in the offline setting, we present Random Ensemble Mixture (REM), a robust Q-learning algorithm that enforces optimal Bellman consistency on"},"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":"1907.04543","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T07:23:27Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"6b14fd78e4ab8effb797d64622dd8a2afb760fb9265fb66110e05f4eb87d3e8c","abstract_canon_sha256":"72ac8bbb44e49919eba11a81bafdff973c4b21aad315eb9bac4c3688e76eb2c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:46.170026Z","signature_b64":"sA0gYHf15rO1vfAaS5pho+Fbwo/m8aaU71up5auIfEq37O6rX4W94Qfh6/2S3CdcKMTGtvtGhr21/wMxSJf4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7bf98e46cae2c82253e02867926eba68b54acec75d6ad92881c1e6522bc9925","last_reissued_at":"2026-07-05T01:53:46.169607Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:46.169607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimistic Perspective on Offline Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dale Schuurmans, Mohammad Norouzi, Rishabh Agarwal","submitted_at":"2019-07-10T07:23:27Z","abstract_excerpt":"Off-policy reinforcement learning (RL) using a fixed offline dataset of logged interactions is an important consideration in real world applications. This paper studies offline RL using the DQN replay dataset comprising the entire replay experience of a DQN agent on 60 Atari 2600 games. We demonstrate that recent off-policy deep RL algorithms, even when trained solely on this fixed dataset, outperform the fully trained DQN agent. To enhance generalization in the offline setting, we present Random Ensemble Mixture (REM), a robust Q-learning algorithm that enforces optimal Bellman consistency on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04543","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/1907.04543/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":"1907.04543","created_at":"2026-07-05T01:53:46.169665+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04543v4","created_at":"2026-07-05T01:53:46.169665+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04543","created_at":"2026-07-05T01:53:46.169665+00:00"},{"alias_kind":"pith_short_12","alias_value":"467ZRZDMVYWI","created_at":"2026-07-05T01:53:46.169665+00:00"},{"alias_kind":"pith_short_16","alias_value":"467ZRZDMVYWIEJJ6","created_at":"2026-07-05T01:53:46.169665+00:00"},{"alias_kind":"pith_short_8","alias_value":"467ZRZDM","created_at":"2026-07-05T01:53:46.169665+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1910.01708","citing_title":"Benchmarking Batch Deep Reinforcement Learning Algorithms","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"1911.11361","citing_title":"Behavior Regularized Offline Reinforcement Learning","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2005.01643","citing_title":"Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems","ref_index":272,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/467ZRZDMVYWIEJJ6AKDHSJXLU2","json":"https://pith.science/pith/467ZRZDMVYWIEJJ6AKDHSJXLU2.json","graph_json":"https://pith.science/api/pith-number/467ZRZDMVYWIEJJ6AKDHSJXLU2/graph.json","events_json":"https://pith.science/api/pith-number/467ZRZDMVYWIEJJ6AKDHSJXLU2/events.json","paper":"https://pith.science/paper/467ZRZDM"},"agent_actions":{"view_html":"https://pith.science/pith/467ZRZDMVYWIEJJ6AKDHSJXLU2","download_json":"https://pith.science/pith/467ZRZDMVYWIEJJ6AKDHSJXLU2.json","view_paper":"https://pith.science/paper/467ZRZDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04543&json=true","fetch_graph":"https://pith.science/api/pith-number/467ZRZDMVYWIEJJ6AKDHSJXLU2/graph.json","fetch_events":"https://pith.science/api/pith-number/467ZRZDMVYWIEJJ6AKDHSJXLU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/467ZRZDMVYWIEJJ6AKDHSJXLU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/467ZRZDMVYWIEJJ6AKDHSJXLU2/action/storage_attestation","attest_author":"https://pith.science/pith/467ZRZDMVYWIEJJ6AKDHSJXLU2/action/author_attestation","sign_citation":"https://pith.science/pith/467ZRZDMVYWIEJJ6AKDHSJXLU2/action/citation_signature","submit_replication":"https://pith.science/pith/467ZRZDMVYWIEJJ6AKDHSJXLU2/action/replication_record"}},"created_at":"2026-07-05T01:53:46.169665+00:00","updated_at":"2026-07-05T01:53:46.169665+00:00"}