{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4FGJMAAKPQIIBMMFJBCJHO3ROR","short_pith_number":"pith:4FGJMAAK","schema_version":"1.0","canonical_sha256":"e14c96000a7c1080b185484493bb717474d8677ecb50b66aa59f858bf6fea593","source":{"kind":"arxiv","id":"1302.2672","version":1},"attestation_state":"computed","paper":{"title":"Competing With Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexander Rakhlin, Karthik Sridharan, Wei Han","submitted_at":"2013-02-12T00:14:44Z","abstract_excerpt":"We study the problem of online learning with a notion of regret defined with respect to a set of strategies. We develop tools for analyzing the minimax rates and for deriving regret-minimization algorithms in this scenario. While the standard methods for minimizing the usual notion of regret fail, through our analysis we demonstrate existence of regret-minimization methods that compete with such sets of strategies as: autoregressive algorithms, strategies based on statistical models, regularized least squares, and follow the regularized leader strategies. In several cases we also derive effici"},"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":"1302.2672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-12T00:14:44Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"f0c595f7bd5698d626bd464c1e3b980551fb6164877ece41bc0f0cd6ca821147","abstract_canon_sha256":"ec87e82f07a9c4f9821c651d4b117e649dca1904e25fbf0fe974cddfcc62a0c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:51.234160Z","signature_b64":"Qi6Wj3SEflMqLpC52SwhwAZDtzfH7UVMGaHvpCzIpyt/gwwTa1T67UZrWhuL8S91At8lgnI4T53weoQSiaYPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e14c96000a7c1080b185484493bb717474d8677ecb50b66aa59f858bf6fea593","last_reissued_at":"2026-05-18T03:33:51.233295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:51.233295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competing With Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexander Rakhlin, Karthik Sridharan, Wei Han","submitted_at":"2013-02-12T00:14:44Z","abstract_excerpt":"We study the problem of online learning with a notion of regret defined with respect to a set of strategies. We develop tools for analyzing the minimax rates and for deriving regret-minimization algorithms in this scenario. While the standard methods for minimizing the usual notion of regret fail, through our analysis we demonstrate existence of regret-minimization methods that compete with such sets of strategies as: autoregressive algorithms, strategies based on statistical models, regularized least squares, and follow the regularized leader strategies. In several cases we also derive effici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2672","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":"1302.2672","created_at":"2026-05-18T03:33:51.233445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2672v1","created_at":"2026-05-18T03:33:51.233445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2672","created_at":"2026-05-18T03:33:51.233445+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FGJMAAKPQII","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FGJMAAKPQIIBMMF","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FGJMAAK","created_at":"2026-05-18T12:27:34.582898+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/4FGJMAAKPQIIBMMFJBCJHO3ROR","json":"https://pith.science/pith/4FGJMAAKPQIIBMMFJBCJHO3ROR.json","graph_json":"https://pith.science/api/pith-number/4FGJMAAKPQIIBMMFJBCJHO3ROR/graph.json","events_json":"https://pith.science/api/pith-number/4FGJMAAKPQIIBMMFJBCJHO3ROR/events.json","paper":"https://pith.science/paper/4FGJMAAK"},"agent_actions":{"view_html":"https://pith.science/pith/4FGJMAAKPQIIBMMFJBCJHO3ROR","download_json":"https://pith.science/pith/4FGJMAAKPQIIBMMFJBCJHO3ROR.json","view_paper":"https://pith.science/paper/4FGJMAAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2672&json=true","fetch_graph":"https://pith.science/api/pith-number/4FGJMAAKPQIIBMMFJBCJHO3ROR/graph.json","fetch_events":"https://pith.science/api/pith-number/4FGJMAAKPQIIBMMFJBCJHO3ROR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FGJMAAKPQIIBMMFJBCJHO3ROR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FGJMAAKPQIIBMMFJBCJHO3ROR/action/storage_attestation","attest_author":"https://pith.science/pith/4FGJMAAKPQIIBMMFJBCJHO3ROR/action/author_attestation","sign_citation":"https://pith.science/pith/4FGJMAAKPQIIBMMFJBCJHO3ROR/action/citation_signature","submit_replication":"https://pith.science/pith/4FGJMAAKPQIIBMMFJBCJHO3ROR/action/replication_record"}},"created_at":"2026-05-18T03:33:51.233445+00:00","updated_at":"2026-05-18T03:33:51.233445+00:00"}