{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MUNRGAUKXDN3AS6PILEHIIXO5Y","short_pith_number":"pith:MUNRGAUK","schema_version":"1.0","canonical_sha256":"651b13028ab8dbb04bcf42c87422eeee30bace98d09b6ca7a3b140b601a51de6","source":{"kind":"arxiv","id":"2603.22273","version":4},"attestation_state":"computed","paper":{"title":"Decoupling Exploration and Policy Optimization: Uncertainty Guided Tree Search for Hard Exploration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Uncertainty-guided tree search decouples exploration from policy optimization to reach SOTA on hard RL benchmarks.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"James Cohan, Zakaria Mhammedi","submitted_at":"2026-03-23T17:56:52Z","abstract_excerpt":"The process of discovery requires active exploration -- the act of collecting new and informative data. However, efficient autonomous exploration remains a major unsolved problem. The dominant paradigm addresses this challenge by using Reinforcement Learning (RL) to train agents with intrinsic motivation, maximizing a composite objective of extrinsic and intrinsic rewards. We suggest that this approach incurs unnecessary overhead: while policy optimization is necessary for precise task execution, employing such machinery solely to expand state coverage may be inefficient. In this paper, we pro"},"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":"2603.22273","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-23T17:56:52Z","cross_cats_sorted":[],"title_canon_sha256":"0bbc81c192dee09c25af7997247b6ad8a825e9fbb458ac5d2b94559859087437","abstract_canon_sha256":"75c8a6e40ae4c65700b5c11715334b9e7e52624b7f1857693e421012fc5ce241"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:30.762111Z","signature_b64":"MhViqjvAMTRh+JBxYZKjFrtdxtcSn/ev6OIOIekfVcR83iRTOHDLoZLD7fezgRFzYn7xwOj45Wk+UWlHhi0EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"651b13028ab8dbb04bcf42c87422eeee30bace98d09b6ca7a3b140b601a51de6","last_reissued_at":"2026-05-18T02:44:30.761130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:30.761130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoupling Exploration and Policy Optimization: Uncertainty Guided Tree Search for Hard Exploration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Uncertainty-guided tree search decouples exploration from policy optimization to reach SOTA on hard RL benchmarks.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"James Cohan, Zakaria Mhammedi","submitted_at":"2026-03-23T17:56:52Z","abstract_excerpt":"The process of discovery requires active exploration -- the act of collecting new and informative data. However, efficient autonomous exploration remains a major unsolved problem. The dominant paradigm addresses this challenge by using Reinforcement Learning (RL) to train agents with intrinsic motivation, maximizing a composite objective of extrinsic and intrinsic rewards. We suggest that this approach incurs unnecessary overhead: while policy optimization is necessary for precise task execution, employing such machinery solely to expand state coverage may be inefficient. In this paper, we pro"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By removing the overhead of policy optimization, our approach explores an order of magnitude more efficiently than standard intrinsic motivation baselines on hard exploration benchmarks. ... achieving state-of-the-art performance by a wide margin on Montezuma's Revenge, Pitfall!, and Venture without relying on domain-specific knowledge. ... solving the MuJoCo Adroit dexterous manipulation and AntMaze tasks in a sparse-reward setting, directly from image observations and without expert demonstrations or offline datasets.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That an uncertainty measure paired with Go-With-The-Winner-style tree search will systematically expand state coverage in hard exploration domains without the policy optimization step, and that the resulting trajectories can be reliably distilled into high-performing policies using existing supervised backward learning algorithms.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Uncertainty-guided tree search decouples exploration from RL policy optimization, achieving order-of-magnitude better efficiency and SOTA performance on sparse-reward tasks like Montezuma's Revenge, Pitfall, and Venture via trajectory distillation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Uncertainty-guided tree search decouples exploration from policy optimization to reach SOTA on hard RL benchmarks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ffd20b98b42349f21d1bdbe122ffb09ffa9b2ec1f9508bc22410a3c2cacd0ada"},"source":{"id":"2603.22273","kind":"arxiv","version":4},"verdict":{"id":"30a17c29-74a6-4588-abc3-4c13a76975d2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T00:17:00.319794Z","strongest_claim":"By removing the overhead of policy optimization, our approach explores an order of magnitude more efficiently than standard intrinsic motivation baselines on hard exploration benchmarks. ... achieving state-of-the-art performance by a wide margin on Montezuma's Revenge, Pitfall!, and Venture without relying on domain-specific knowledge. ... solving the MuJoCo Adroit dexterous manipulation and AntMaze tasks in a sparse-reward setting, directly from image observations and without expert demonstrations or offline datasets.","one_line_summary":"Uncertainty-guided tree search decouples exploration from RL policy optimization, achieving order-of-magnitude better efficiency and SOTA performance on sparse-reward tasks like Montezuma's Revenge, Pitfall, and Venture via trajectory distillation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That an uncertainty measure paired with Go-With-The-Winner-style tree search will systematically expand state coverage in hard exploration domains without the policy optimization step, and that the resulting trajectories can be reliably distilled into high-performing policies using existing supervised backward learning algorithms.","pith_extraction_headline":"Uncertainty-guided tree search decouples exploration from policy optimization to reach SOTA on hard RL benchmarks."},"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":"2603.22273","created_at":"2026-05-18T02:44:30.761188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.22273v4","created_at":"2026-05-18T02:44:30.761188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.22273","created_at":"2026-05-18T02:44:30.761188+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUNRGAUKXDN3","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUNRGAUKXDN3AS6P","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUNRGAUK","created_at":"2026-05-18T12:33:37.589309+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/MUNRGAUKXDN3AS6PILEHIIXO5Y","json":"https://pith.science/pith/MUNRGAUKXDN3AS6PILEHIIXO5Y.json","graph_json":"https://pith.science/api/pith-number/MUNRGAUKXDN3AS6PILEHIIXO5Y/graph.json","events_json":"https://pith.science/api/pith-number/MUNRGAUKXDN3AS6PILEHIIXO5Y/events.json","paper":"https://pith.science/paper/MUNRGAUK"},"agent_actions":{"view_html":"https://pith.science/pith/MUNRGAUKXDN3AS6PILEHIIXO5Y","download_json":"https://pith.science/pith/MUNRGAUKXDN3AS6PILEHIIXO5Y.json","view_paper":"https://pith.science/paper/MUNRGAUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.22273&json=true","fetch_graph":"https://pith.science/api/pith-number/MUNRGAUKXDN3AS6PILEHIIXO5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/MUNRGAUKXDN3AS6PILEHIIXO5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUNRGAUKXDN3AS6PILEHIIXO5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUNRGAUKXDN3AS6PILEHIIXO5Y/action/storage_attestation","attest_author":"https://pith.science/pith/MUNRGAUKXDN3AS6PILEHIIXO5Y/action/author_attestation","sign_citation":"https://pith.science/pith/MUNRGAUKXDN3AS6PILEHIIXO5Y/action/citation_signature","submit_replication":"https://pith.science/pith/MUNRGAUKXDN3AS6PILEHIIXO5Y/action/replication_record"}},"created_at":"2026-05-18T02:44:30.761188+00:00","updated_at":"2026-05-18T02:44:30.761188+00:00"}