{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JNM422V7U3KODLPDFPX6QTWYS7","short_pith_number":"pith:JNM422V7","canonical_record":{"source":{"id":"1709.06919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-20T15:04:50Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","stat.ML"],"title_canon_sha256":"ffbd57aaa9ecdab2cd5de5bde4a379a191a6841ff9237d79b150085c93f2f904","abstract_canon_sha256":"587c434168136462afef20ebf2bfb4144776e18c87b790a2d33983bb4d5ac5a6"},"schema_version":"1.0"},"canonical_sha256":"4b59cd6abfa6d4e1ade32befe84ed897db1ea5df3206aa620a70a2e40b6df02b","source":{"kind":"arxiv","id":"1709.06919","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06919","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06919v2","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06919","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"pith_short_12","alias_value":"JNM422V7U3KO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JNM422V7U3KODLPD","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JNM422V7","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JNM422V7U3KODLPDFPX6QTWYS7","target":"record","payload":{"canonical_record":{"source":{"id":"1709.06919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-20T15:04:50Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","stat.ML"],"title_canon_sha256":"ffbd57aaa9ecdab2cd5de5bde4a379a191a6841ff9237d79b150085c93f2f904","abstract_canon_sha256":"587c434168136462afef20ebf2bfb4144776e18c87b790a2d33983bb4d5ac5a6"},"schema_version":"1.0"},"canonical_sha256":"4b59cd6abfa6d4e1ade32befe84ed897db1ea5df3206aa620a70a2e40b6df02b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:25.178692Z","signature_b64":"wBCMjgKNG+y6AToooq2TxUv4Q9bixZCl31GqdqZwOyILK51ntreTanxdXrnQHAddAYaVtBoqTgIsRnanyVrPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b59cd6abfa6d4e1ade32befe84ed897db1ea5df3206aa620a70a2e40b6df02b","last_reissued_at":"2026-05-18T00:21:25.178056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:25.178056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.06919","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kglrwzLVy0y2oM1da+BBupFlfAIRVIoV4pzoZBHnb8c6Cx2EI7YupedEPA29iWadzRyrFt7tSbOBqE20bf+3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:20:43.776102Z"},"content_sha256":"2ce8eda8f73dbf7ad5cfe7fc739b980d0a1bf754627243a3921f4253c1f1a2f6","schema_version":"1.0","event_id":"sha256:2ce8eda8f73dbf7ad5cfe7fc739b980d0a1bf754627243a3921f4253c1f1a2f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JNM422V7U3KODLPDFPX6QTWYS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Optimization with Automatic Prior Selection for Data-Efficient Direct Policy Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE","stat.ML"],"primary_cat":"cs.RO","authors_text":"Jean-Baptiste Mouret, Konstantinos Chatzilygeroudis, R\\'emi Pautrat","submitted_at":"2017-09-20T15:04:50Z","abstract_excerpt":"One of the most interesting features of Bayesian optimization for direct policy search is that it can leverage priors (e.g., from simulation or from previous tasks) to accelerate learning on a robot. In this paper, we are interested in situations for which several priors exist but we do not know in advance which one fits best the current situation. We tackle this problem by introducing a novel acquisition function, called Most Likely Expected Improvement (MLEI), that combines the likelihood of the priors and the expected improvement. We evaluate this new acquisition function on a transfer lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06919","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+awNqfYRTIsQ0ZSuWrYWB8fgShiRAOGN72pf0wlOAlSHroGUciKAG7I8oLk3Lcj8SuuFy3PrLr+f8XV+IlNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:20:43.776784Z"},"content_sha256":"69b95c6ddbf7f6867bb44360884118a2dce787ec93ccef4504e26affa49d4aa7","schema_version":"1.0","event_id":"sha256:69b95c6ddbf7f6867bb44360884118a2dce787ec93ccef4504e26affa49d4aa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNM422V7U3KODLPDFPX6QTWYS7/bundle.json","state_url":"https://pith.science/pith/JNM422V7U3KODLPDFPX6QTWYS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNM422V7U3KODLPDFPX6QTWYS7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T01:20:43Z","links":{"resolver":"https://pith.science/pith/JNM422V7U3KODLPDFPX6QTWYS7","bundle":"https://pith.science/pith/JNM422V7U3KODLPDFPX6QTWYS7/bundle.json","state":"https://pith.science/pith/JNM422V7U3KODLPDFPX6QTWYS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNM422V7U3KODLPDFPX6QTWYS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JNM422V7U3KODLPDFPX6QTWYS7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"587c434168136462afef20ebf2bfb4144776e18c87b790a2d33983bb4d5ac5a6","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-20T15:04:50Z","title_canon_sha256":"ffbd57aaa9ecdab2cd5de5bde4a379a191a6841ff9237d79b150085c93f2f904"},"schema_version":"1.0","source":{"id":"1709.06919","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06919","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06919v2","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06919","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"pith_short_12","alias_value":"JNM422V7U3KO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JNM422V7U3KODLPD","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JNM422V7","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:69b95c6ddbf7f6867bb44360884118a2dce787ec93ccef4504e26affa49d4aa7","target":"graph","created_at":"2026-05-18T00:21:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"One of the most interesting features of Bayesian optimization for direct policy search is that it can leverage priors (e.g., from simulation or from previous tasks) to accelerate learning on a robot. In this paper, we are interested in situations for which several priors exist but we do not know in advance which one fits best the current situation. We tackle this problem by introducing a novel acquisition function, called Most Likely Expected Improvement (MLEI), that combines the likelihood of the priors and the expected improvement. We evaluate this new acquisition function on a transfer lear","authors_text":"Jean-Baptiste Mouret, Konstantinos Chatzilygeroudis, R\\'emi Pautrat","cross_cats":["cs.AI","cs.LG","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-20T15:04:50Z","title":"Bayesian Optimization with Automatic Prior Selection for Data-Efficient Direct Policy Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06919","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2ce8eda8f73dbf7ad5cfe7fc739b980d0a1bf754627243a3921f4253c1f1a2f6","target":"record","created_at":"2026-05-18T00:21:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"587c434168136462afef20ebf2bfb4144776e18c87b790a2d33983bb4d5ac5a6","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-20T15:04:50Z","title_canon_sha256":"ffbd57aaa9ecdab2cd5de5bde4a379a191a6841ff9237d79b150085c93f2f904"},"schema_version":"1.0","source":{"id":"1709.06919","kind":"arxiv","version":2}},"canonical_sha256":"4b59cd6abfa6d4e1ade32befe84ed897db1ea5df3206aa620a70a2e40b6df02b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b59cd6abfa6d4e1ade32befe84ed897db1ea5df3206aa620a70a2e40b6df02b","first_computed_at":"2026-05-18T00:21:25.178056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:25.178056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wBCMjgKNG+y6AToooq2TxUv4Q9bixZCl31GqdqZwOyILK51ntreTanxdXrnQHAddAYaVtBoqTgIsRnanyVrPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:25.178692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06919","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ce8eda8f73dbf7ad5cfe7fc739b980d0a1bf754627243a3921f4253c1f1a2f6","sha256:69b95c6ddbf7f6867bb44360884118a2dce787ec93ccef4504e26affa49d4aa7"],"state_sha256":"793b8cfbf0d748dfa19ae67eaa721172fedd3db3650b9ad6af7e3fe59d1ece37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BBh/qTI6yeVEBxD+yNLwDkldgmlEcwv8abQIdm+cjkp+8UycPHFu7PHqFlwz4x4wYk/USNBOtrihbH0C8VMcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:20:43.780782Z","bundle_sha256":"2a2a5244f6dcefe0a5207d9305ee0419500b1400c000fe883245f3a73c0e30c0"}}