{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LOK5KZNCHDIRPABOLUMH5G2E45","short_pith_number":"pith:LOK5KZNC","schema_version":"1.0","canonical_sha256":"5b95d565a238d117802e5d187e9b44e75c776904dc4606b390f154d31ab568cc","source":{"kind":"arxiv","id":"1405.4471","version":1},"attestation_state":"computed","paper":{"title":"Online Learning with Composite Loss Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian Ding, Ofer Dekel, Tomer Koren, Yuval Peres","submitted_at":"2014-05-18T08:47:58Z","abstract_excerpt":"We study a new class of online learning problems where each of the online algorithm's actions is assigned an adversarial value, and the loss of the algorithm at each step is a known and deterministic function of the values assigned to its recent actions. This class includes problems where the algorithm's loss is the minimum over the recent adversarial values, the maximum over the recent values, or a linear combination of the recent values. We analyze the minimax regret of this class of problems when the algorithm receives bandit feedback, and prove that when the minimum or maximum functions ar"},"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":"1405.4471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-18T08:47:58Z","cross_cats_sorted":[],"title_canon_sha256":"5b7ca290f780873cec8f2d4cacf59fd1ab42a3bffa0326156ce043614990ac84","abstract_canon_sha256":"aee4a3aec7c1da50efd2d355e9d53999e8fc8a4978aa5f7cdd3d5214beed47b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:40.773888Z","signature_b64":"s6yk0MchB2sXx7dY89smcPg2wyIXhzi+Wa99eH3CzCfaq1vmnhDtCYD6r6natildhc4UR1jVUA3vSiebGKe/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b95d565a238d117802e5d187e9b44e75c776904dc4606b390f154d31ab568cc","last_reissued_at":"2026-05-18T02:51:40.773424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:40.773424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Learning with Composite Loss Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian Ding, Ofer Dekel, Tomer Koren, Yuval Peres","submitted_at":"2014-05-18T08:47:58Z","abstract_excerpt":"We study a new class of online learning problems where each of the online algorithm's actions is assigned an adversarial value, and the loss of the algorithm at each step is a known and deterministic function of the values assigned to its recent actions. This class includes problems where the algorithm's loss is the minimum over the recent adversarial values, the maximum over the recent values, or a linear combination of the recent values. We analyze the minimax regret of this class of problems when the algorithm receives bandit feedback, and prove that when the minimum or maximum functions ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4471","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":"1405.4471","created_at":"2026-05-18T02:51:40.773491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.4471v1","created_at":"2026-05-18T02:51:40.773491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4471","created_at":"2026-05-18T02:51:40.773491+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOK5KZNCHDIR","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOK5KZNCHDIRPABO","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOK5KZNC","created_at":"2026-05-18T12:28:38.356838+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/LOK5KZNCHDIRPABOLUMH5G2E45","json":"https://pith.science/pith/LOK5KZNCHDIRPABOLUMH5G2E45.json","graph_json":"https://pith.science/api/pith-number/LOK5KZNCHDIRPABOLUMH5G2E45/graph.json","events_json":"https://pith.science/api/pith-number/LOK5KZNCHDIRPABOLUMH5G2E45/events.json","paper":"https://pith.science/paper/LOK5KZNC"},"agent_actions":{"view_html":"https://pith.science/pith/LOK5KZNCHDIRPABOLUMH5G2E45","download_json":"https://pith.science/pith/LOK5KZNCHDIRPABOLUMH5G2E45.json","view_paper":"https://pith.science/paper/LOK5KZNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.4471&json=true","fetch_graph":"https://pith.science/api/pith-number/LOK5KZNCHDIRPABOLUMH5G2E45/graph.json","fetch_events":"https://pith.science/api/pith-number/LOK5KZNCHDIRPABOLUMH5G2E45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOK5KZNCHDIRPABOLUMH5G2E45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOK5KZNCHDIRPABOLUMH5G2E45/action/storage_attestation","attest_author":"https://pith.science/pith/LOK5KZNCHDIRPABOLUMH5G2E45/action/author_attestation","sign_citation":"https://pith.science/pith/LOK5KZNCHDIRPABOLUMH5G2E45/action/citation_signature","submit_replication":"https://pith.science/pith/LOK5KZNCHDIRPABOLUMH5G2E45/action/replication_record"}},"created_at":"2026-05-18T02:51:40.773491+00:00","updated_at":"2026-05-18T02:51:40.773491+00:00"}