{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SNHBDF3EN5GTWPSZ3OBYSJ3UQO","short_pith_number":"pith:SNHBDF3E","schema_version":"1.0","canonical_sha256":"934e1197646f4d3b3e59db8389277483abed5f7a0bb7e1003af9ef3bbe06c261","source":{"kind":"arxiv","id":"2504.01766","version":1},"attestation_state":"computed","paper":{"title":"Learning with Imperfect Models: When Multi-step Prediction Mitigates Compounding Error","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY"],"primary_cat":"eess.SY","authors_text":"Anne Somalwar, Bruce D. Lee, George J. Pappas, Nikolai Matni","submitted_at":"2025-04-02T14:18:52Z","abstract_excerpt":"Compounding error, where small prediction mistakes accumulate over time, presents a major challenge in learning-based control. For example, this issue often limits the performance of model-based reinforcement learning and imitation learning. One common approach to mitigate compounding error is to train multi-step predictors directly, rather than relying on autoregressive rollout of a single-step model. However, it is not well understood when the benefits of multi-step prediction outweigh the added complexity of learning a more complicated model. In this work, we provide a rigorous analysis of "},"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":"2504.01766","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2025-04-02T14:18:52Z","cross_cats_sorted":["cs.LG","cs.SY"],"title_canon_sha256":"7689fb6fe663b973e05354fb49a56c483eb81b6313ae5e82b3bc72035117d3d7","abstract_canon_sha256":"3eab46ec7ec607efc9428b2b809fa323bde607af93081a39f32795ee9804425c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:29.565819Z","signature_b64":"uXq72SiQ2l1Bki8qcTesJ3Q31it+9UT7hydxfCb6wnMo4wvhZfvyuUk6PCGD0E3RfXW/wJGJH112kGIhJYavDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"934e1197646f4d3b3e59db8389277483abed5f7a0bb7e1003af9ef3bbe06c261","last_reissued_at":"2026-07-05T10:43:29.565364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:29.565364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning with Imperfect Models: When Multi-step Prediction Mitigates Compounding Error","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY"],"primary_cat":"eess.SY","authors_text":"Anne Somalwar, Bruce D. Lee, George J. Pappas, Nikolai Matni","submitted_at":"2025-04-02T14:18:52Z","abstract_excerpt":"Compounding error, where small prediction mistakes accumulate over time, presents a major challenge in learning-based control. For example, this issue often limits the performance of model-based reinforcement learning and imitation learning. One common approach to mitigate compounding error is to train multi-step predictors directly, rather than relying on autoregressive rollout of a single-step model. However, it is not well understood when the benefits of multi-step prediction outweigh the added complexity of learning a more complicated model. In this work, we provide a rigorous analysis of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.01766","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/2504.01766/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":"2504.01766","created_at":"2026-07-05T10:43:29.565421+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.01766v1","created_at":"2026-07-05T10:43:29.565421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.01766","created_at":"2026-07-05T10:43:29.565421+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNHBDF3EN5GT","created_at":"2026-07-05T10:43:29.565421+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNHBDF3EN5GTWPSZ","created_at":"2026-07-05T10:43:29.565421+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNHBDF3E","created_at":"2026-07-05T10:43:29.565421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31438","citing_title":"Flow map learning in nonlinear vector autoregressive models: influence of the feature-library structure on the training error","ref_index":91,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SNHBDF3EN5GTWPSZ3OBYSJ3UQO","json":"https://pith.science/pith/SNHBDF3EN5GTWPSZ3OBYSJ3UQO.json","graph_json":"https://pith.science/api/pith-number/SNHBDF3EN5GTWPSZ3OBYSJ3UQO/graph.json","events_json":"https://pith.science/api/pith-number/SNHBDF3EN5GTWPSZ3OBYSJ3UQO/events.json","paper":"https://pith.science/paper/SNHBDF3E"},"agent_actions":{"view_html":"https://pith.science/pith/SNHBDF3EN5GTWPSZ3OBYSJ3UQO","download_json":"https://pith.science/pith/SNHBDF3EN5GTWPSZ3OBYSJ3UQO.json","view_paper":"https://pith.science/paper/SNHBDF3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.01766&json=true","fetch_graph":"https://pith.science/api/pith-number/SNHBDF3EN5GTWPSZ3OBYSJ3UQO/graph.json","fetch_events":"https://pith.science/api/pith-number/SNHBDF3EN5GTWPSZ3OBYSJ3UQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNHBDF3EN5GTWPSZ3OBYSJ3UQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNHBDF3EN5GTWPSZ3OBYSJ3UQO/action/storage_attestation","attest_author":"https://pith.science/pith/SNHBDF3EN5GTWPSZ3OBYSJ3UQO/action/author_attestation","sign_citation":"https://pith.science/pith/SNHBDF3EN5GTWPSZ3OBYSJ3UQO/action/citation_signature","submit_replication":"https://pith.science/pith/SNHBDF3EN5GTWPSZ3OBYSJ3UQO/action/replication_record"}},"created_at":"2026-07-05T10:43:29.565421+00:00","updated_at":"2026-07-05T10:43:29.565421+00:00"}