{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JLXNRBZ36CGR77EBLPAQM3WBX7","short_pith_number":"pith:JLXNRBZ3","canonical_record":{"source":{"id":"1810.13296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-31T14:13:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7d2e9cc7392144b5f6d1fa70bb1e1183e4bdbe0e9cebf6fe2da29ae876771bf8","abstract_canon_sha256":"0edb82fdd09e84f81b57f761eafec9d87d809cff7b004f91d1422962a931d108"},"schema_version":"1.0"},"canonical_sha256":"4aeed8873bf08d1ffc815bc1066ec1bfe584aac18117cb9786a7747d0afb05db","source":{"kind":"arxiv","id":"1810.13296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13296","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13296v1","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13296","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"JLXNRBZ36CGR","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JLXNRBZ36CGR77EB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JLXNRBZ3","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JLXNRBZ36CGR77EBLPAQM3WBX7","target":"record","payload":{"canonical_record":{"source":{"id":"1810.13296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-31T14:13:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7d2e9cc7392144b5f6d1fa70bb1e1183e4bdbe0e9cebf6fe2da29ae876771bf8","abstract_canon_sha256":"0edb82fdd09e84f81b57f761eafec9d87d809cff7b004f91d1422962a931d108"},"schema_version":"1.0"},"canonical_sha256":"4aeed8873bf08d1ffc815bc1066ec1bfe584aac18117cb9786a7747d0afb05db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:49.758859Z","signature_b64":"aWMyLssHq5ZONDodR93Za9TKoNA7ebPUjdX0xTc30YaYznZoqSojIOLUGzQ4vaQB7Fky8IrHkoYoiCDVkwWwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aeed8873bf08d1ffc815bc1066ec1bfe584aac18117cb9786a7747d0afb05db","last_reissued_at":"2026-05-18T00:01:49.758327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:49.758327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.13296","source_version":1,"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:01:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nl4EW7bpOmZCXrYmZe5sEU30mD9qzm7YjEor9ijktGWVEFPYzB1AFtJAk4n1Rgg/xE56ygM5P0VYcZHWmX3yBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:27:01.978751Z"},"content_sha256":"3ae90ce41f1a1e1de70e737a320d197a5a5efb05874c1b24d1264ef8de5bef4b","schema_version":"1.0","event_id":"sha256:3ae90ce41f1a1e1de70e737a320d197a5a5efb05874c1b24d1264ef8de5bef4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JLXNRBZ36CGR77EBLPAQM3WBX7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Exploration, Exploitation and Learning in Adaptive Importance Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jan-Willem van de Meent, Tom Rainforth, Xiaoyu Lu, Yee Whye Teh, Yuan Zhou","submitted_at":"2018-10-31T14:13:55Z","abstract_excerpt":"We study adaptive importance sampling (AIS) as an online learning problem and argue for the importance of the trade-off between exploration and exploitation in this adaptation. Borrowing ideas from the bandits literature, we propose Daisee, a partition-based AIS algorithm. We further introduce a notion of regret for AIS and show that Daisee has $\\mathcal{O}(\\sqrt{T}(\\log T)^{\\frac{3}{4}})$ cumulative pseudo-regret, where $T$ is the number of iterations. We then extend Daisee to adaptively learn a hierarchical partitioning of the sample space for more efficient sampling and confirm the performa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13296","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"},"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:01:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/CWAn+DtV05SRakymqqGUjWadnqHZg5xzGjRKbVYCPIssdBrL3foGhWJBSRG1PFVRbipGN7pWhSOO1dYt3oBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:27:01.979417Z"},"content_sha256":"10f355927c66ef683de6106009d76cbcea0482a941cf49feb1a68c96082032fc","schema_version":"1.0","event_id":"sha256:10f355927c66ef683de6106009d76cbcea0482a941cf49feb1a68c96082032fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLXNRBZ36CGR77EBLPAQM3WBX7/bundle.json","state_url":"https://pith.science/pith/JLXNRBZ36CGR77EBLPAQM3WBX7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLXNRBZ36CGR77EBLPAQM3WBX7/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-27T16:27:01Z","links":{"resolver":"https://pith.science/pith/JLXNRBZ36CGR77EBLPAQM3WBX7","bundle":"https://pith.science/pith/JLXNRBZ36CGR77EBLPAQM3WBX7/bundle.json","state":"https://pith.science/pith/JLXNRBZ36CGR77EBLPAQM3WBX7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLXNRBZ36CGR77EBLPAQM3WBX7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JLXNRBZ36CGR77EBLPAQM3WBX7","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":"0edb82fdd09e84f81b57f761eafec9d87d809cff7b004f91d1422962a931d108","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-31T14:13:55Z","title_canon_sha256":"7d2e9cc7392144b5f6d1fa70bb1e1183e4bdbe0e9cebf6fe2da29ae876771bf8"},"schema_version":"1.0","source":{"id":"1810.13296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13296","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13296v1","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13296","created_at":"2026-05-18T00:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"JLXNRBZ36CGR","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JLXNRBZ36CGR77EB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JLXNRBZ3","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:10f355927c66ef683de6106009d76cbcea0482a941cf49feb1a68c96082032fc","target":"graph","created_at":"2026-05-18T00:01:49Z","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":"We study adaptive importance sampling (AIS) as an online learning problem and argue for the importance of the trade-off between exploration and exploitation in this adaptation. Borrowing ideas from the bandits literature, we propose Daisee, a partition-based AIS algorithm. We further introduce a notion of regret for AIS and show that Daisee has $\\mathcal{O}(\\sqrt{T}(\\log T)^{\\frac{3}{4}})$ cumulative pseudo-regret, where $T$ is the number of iterations. We then extend Daisee to adaptively learn a hierarchical partitioning of the sample space for more efficient sampling and confirm the performa","authors_text":"Jan-Willem van de Meent, Tom Rainforth, Xiaoyu Lu, Yee Whye Teh, Yuan Zhou","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-31T14:13:55Z","title":"On Exploration, Exploitation and Learning in Adaptive Importance Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13296","kind":"arxiv","version":1},"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:3ae90ce41f1a1e1de70e737a320d197a5a5efb05874c1b24d1264ef8de5bef4b","target":"record","created_at":"2026-05-18T00:01:49Z","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":"0edb82fdd09e84f81b57f761eafec9d87d809cff7b004f91d1422962a931d108","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-31T14:13:55Z","title_canon_sha256":"7d2e9cc7392144b5f6d1fa70bb1e1183e4bdbe0e9cebf6fe2da29ae876771bf8"},"schema_version":"1.0","source":{"id":"1810.13296","kind":"arxiv","version":1}},"canonical_sha256":"4aeed8873bf08d1ffc815bc1066ec1bfe584aac18117cb9786a7747d0afb05db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4aeed8873bf08d1ffc815bc1066ec1bfe584aac18117cb9786a7747d0afb05db","first_computed_at":"2026-05-18T00:01:49.758327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:49.758327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aWMyLssHq5ZONDodR93Za9TKoNA7ebPUjdX0xTc30YaYznZoqSojIOLUGzQ4vaQB7Fky8IrHkoYoiCDVkwWwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:49.758859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae90ce41f1a1e1de70e737a320d197a5a5efb05874c1b24d1264ef8de5bef4b","sha256:10f355927c66ef683de6106009d76cbcea0482a941cf49feb1a68c96082032fc"],"state_sha256":"97e066a866c26c25124c96a2d794958de4a35829aad27a6dfc0a3a5af19dfee3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKVR6koT2Cvkuc8VR7rKrrS4dgCcBbF0a9PBu8Bh/nkdNcBHjtE+ym03buANVwG3cM93Wy739hUn2UCxrDBUBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:27:01.982855Z","bundle_sha256":"3a8cc531afb2ff78b123e0831a36f6ea8929eeead188baa9d1e9d72e64c04b53"}}