{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QG7X3KCS6FOPSMSJLUOVOJ4K7O","short_pith_number":"pith:QG7X3KCS","schema_version":"1.0","canonical_sha256":"81bf7da852f15cf932495d1d57278afba103d2e8d2595097f6974e7f3d0c55af","source":{"kind":"arxiv","id":"2007.00350","version":3},"attestation_state":"computed","paper":{"title":"Adaptive Procedural Task Generation for Hard-Exploration Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kuan Fang, Li Fei-Fei, Silvio Savarese, Yuke Zhu","submitted_at":"2020-07-01T09:38:51Z","abstract_excerpt":"We introduce Adaptive Procedural Task Generation (APT-Gen), an approach to progressively generate a sequence of tasks as curricula to facilitate reinforcement learning in hard-exploration problems. At the heart of our approach, a task generator learns to create tasks from a parameterized task space via a black-box procedural generation module. To enable curriculum learning in the absence of a direct indicator of learning progress, we propose to train the task generator by balancing the agent's performance in the generated tasks and the similarity to the target tasks. Through adversarial traini"},"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":"2007.00350","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-01T09:38:51Z","cross_cats_sorted":["cs.RO","stat.ML"],"title_canon_sha256":"d5c4300ae7670a4d6383ca1d0e6ca43f6bd2c20ee6cc19a684a1aa5ee140bb26","abstract_canon_sha256":"e25dfdf3932346d0a9737c3dfd36516b42d97fdb48859970e3f69e0a84d6cd8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:24:10.223576Z","signature_b64":"GPYO/tI62NW2GZnKjIWD8c9ujWxg1Zzy/VNcEKid9xZ4a4M4PFVjjkp8nuc6QYwGTbAZv0VFzrSGPnXKqpq3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81bf7da852f15cf932495d1d57278afba103d2e8d2595097f6974e7f3d0c55af","last_reissued_at":"2026-07-05T02:24:10.223157Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:24:10.223157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Procedural Task Generation for Hard-Exploration Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kuan Fang, Li Fei-Fei, Silvio Savarese, Yuke Zhu","submitted_at":"2020-07-01T09:38:51Z","abstract_excerpt":"We introduce Adaptive Procedural Task Generation (APT-Gen), an approach to progressively generate a sequence of tasks as curricula to facilitate reinforcement learning in hard-exploration problems. At the heart of our approach, a task generator learns to create tasks from a parameterized task space via a black-box procedural generation module. To enable curriculum learning in the absence of a direct indicator of learning progress, we propose to train the task generator by balancing the agent's performance in the generated tasks and the similarity to the target tasks. Through adversarial traini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00350","kind":"arxiv","version":3},"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/2007.00350/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":"2007.00350","created_at":"2026-07-05T02:24:10.223213+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.00350v3","created_at":"2026-07-05T02:24:10.223213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00350","created_at":"2026-07-05T02:24:10.223213+00:00"},{"alias_kind":"pith_short_12","alias_value":"QG7X3KCS6FOP","created_at":"2026-07-05T02:24:10.223213+00:00"},{"alias_kind":"pith_short_16","alias_value":"QG7X3KCS6FOPSMSJ","created_at":"2026-07-05T02:24:10.223213+00:00"},{"alias_kind":"pith_short_8","alias_value":"QG7X3KCS","created_at":"2026-07-05T02:24:10.223213+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/QG7X3KCS6FOPSMSJLUOVOJ4K7O","json":"https://pith.science/pith/QG7X3KCS6FOPSMSJLUOVOJ4K7O.json","graph_json":"https://pith.science/api/pith-number/QG7X3KCS6FOPSMSJLUOVOJ4K7O/graph.json","events_json":"https://pith.science/api/pith-number/QG7X3KCS6FOPSMSJLUOVOJ4K7O/events.json","paper":"https://pith.science/paper/QG7X3KCS"},"agent_actions":{"view_html":"https://pith.science/pith/QG7X3KCS6FOPSMSJLUOVOJ4K7O","download_json":"https://pith.science/pith/QG7X3KCS6FOPSMSJLUOVOJ4K7O.json","view_paper":"https://pith.science/paper/QG7X3KCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.00350&json=true","fetch_graph":"https://pith.science/api/pith-number/QG7X3KCS6FOPSMSJLUOVOJ4K7O/graph.json","fetch_events":"https://pith.science/api/pith-number/QG7X3KCS6FOPSMSJLUOVOJ4K7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QG7X3KCS6FOPSMSJLUOVOJ4K7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QG7X3KCS6FOPSMSJLUOVOJ4K7O/action/storage_attestation","attest_author":"https://pith.science/pith/QG7X3KCS6FOPSMSJLUOVOJ4K7O/action/author_attestation","sign_citation":"https://pith.science/pith/QG7X3KCS6FOPSMSJLUOVOJ4K7O/action/citation_signature","submit_replication":"https://pith.science/pith/QG7X3KCS6FOPSMSJLUOVOJ4K7O/action/replication_record"}},"created_at":"2026-07-05T02:24:10.223213+00:00","updated_at":"2026-07-05T02:24:10.223213+00:00"}