{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4HHNHEPCNSGYTVDPN5JCR6FKRV","short_pith_number":"pith:4HHNHEPC","schema_version":"1.0","canonical_sha256":"e1ced391e26c8d89d46f6f5228f8aa8d5fd1a3ceda650c8aeb29048bc0c21642","source":{"kind":"arxiv","id":"1403.3465","version":3},"attestation_state":"computed","paper":{"title":"A Survey of Algorithms and Analysis for Adaptive Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"H. Brendan McMahan","submitted_at":"2014-03-14T00:25:03Z","abstract_excerpt":"We present tools for the analysis of Follow-The-Regularized-Leader (FTRL), Dual Averaging, and Mirror Descent algorithms when the regularizer (equivalently, prox-function or learning rate schedule) is chosen adaptively based on the data. Adaptivity can be used to prove regret bounds that hold on every round, and also allows for data-dependent regret bounds as in AdaGrad-style algorithms (e.g., Online Gradient Descent with adaptive per-coordinate learning rates). We present results from a large number of prior works in a unified manner, using a modular and tight analysis that isolates the key a"},"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.3465","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-14T00:25:03Z","cross_cats_sorted":[],"title_canon_sha256":"4b99a2706d4092833247550b2433ad2cf33e040c8105ad982caa9641294d7abc","abstract_canon_sha256":"aaaa73454bcad2b591d0e76340df2d0c548bf5d20a1c5fb28cfef36508707660"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:36.931159Z","signature_b64":"3fbA5isTNJR3bOL5a9f1CZwim3QwXNhA26ch+FDG2X4LX6cQyt+0CB4p5D8VWkwwPn4XmIG3OsHA7cXnViLQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1ced391e26c8d89d46f6f5228f8aa8d5fd1a3ceda650c8aeb29048bc0c21642","last_reissued_at":"2026-05-18T01:27:36.930531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:36.930531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey of Algorithms and Analysis for Adaptive Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"H. Brendan McMahan","submitted_at":"2014-03-14T00:25:03Z","abstract_excerpt":"We present tools for the analysis of Follow-The-Regularized-Leader (FTRL), Dual Averaging, and Mirror Descent algorithms when the regularizer (equivalently, prox-function or learning rate schedule) is chosen adaptively based on the data. Adaptivity can be used to prove regret bounds that hold on every round, and also allows for data-dependent regret bounds as in AdaGrad-style algorithms (e.g., Online Gradient Descent with adaptive per-coordinate learning rates). We present results from a large number of prior works in a unified manner, using a modular and tight analysis that isolates the key a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3465","kind":"arxiv","version":3},"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.3465","created_at":"2026-05-18T01:27:36.930630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3465v3","created_at":"2026-05-18T01:27:36.930630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3465","created_at":"2026-05-18T01:27:36.930630+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HHNHEPCNSGY","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HHNHEPCNSGYTVDP","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HHNHEPC","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.16697","citing_title":"QueryBandits for Hallucination Mitigation: Exploiting Semantic Features for No-Regret Rewriting","ref_index":71,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4HHNHEPCNSGYTVDPN5JCR6FKRV","json":"https://pith.science/pith/4HHNHEPCNSGYTVDPN5JCR6FKRV.json","graph_json":"https://pith.science/api/pith-number/4HHNHEPCNSGYTVDPN5JCR6FKRV/graph.json","events_json":"https://pith.science/api/pith-number/4HHNHEPCNSGYTVDPN5JCR6FKRV/events.json","paper":"https://pith.science/paper/4HHNHEPC"},"agent_actions":{"view_html":"https://pith.science/pith/4HHNHEPCNSGYTVDPN5JCR6FKRV","download_json":"https://pith.science/pith/4HHNHEPCNSGYTVDPN5JCR6FKRV.json","view_paper":"https://pith.science/paper/4HHNHEPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3465&json=true","fetch_graph":"https://pith.science/api/pith-number/4HHNHEPCNSGYTVDPN5JCR6FKRV/graph.json","fetch_events":"https://pith.science/api/pith-number/4HHNHEPCNSGYTVDPN5JCR6FKRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HHNHEPCNSGYTVDPN5JCR6FKRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HHNHEPCNSGYTVDPN5JCR6FKRV/action/storage_attestation","attest_author":"https://pith.science/pith/4HHNHEPCNSGYTVDPN5JCR6FKRV/action/author_attestation","sign_citation":"https://pith.science/pith/4HHNHEPCNSGYTVDPN5JCR6FKRV/action/citation_signature","submit_replication":"https://pith.science/pith/4HHNHEPCNSGYTVDPN5JCR6FKRV/action/replication_record"}},"created_at":"2026-05-18T01:27:36.930630+00:00","updated_at":"2026-05-18T01:27:36.930630+00:00"}