{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MA3FEWI2WKLG3TB6DCXQEXRY7D","short_pith_number":"pith:MA3FEWI2","schema_version":"1.0","canonical_sha256":"603652591ab2966dcc3e18af025e38f8c3d18e69016720fba981776c45746711","source":{"kind":"arxiv","id":"1508.05170","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Dylan J. Foster, Karthik Sridharan","submitted_at":"2015-08-21T03:44:43Z","abstract_excerpt":"We propose a general framework for studying adaptive regret bounds in the online learning framework, including model selection bounds and data-dependent bounds. Given a data- or model-dependent bound we ask, \"Does there exist some algorithm achieving this bound?\" We show that modifications to recently introduced sequential complexity measures can be used to answer this question by providing sufficient conditions under which adaptive rates can be achieved. In particular each adaptive rate induces a set of so-called offset complexity measures, and obtaining small upper bounds on these quantities"},"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":"1508.05170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-21T03:44:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5e81acfcd8585bc77e801b1d370c009f68b576064dd74354c5d7ec3dba78bae5","abstract_canon_sha256":"ab8384fe03e451fd02c687e1c75dc2614586cc6d4d0b7bf4bd90e08c04ec0724"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:21.965653Z","signature_b64":"tYF3RUxt2CvFF4trSqDScIpgSV3w5yuMeg6IyR4q6ody4FyxXEPqh8DsRveBk++5fbekEUYZTQ0H1wfBQ209Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"603652591ab2966dcc3e18af025e38f8c3d18e69016720fba981776c45746711","last_reissued_at":"2026-07-05T00:40:21.965164Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:21.965164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Dylan J. Foster, Karthik Sridharan","submitted_at":"2015-08-21T03:44:43Z","abstract_excerpt":"We propose a general framework for studying adaptive regret bounds in the online learning framework, including model selection bounds and data-dependent bounds. Given a data- or model-dependent bound we ask, \"Does there exist some algorithm achieving this bound?\" We show that modifications to recently introduced sequential complexity measures can be used to answer this question by providing sufficient conditions under which adaptive rates can be achieved. In particular each adaptive rate induces a set of so-called offset complexity measures, and obtaining small upper bounds on these quantities"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05170","kind":"arxiv","version":2},"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/1508.05170/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":"1508.05170","created_at":"2026-07-05T00:40:21.965227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05170v2","created_at":"2026-07-05T00:40:21.965227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05170","created_at":"2026-07-05T00:40:21.965227+00:00"},{"alias_kind":"pith_short_12","alias_value":"MA3FEWI2WKLG","created_at":"2026-07-05T00:40:21.965227+00:00"},{"alias_kind":"pith_short_16","alias_value":"MA3FEWI2WKLG3TB6","created_at":"2026-07-05T00:40:21.965227+00:00"},{"alias_kind":"pith_short_8","alias_value":"MA3FEWI2","created_at":"2026-07-05T00:40:21.965227+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/MA3FEWI2WKLG3TB6DCXQEXRY7D","json":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D.json","graph_json":"https://pith.science/api/pith-number/MA3FEWI2WKLG3TB6DCXQEXRY7D/graph.json","events_json":"https://pith.science/api/pith-number/MA3FEWI2WKLG3TB6DCXQEXRY7D/events.json","paper":"https://pith.science/paper/MA3FEWI2"},"agent_actions":{"view_html":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D","download_json":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D.json","view_paper":"https://pith.science/paper/MA3FEWI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05170&json=true","fetch_graph":"https://pith.science/api/pith-number/MA3FEWI2WKLG3TB6DCXQEXRY7D/graph.json","fetch_events":"https://pith.science/api/pith-number/MA3FEWI2WKLG3TB6DCXQEXRY7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D/action/storage_attestation","attest_author":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D/action/author_attestation","sign_citation":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D/action/citation_signature","submit_replication":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D/action/replication_record"}},"created_at":"2026-07-05T00:40:21.965227+00:00","updated_at":"2026-07-05T00:40:21.965227+00:00"}