{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BLKEMQAPHJWFS3QIQSD3VXJHXG","short_pith_number":"pith:BLKEMQAP","schema_version":"1.0","canonical_sha256":"0ad446400f3a6c596e088487badd27b9a4996c6e940789b31467143805481279","source":{"kind":"arxiv","id":"2007.04561","version":2},"attestation_state":"computed","paper":{"title":"Auxiliary Tasks Speed Up Learning PointGoal Navigation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.RO"],"primary_cat":"cs.CV","authors_text":"Abhishek Das, Dhruv Batra, Erik Wijmans, Joel Ye","submitted_at":"2020-07-09T05:22:40Z","abstract_excerpt":"PointGoal Navigation is an embodied task that requires agents to navigate to a specified point in an unseen environment. Wijmans et al. showed that this task is solvable but their method is computationally prohibitive, requiring 2.5 billion frames and 180 GPU-days. In this work, we develop a method to significantly increase sample and time efficiency in learning PointNav using self-supervised auxiliary tasks (e.g. predicting the action taken between two egocentric observations, predicting the distance between two observations from a trajectory,etc.).We find that naively combining multiple auxi"},"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.04561","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2020-07-09T05:22:40Z","cross_cats_sorted":["cs.LG","cs.RO"],"title_canon_sha256":"b967e338e8f814d9fcc9dfd48e13ee945a8e57d34c143441d718d1f83f792cb8","abstract_canon_sha256":"9b3732d42a6add9b99798d138fb84844a6b6559eb567ad04637c60da6a73abb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:17.920910Z","signature_b64":"uiJ12A+hYTBWrwt7LSGpKQtIQCWqrPEjEx2mTCGtAbbTjOWwcrPRgBVK72mWQrwU4U+kTcpqJfRq7cFbBQ7kCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ad446400f3a6c596e088487badd27b9a4996c6e940789b31467143805481279","last_reissued_at":"2026-07-05T01:49:17.920404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:17.920404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Auxiliary Tasks Speed Up Learning PointGoal Navigation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.RO"],"primary_cat":"cs.CV","authors_text":"Abhishek Das, Dhruv Batra, Erik Wijmans, Joel Ye","submitted_at":"2020-07-09T05:22:40Z","abstract_excerpt":"PointGoal Navigation is an embodied task that requires agents to navigate to a specified point in an unseen environment. Wijmans et al. showed that this task is solvable but their method is computationally prohibitive, requiring 2.5 billion frames and 180 GPU-days. In this work, we develop a method to significantly increase sample and time efficiency in learning PointNav using self-supervised auxiliary tasks (e.g. predicting the action taken between two egocentric observations, predicting the distance between two observations from a trajectory,etc.).We find that naively combining multiple auxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.04561","kind":"arxiv","version":2},"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.04561/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.04561","created_at":"2026-07-05T01:49:17.920478+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.04561v2","created_at":"2026-07-05T01:49:17.920478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04561","created_at":"2026-07-05T01:49:17.920478+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLKEMQAPHJWF","created_at":"2026-07-05T01:49:17.920478+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLKEMQAPHJWFS3QI","created_at":"2026-07-05T01:49:17.920478+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLKEMQAP","created_at":"2026-07-05T01:49:17.920478+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.03023","citing_title":"Behavior-Constrained Reinforcement Learning with Receding-Horizon Credit Assignment for High-Performance Control","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BLKEMQAPHJWFS3QIQSD3VXJHXG","json":"https://pith.science/pith/BLKEMQAPHJWFS3QIQSD3VXJHXG.json","graph_json":"https://pith.science/api/pith-number/BLKEMQAPHJWFS3QIQSD3VXJHXG/graph.json","events_json":"https://pith.science/api/pith-number/BLKEMQAPHJWFS3QIQSD3VXJHXG/events.json","paper":"https://pith.science/paper/BLKEMQAP"},"agent_actions":{"view_html":"https://pith.science/pith/BLKEMQAPHJWFS3QIQSD3VXJHXG","download_json":"https://pith.science/pith/BLKEMQAPHJWFS3QIQSD3VXJHXG.json","view_paper":"https://pith.science/paper/BLKEMQAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.04561&json=true","fetch_graph":"https://pith.science/api/pith-number/BLKEMQAPHJWFS3QIQSD3VXJHXG/graph.json","fetch_events":"https://pith.science/api/pith-number/BLKEMQAPHJWFS3QIQSD3VXJHXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLKEMQAPHJWFS3QIQSD3VXJHXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLKEMQAPHJWFS3QIQSD3VXJHXG/action/storage_attestation","attest_author":"https://pith.science/pith/BLKEMQAPHJWFS3QIQSD3VXJHXG/action/author_attestation","sign_citation":"https://pith.science/pith/BLKEMQAPHJWFS3QIQSD3VXJHXG/action/citation_signature","submit_replication":"https://pith.science/pith/BLKEMQAPHJWFS3QIQSD3VXJHXG/action/replication_record"}},"created_at":"2026-07-05T01:49:17.920478+00:00","updated_at":"2026-07-05T01:49:17.920478+00:00"}