{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QHOP3E4FNYU2DUUJVAKC6MIVCE","short_pith_number":"pith:QHOP3E4F","schema_version":"1.0","canonical_sha256":"81dcfd93856e29a1d289a8142f3115110bb23ae5eb9e69c65ec94013b0e9634f","source":{"kind":"arxiv","id":"2404.03382","version":1},"attestation_state":"computed","paper":{"title":"DIDA: Denoised Imitation Learning based on Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"De-Chuan Zhan, Hai-Hang Sun, Kaichen Huang, Le Gan, Minghao Shao, ShengHua Wan, Shuai Feng","submitted_at":"2024-04-04T11:29:05Z","abstract_excerpt":"Imitating skills from low-quality datasets, such as sub-optimal demonstrations and observations with distractors, is common in real-world applications. In this work, we focus on the problem of Learning from Noisy Demonstrations (LND), where the imitator is required to learn from data with noise that often occurs during the processes of data collection or transmission. Previous IL methods improve the robustness of learned policies by injecting an adversarially learned Gaussian noise into pure expert data or utilizing additional ranking information, but they may fail in the LND setting. To allev"},"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":"2404.03382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-04T11:29:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"10e8e4b60a9b424ebe37d4f162502921e655f58e301502711e762c02693aadba","abstract_canon_sha256":"351eaad8bbd9958b66302cccdaf0b625f6bf054b692a035ee2c10db294d0a188"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:24.891848Z","signature_b64":"3Hn0Ptjf7wa/sYCxXq8GiuJtSSlc5KjyKh64pQSEiK++VdbugCRbD1CmnwaV+7wOfvQwfX8QpMCyZiIUc3FGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81dcfd93856e29a1d289a8142f3115110bb23ae5eb9e69c65ec94013b0e9634f","last_reissued_at":"2026-07-05T08:04:24.891373Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:24.891373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DIDA: Denoised Imitation Learning based on Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"De-Chuan Zhan, Hai-Hang Sun, Kaichen Huang, Le Gan, Minghao Shao, ShengHua Wan, Shuai Feng","submitted_at":"2024-04-04T11:29:05Z","abstract_excerpt":"Imitating skills from low-quality datasets, such as sub-optimal demonstrations and observations with distractors, is common in real-world applications. In this work, we focus on the problem of Learning from Noisy Demonstrations (LND), where the imitator is required to learn from data with noise that often occurs during the processes of data collection or transmission. Previous IL methods improve the robustness of learned policies by injecting an adversarially learned Gaussian noise into pure expert data or utilizing additional ranking information, but they may fail in the LND setting. To allev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03382","kind":"arxiv","version":1},"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/2404.03382/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":"2404.03382","created_at":"2026-07-05T08:04:24.891428+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.03382v1","created_at":"2026-07-05T08:04:24.891428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03382","created_at":"2026-07-05T08:04:24.891428+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHOP3E4FNYU2","created_at":"2026-07-05T08:04:24.891428+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHOP3E4FNYU2DUUJ","created_at":"2026-07-05T08:04:24.891428+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHOP3E4F","created_at":"2026-07-05T08:04:24.891428+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29570","citing_title":"Hierarchical Policy Learning via Spectral Decomposition","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHOP3E4FNYU2DUUJVAKC6MIVCE","json":"https://pith.science/pith/QHOP3E4FNYU2DUUJVAKC6MIVCE.json","graph_json":"https://pith.science/api/pith-number/QHOP3E4FNYU2DUUJVAKC6MIVCE/graph.json","events_json":"https://pith.science/api/pith-number/QHOP3E4FNYU2DUUJVAKC6MIVCE/events.json","paper":"https://pith.science/paper/QHOP3E4F"},"agent_actions":{"view_html":"https://pith.science/pith/QHOP3E4FNYU2DUUJVAKC6MIVCE","download_json":"https://pith.science/pith/QHOP3E4FNYU2DUUJVAKC6MIVCE.json","view_paper":"https://pith.science/paper/QHOP3E4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.03382&json=true","fetch_graph":"https://pith.science/api/pith-number/QHOP3E4FNYU2DUUJVAKC6MIVCE/graph.json","fetch_events":"https://pith.science/api/pith-number/QHOP3E4FNYU2DUUJVAKC6MIVCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHOP3E4FNYU2DUUJVAKC6MIVCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHOP3E4FNYU2DUUJVAKC6MIVCE/action/storage_attestation","attest_author":"https://pith.science/pith/QHOP3E4FNYU2DUUJVAKC6MIVCE/action/author_attestation","sign_citation":"https://pith.science/pith/QHOP3E4FNYU2DUUJVAKC6MIVCE/action/citation_signature","submit_replication":"https://pith.science/pith/QHOP3E4FNYU2DUUJVAKC6MIVCE/action/replication_record"}},"created_at":"2026-07-05T08:04:24.891428+00:00","updated_at":"2026-07-05T08:04:24.891428+00:00"}