{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZZ32LU3X7SX3EHTZ2FQTY5LOJ3","short_pith_number":"pith:ZZ32LU3X","schema_version":"1.0","canonical_sha256":"ce77a5d377fcafb21e79d1613c756e4ed6d4169eb9a74fc1cf0b8a7a764e9bb4","source":{"kind":"arxiv","id":"1309.6831","version":1},"attestation_state":"computed","paper":{"title":"Batch-iFDD for Representation Expansion in Large MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alborz Geramifard, Jonathan How, Nicholas Roy, Thomas J. Walsh","submitted_at":"2013-09-26T12:39:19Z","abstract_excerpt":"Matching pursuit (MP) methods are a promising class of feature construction algorithms for value function approximation. Yet existing MP methods require creating a pool of potential features, mandating expert knowledge or enumeration of a large feature pool, both of which hinder scalability. This paper introduces batch incremental feature dependency discovery (Batch-iFDD) as an MP method that inherits a provable convergence property. Additionally, Batch-iFDD does not require a large pool of features, leading to lower computational complexity. Empirical policy evaluation results across three do"},"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":"1309.6831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:39:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2c7f4cbd67950cdc9775a294029e7fb384748723a17df4830fe9b033ed06b326","abstract_canon_sha256":"85e35ac46d9f3c3b89c32c83da0cdbf508e60cb01787d412dd089dce65f2ee98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.246981Z","signature_b64":"HIZLzTUthAv+5RjaGFaGnoKWcB94puPNlXAFtE6NcSre/1Hl+vh4T35LVP3LkRCxfMwqjfUY0ZqMAKcJ9I4GAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce77a5d377fcafb21e79d1613c756e4ed6d4169eb9a74fc1cf0b8a7a764e9bb4","last_reissued_at":"2026-05-18T03:12:10.246326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.246326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Batch-iFDD for Representation Expansion in Large MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alborz Geramifard, Jonathan How, Nicholas Roy, Thomas J. Walsh","submitted_at":"2013-09-26T12:39:19Z","abstract_excerpt":"Matching pursuit (MP) methods are a promising class of feature construction algorithms for value function approximation. Yet existing MP methods require creating a pool of potential features, mandating expert knowledge or enumeration of a large feature pool, both of which hinder scalability. This paper introduces batch incremental feature dependency discovery (Batch-iFDD) as an MP method that inherits a provable convergence property. Additionally, Batch-iFDD does not require a large pool of features, leading to lower computational complexity. Empirical policy evaluation results across three do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6831","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":"1309.6831","created_at":"2026-05-18T03:12:10.246422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6831v1","created_at":"2026-05-18T03:12:10.246422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6831","created_at":"2026-05-18T03:12:10.246422+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZ32LU3X7SX3","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZ32LU3X7SX3EHTZ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZ32LU3X","created_at":"2026-05-18T12:28:09.283467+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/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3","json":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3.json","graph_json":"https://pith.science/api/pith-number/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/graph.json","events_json":"https://pith.science/api/pith-number/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/events.json","paper":"https://pith.science/paper/ZZ32LU3X"},"agent_actions":{"view_html":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3","download_json":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3.json","view_paper":"https://pith.science/paper/ZZ32LU3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6831&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/action/storage_attestation","attest_author":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/action/author_attestation","sign_citation":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/action/citation_signature","submit_replication":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/action/replication_record"}},"created_at":"2026-05-18T03:12:10.246422+00:00","updated_at":"2026-05-18T03:12:10.246422+00:00"}