{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D54FX45JATJSSWM2GYZUBF6PE4","short_pith_number":"pith:D54FX45J","schema_version":"1.0","canonical_sha256":"1f785bf3a904d329599a36334097cf273e4b3b75dd642b4d6e78f795d02924bf","source":{"kind":"arxiv","id":"2405.19374","version":1},"attestation_state":"computed","paper":{"title":"Optimal Multiclass U-Calibration Error and Beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Haipeng Luo, Spandan Senapati, Vatsal Sharan","submitted_at":"2024-05-28T20:33:18Z","abstract_excerpt":"We consider the problem of online multiclass U-calibration, where a forecaster aims to make sequential distributional predictions over $K$ classes with low U-calibration error, that is, low regret with respect to all bounded proper losses simultaneously. Kleinberg et al. (2023) developed an algorithm with U-calibration error $O(K\\sqrt{T})$ after $T$ rounds and raised the open question of what the optimal bound is. We resolve this question by showing that the optimal U-calibration error is $\\Theta(\\sqrt{KT})$ -- we start with a simple observation that the Follow-the-Perturbed-Leader algorithm o"},"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":"2405.19374","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-05-28T20:33:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"21e35ead774d5568478d367052e383cadaae9c7245940f5a05e99b2de3a7bc05","abstract_canon_sha256":"72ade4b020953d70288cdc7027c19ee5e6cd5fe434d56c599c40c00b5f075499"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:25:06.904903Z","signature_b64":"Zru/fmYG05ZRTOfGH9Va2g8kgbRiLf6+f6GdGonDd+2Nzczck1GAQe/J6sEV0QYXo9OaVaZ2by4V9wN1IaN1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f785bf3a904d329599a36334097cf273e4b3b75dd642b4d6e78f795d02924bf","last_reissued_at":"2026-07-05T08:25:06.904453Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:25:06.904453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Multiclass U-Calibration Error and Beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Haipeng Luo, Spandan Senapati, Vatsal Sharan","submitted_at":"2024-05-28T20:33:18Z","abstract_excerpt":"We consider the problem of online multiclass U-calibration, where a forecaster aims to make sequential distributional predictions over $K$ classes with low U-calibration error, that is, low regret with respect to all bounded proper losses simultaneously. Kleinberg et al. (2023) developed an algorithm with U-calibration error $O(K\\sqrt{T})$ after $T$ rounds and raised the open question of what the optimal bound is. We resolve this question by showing that the optimal U-calibration error is $\\Theta(\\sqrt{KT})$ -- we start with a simple observation that the Follow-the-Perturbed-Leader algorithm o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.19374","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.19374/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.19374","created_at":"2026-07-05T08:25:06.904510+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.19374v1","created_at":"2026-07-05T08:25:06.904510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.19374","created_at":"2026-07-05T08:25:06.904510+00:00"},{"alias_kind":"pith_short_12","alias_value":"D54FX45JATJS","created_at":"2026-07-05T08:25:06.904510+00:00"},{"alias_kind":"pith_short_16","alias_value":"D54FX45JATJSSWM2","created_at":"2026-07-05T08:25:06.904510+00:00"},{"alias_kind":"pith_short_8","alias_value":"D54FX45J","created_at":"2026-07-05T08:25:06.904510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.21460","citing_title":"High-Dimensional Calibration from Swap Regret","ref_index":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D54FX45JATJSSWM2GYZUBF6PE4","json":"https://pith.science/pith/D54FX45JATJSSWM2GYZUBF6PE4.json","graph_json":"https://pith.science/api/pith-number/D54FX45JATJSSWM2GYZUBF6PE4/graph.json","events_json":"https://pith.science/api/pith-number/D54FX45JATJSSWM2GYZUBF6PE4/events.json","paper":"https://pith.science/paper/D54FX45J"},"agent_actions":{"view_html":"https://pith.science/pith/D54FX45JATJSSWM2GYZUBF6PE4","download_json":"https://pith.science/pith/D54FX45JATJSSWM2GYZUBF6PE4.json","view_paper":"https://pith.science/paper/D54FX45J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.19374&json=true","fetch_graph":"https://pith.science/api/pith-number/D54FX45JATJSSWM2GYZUBF6PE4/graph.json","fetch_events":"https://pith.science/api/pith-number/D54FX45JATJSSWM2GYZUBF6PE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D54FX45JATJSSWM2GYZUBF6PE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D54FX45JATJSSWM2GYZUBF6PE4/action/storage_attestation","attest_author":"https://pith.science/pith/D54FX45JATJSSWM2GYZUBF6PE4/action/author_attestation","sign_citation":"https://pith.science/pith/D54FX45JATJSSWM2GYZUBF6PE4/action/citation_signature","submit_replication":"https://pith.science/pith/D54FX45JATJSSWM2GYZUBF6PE4/action/replication_record"}},"created_at":"2026-07-05T08:25:06.904510+00:00","updated_at":"2026-07-05T08:25:06.904510+00:00"}