{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FC6D4TUWMAWBQL5DNAHYTOODMV","short_pith_number":"pith:FC6D4TUW","schema_version":"1.0","canonical_sha256":"28bc3e4e96602c182fa3680f89b9c3654ea6e9f749bd55b3e186fa4987b2e1f1","source":{"kind":"arxiv","id":"1706.06544","version":3},"attestation_state":"computed","paper":{"title":"Robust and Efficient Transfer Learning with Hidden-Parameter Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Finale Doshi-Velez, George Konidaris, Samuel Daulton, Taylor Killian","submitted_at":"2017-06-20T16:51:46Z","abstract_excerpt":"We introduce a new formulation of the Hidden Parameter Markov Decision Process (HiP-MDP), a framework for modeling families of related tasks using low-dimensional latent embeddings. Our new framework correctly models the joint uncertainty in the latent parameters and the state space. We also replace the original Gaussian Process-based model with a Bayesian Neural Network, enabling more scalable inference. Thus, we expand the scope of the HiP-MDP to applications with higher dimensions and more complex dynamics."},"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":"1706.06544","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-20T16:51:46Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"cdf98c8b1a3630e384c3f44ab41e7ee075dea9593e8638cc7b568880b22f4556","abstract_canon_sha256":"01f75109fe0b6cf7302a4d5c00051ca44c2e46658a6f5fc5855303754e91f407"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:45.023951Z","signature_b64":"BV+LF6iQ8iy65tP1HqobM2R/agfFfNSPQ+OYzNoYGL5wGlsDRQyadV0X3LDji/J2vsvzXdyMAlvgHMxPDIlRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28bc3e4e96602c182fa3680f89b9c3654ea6e9f749bd55b3e186fa4987b2e1f1","last_reissued_at":"2026-05-18T00:31:45.023359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:45.023359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and Efficient Transfer Learning with Hidden-Parameter Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Finale Doshi-Velez, George Konidaris, Samuel Daulton, Taylor Killian","submitted_at":"2017-06-20T16:51:46Z","abstract_excerpt":"We introduce a new formulation of the Hidden Parameter Markov Decision Process (HiP-MDP), a framework for modeling families of related tasks using low-dimensional latent embeddings. Our new framework correctly models the joint uncertainty in the latent parameters and the state space. We also replace the original Gaussian Process-based model with a Bayesian Neural Network, enabling more scalable inference. Thus, we expand the scope of the HiP-MDP to applications with higher dimensions and more complex dynamics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06544","kind":"arxiv","version":3},"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":"1706.06544","created_at":"2026-05-18T00:31:45.023456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06544v3","created_at":"2026-05-18T00:31:45.023456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06544","created_at":"2026-05-18T00:31:45.023456+00:00"},{"alias_kind":"pith_short_12","alias_value":"FC6D4TUWMAWB","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FC6D4TUWMAWBQL5D","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FC6D4TUW","created_at":"2026-05-18T12:31:15.632608+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/FC6D4TUWMAWBQL5DNAHYTOODMV","json":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV.json","graph_json":"https://pith.science/api/pith-number/FC6D4TUWMAWBQL5DNAHYTOODMV/graph.json","events_json":"https://pith.science/api/pith-number/FC6D4TUWMAWBQL5DNAHYTOODMV/events.json","paper":"https://pith.science/paper/FC6D4TUW"},"agent_actions":{"view_html":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV","download_json":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV.json","view_paper":"https://pith.science/paper/FC6D4TUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06544&json=true","fetch_graph":"https://pith.science/api/pith-number/FC6D4TUWMAWBQL5DNAHYTOODMV/graph.json","fetch_events":"https://pith.science/api/pith-number/FC6D4TUWMAWBQL5DNAHYTOODMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV/action/storage_attestation","attest_author":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV/action/author_attestation","sign_citation":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV/action/citation_signature","submit_replication":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV/action/replication_record"}},"created_at":"2026-05-18T00:31:45.023456+00:00","updated_at":"2026-05-18T00:31:45.023456+00:00"}