{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4LSQTMP6VPGDQPIUS6IITVTGTW","short_pith_number":"pith:4LSQTMP6","schema_version":"1.0","canonical_sha256":"e2e509b1feabcc383d14979089d6669d9995eb6e706cdb3af0031f45577c81b3","source":{"kind":"arxiv","id":"1507.01029","version":1},"attestation_state":"computed","paper":{"title":"Lambda-Policy Iteration: A Review and a New Implementation","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DS","math.NA","math.OC"],"primary_cat":"cs.SY","authors_text":"Dimitri P. Bertsekas","submitted_at":"2015-07-03T21:09:29Z","abstract_excerpt":"In this paper we discuss $\\l$-policy iteration, a method for exact and approximate dynamic programming. It is intermediate between the classical value iteration (VI) and policy iteration (PI) methods, and it is closely related to optimistic (also known as modified) PI, whereby each policy evaluation is done approximately, using a finite number of VI. We review the theory of the method and associated questions of bias and exploration arising in simulation-based cost function approximation. We then discuss various implementations, which offer advantages over well-established PI methods that use "},"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":"1507.01029","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SY","submitted_at":"2015-07-03T21:09:29Z","cross_cats_sorted":["cs.DS","math.NA","math.OC"],"title_canon_sha256":"005dcc7e01b6f4d18dd9676503ea7e9e7d10476f61a3c066e8a57d0b8ff2f29e","abstract_canon_sha256":"3ec6ec00051ed84832b1acfcc080fa50684fcb9dd25999dc9bfc752735c5e27d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:18.355506Z","signature_b64":"79o/4JnMZQpLpmIHZ/8DUXO94Lb3QQ/gEc1gr3iTQsi/GIwUauMJiQsjsAYz2+eZKBlK+UeSp815qQqg/h2iCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2e509b1feabcc383d14979089d6669d9995eb6e706cdb3af0031f45577c81b3","last_reissued_at":"2026-05-18T01:37:18.354754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:18.354754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lambda-Policy Iteration: A Review and a New Implementation","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DS","math.NA","math.OC"],"primary_cat":"cs.SY","authors_text":"Dimitri P. Bertsekas","submitted_at":"2015-07-03T21:09:29Z","abstract_excerpt":"In this paper we discuss $\\l$-policy iteration, a method for exact and approximate dynamic programming. It is intermediate between the classical value iteration (VI) and policy iteration (PI) methods, and it is closely related to optimistic (also known as modified) PI, whereby each policy evaluation is done approximately, using a finite number of VI. We review the theory of the method and associated questions of bias and exploration arising in simulation-based cost function approximation. We then discuss various implementations, which offer advantages over well-established PI methods that use "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01029","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":""},"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":"1507.01029","created_at":"2026-05-18T01:37:18.354865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01029v1","created_at":"2026-05-18T01:37:18.354865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01029","created_at":"2026-05-18T01:37:18.354865+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LSQTMP6VPGD","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LSQTMP6VPGDQPIU","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LSQTMP6","created_at":"2026-05-18T12:29:05.191682+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/4LSQTMP6VPGDQPIUS6IITVTGTW","json":"https://pith.science/pith/4LSQTMP6VPGDQPIUS6IITVTGTW.json","graph_json":"https://pith.science/api/pith-number/4LSQTMP6VPGDQPIUS6IITVTGTW/graph.json","events_json":"https://pith.science/api/pith-number/4LSQTMP6VPGDQPIUS6IITVTGTW/events.json","paper":"https://pith.science/paper/4LSQTMP6"},"agent_actions":{"view_html":"https://pith.science/pith/4LSQTMP6VPGDQPIUS6IITVTGTW","download_json":"https://pith.science/pith/4LSQTMP6VPGDQPIUS6IITVTGTW.json","view_paper":"https://pith.science/paper/4LSQTMP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01029&json=true","fetch_graph":"https://pith.science/api/pith-number/4LSQTMP6VPGDQPIUS6IITVTGTW/graph.json","fetch_events":"https://pith.science/api/pith-number/4LSQTMP6VPGDQPIUS6IITVTGTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LSQTMP6VPGDQPIUS6IITVTGTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LSQTMP6VPGDQPIUS6IITVTGTW/action/storage_attestation","attest_author":"https://pith.science/pith/4LSQTMP6VPGDQPIUS6IITVTGTW/action/author_attestation","sign_citation":"https://pith.science/pith/4LSQTMP6VPGDQPIUS6IITVTGTW/action/citation_signature","submit_replication":"https://pith.science/pith/4LSQTMP6VPGDQPIUS6IITVTGTW/action/replication_record"}},"created_at":"2026-05-18T01:37:18.354865+00:00","updated_at":"2026-05-18T01:37:18.354865+00:00"}