{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JINHR4JZDQHK3YEHBTL3ASPVZD","short_pith_number":"pith:JINHR4JZ","schema_version":"1.0","canonical_sha256":"4a1a78f1391c0eade0870cd7b049f5c8de705d1ff255618d1d01c2e8117f097d","source":{"kind":"arxiv","id":"1403.2433","version":1},"attestation_state":"computed","paper":{"title":"Generalised Mixability, Constant Regret, and Bayesian Updating","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mark D. Reid, Rafael M. Frongillo, Robert C. Williamson","submitted_at":"2014-03-10T22:55:11Z","abstract_excerpt":"Mixability of a loss is known to characterise when constant regret bounds are achievable in games of prediction with expert advice through the use of Vovk's aggregating algorithm. We provide a new interpretation of mixability via convex analysis that highlights the role of the Kullback-Leibler divergence in its definition. This naturally generalises to what we call $\\Phi$-mixability where the Bregman divergence $D_\\Phi$ replaces the KL divergence. We prove that losses that are $\\Phi$-mixable also enjoy constant regret bounds via a generalised aggregating algorithm that is similar to mirror des"},"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":"1403.2433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-10T22:55:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c8acbe6a67dcfb167fd31139b38cd3765033d802ba17708cd5ac1c33de36b338","abstract_canon_sha256":"cca7f1d4ed85d37b4f28ea99406d810919e0ce055285a2bd8343fb7283dd3334"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:43.335408Z","signature_b64":"sQY0oeYIcWIhTStoVRAYd9fdsTbZ9mFgYPRbFFcv+7nyFb0GzMqN0MAvtwclXrPFQ6MFwypo3G7hYkfpEVf+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a1a78f1391c0eade0870cd7b049f5c8de705d1ff255618d1d01c2e8117f097d","last_reissued_at":"2026-05-18T02:56:43.334820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:43.334820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalised Mixability, Constant Regret, and Bayesian Updating","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mark D. Reid, Rafael M. Frongillo, Robert C. Williamson","submitted_at":"2014-03-10T22:55:11Z","abstract_excerpt":"Mixability of a loss is known to characterise when constant regret bounds are achievable in games of prediction with expert advice through the use of Vovk's aggregating algorithm. We provide a new interpretation of mixability via convex analysis that highlights the role of the Kullback-Leibler divergence in its definition. This naturally generalises to what we call $\\Phi$-mixability where the Bregman divergence $D_\\Phi$ replaces the KL divergence. We prove that losses that are $\\Phi$-mixable also enjoy constant regret bounds via a generalised aggregating algorithm that is similar to mirror des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2433","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":"1403.2433","created_at":"2026-05-18T02:56:43.334891+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2433v1","created_at":"2026-05-18T02:56:43.334891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2433","created_at":"2026-05-18T02:56:43.334891+00:00"},{"alias_kind":"pith_short_12","alias_value":"JINHR4JZDQHK","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JINHR4JZDQHK3YEH","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JINHR4JZ","created_at":"2026-05-18T12:28:33.132498+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/JINHR4JZDQHK3YEHBTL3ASPVZD","json":"https://pith.science/pith/JINHR4JZDQHK3YEHBTL3ASPVZD.json","graph_json":"https://pith.science/api/pith-number/JINHR4JZDQHK3YEHBTL3ASPVZD/graph.json","events_json":"https://pith.science/api/pith-number/JINHR4JZDQHK3YEHBTL3ASPVZD/events.json","paper":"https://pith.science/paper/JINHR4JZ"},"agent_actions":{"view_html":"https://pith.science/pith/JINHR4JZDQHK3YEHBTL3ASPVZD","download_json":"https://pith.science/pith/JINHR4JZDQHK3YEHBTL3ASPVZD.json","view_paper":"https://pith.science/paper/JINHR4JZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2433&json=true","fetch_graph":"https://pith.science/api/pith-number/JINHR4JZDQHK3YEHBTL3ASPVZD/graph.json","fetch_events":"https://pith.science/api/pith-number/JINHR4JZDQHK3YEHBTL3ASPVZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JINHR4JZDQHK3YEHBTL3ASPVZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JINHR4JZDQHK3YEHBTL3ASPVZD/action/storage_attestation","attest_author":"https://pith.science/pith/JINHR4JZDQHK3YEHBTL3ASPVZD/action/author_attestation","sign_citation":"https://pith.science/pith/JINHR4JZDQHK3YEHBTL3ASPVZD/action/citation_signature","submit_replication":"https://pith.science/pith/JINHR4JZDQHK3YEHBTL3ASPVZD/action/replication_record"}},"created_at":"2026-05-18T02:56:43.334891+00:00","updated_at":"2026-05-18T02:56:43.334891+00:00"}