{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2YE4XEZNUYJ5X4LTPJNZ5JTFBA","short_pith_number":"pith:2YE4XEZN","schema_version":"1.0","canonical_sha256":"d609cb932da613dbf1737a5b9ea6650803e4ff883e7a9bad9d34f27a7686734c","source":{"kind":"arxiv","id":"1707.08316","version":1},"attestation_state":"computed","paper":{"title":"Learning Sparse Representations in Reinforcement Learning with Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Lei Le, Martha White, Raksha Kumaraswamy","submitted_at":"2017-07-26T08:23:04Z","abstract_excerpt":"A variety of representation learning approaches have been investigated for reinforcement learning; much less attention, however, has been given to investigating the utility of sparse coding. Outside of reinforcement learning, sparse coding representations have been widely used, with non-convex objectives that result in discriminative representations. In this work, we develop a supervised sparse coding objective for policy evaluation. Despite the non-convexity of this objective, we prove that all local minima are global minima, making the approach amenable to simple optimization strategies. We "},"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":"1707.08316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-26T08:23:04Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"921f493b146de4020d9c588a9be83a6f3d92de46ec9819deca537375d4bcb32c","abstract_canon_sha256":"748c3ce7b8c72251ffacaaab7b4746af0657ea7131516cc83a8be6ff93539e44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:24.627812Z","signature_b64":"LulAi+qRlFul4+/Pnw0UFpc8tMAETkCF0CKqQFHhcG/3LtNNEvHWWUr26+mg6x3lreyXYwU1tXZgr+fOFhDjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d609cb932da613dbf1737a5b9ea6650803e4ff883e7a9bad9d34f27a7686734c","last_reissued_at":"2026-05-18T00:39:24.627327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:24.627327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Sparse Representations in Reinforcement Learning with Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Lei Le, Martha White, Raksha Kumaraswamy","submitted_at":"2017-07-26T08:23:04Z","abstract_excerpt":"A variety of representation learning approaches have been investigated for reinforcement learning; much less attention, however, has been given to investigating the utility of sparse coding. Outside of reinforcement learning, sparse coding representations have been widely used, with non-convex objectives that result in discriminative representations. In this work, we develop a supervised sparse coding objective for policy evaluation. Despite the non-convexity of this objective, we prove that all local minima are global minima, making the approach amenable to simple optimization strategies. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08316","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":"1707.08316","created_at":"2026-05-18T00:39:24.627413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08316v1","created_at":"2026-05-18T00:39:24.627413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08316","created_at":"2026-05-18T00:39:24.627413+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YE4XEZNUYJ5","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YE4XEZNUYJ5X4LT","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YE4XEZN","created_at":"2026-05-18T12:30:55.937587+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/2YE4XEZNUYJ5X4LTPJNZ5JTFBA","json":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA.json","graph_json":"https://pith.science/api/pith-number/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/graph.json","events_json":"https://pith.science/api/pith-number/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/events.json","paper":"https://pith.science/paper/2YE4XEZN"},"agent_actions":{"view_html":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA","download_json":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA.json","view_paper":"https://pith.science/paper/2YE4XEZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08316&json=true","fetch_graph":"https://pith.science/api/pith-number/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/graph.json","fetch_events":"https://pith.science/api/pith-number/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/action/storage_attestation","attest_author":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/action/author_attestation","sign_citation":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/action/citation_signature","submit_replication":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/action/replication_record"}},"created_at":"2026-05-18T00:39:24.627413+00:00","updated_at":"2026-05-18T00:39:24.627413+00:00"}