{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RJGEPEG7XE4T6JRYRIQ7ID2I4W","short_pith_number":"pith:RJGEPEG7","schema_version":"1.0","canonical_sha256":"8a4c4790dfb9393f26388a21f40f48e58f27ee7681dd1e83e92e24bb4767cf34","source":{"kind":"arxiv","id":"2102.06622","version":2},"attestation_state":"computed","paper":{"title":"MetaGrad: Adaptation using Multiple Learning Rates in Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dirk van der Hoeven, Tim van Erven, Wouter M. Koolen","submitted_at":"2021-02-12T17:01:35Z","abstract_excerpt":"We provide a new adaptive method for online convex optimization, MetaGrad, that is robust to general convex losses but achieves faster rates for a broad class of special functions, including exp-concave and strongly convex functions, but also various types of stochastic and non-stochastic functions without any curvature. We prove this by drawing a connection to the Bernstein condition, which is known to imply fast rates in offline statistical learning. MetaGrad further adapts automatically to the size of the gradients. Its main feature is that it simultaneously considers multiple learning rate"},"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":"2102.06622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-12T17:01:35Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1d789d2df2f4ca5691e7ca60a1e66ea8ee168e44f85d79fb7bbfe552dc5c6c93","abstract_canon_sha256":"28ba10297510710b4ab1790a8d9986a68a32848787f88c8c89a013aeefc1e9e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:09:44.254976Z","signature_b64":"xKHskVqQCcFmdaQmpobWSP+1zH+H9SkNMHXreebitw7gKgLkBiODhPBrG2J5YtECCSM8klC+u/VycFxLmjOxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a4c4790dfb9393f26388a21f40f48e58f27ee7681dd1e83e92e24bb4767cf34","last_reissued_at":"2026-07-05T03:09:44.254459Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:09:44.254459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MetaGrad: Adaptation using Multiple Learning Rates in Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dirk van der Hoeven, Tim van Erven, Wouter M. Koolen","submitted_at":"2021-02-12T17:01:35Z","abstract_excerpt":"We provide a new adaptive method for online convex optimization, MetaGrad, that is robust to general convex losses but achieves faster rates for a broad class of special functions, including exp-concave and strongly convex functions, but also various types of stochastic and non-stochastic functions without any curvature. We prove this by drawing a connection to the Bernstein condition, which is known to imply fast rates in offline statistical learning. MetaGrad further adapts automatically to the size of the gradients. Its main feature is that it simultaneously considers multiple learning rate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06622","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/2102.06622/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":"2102.06622","created_at":"2026-07-05T03:09:44.254514+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.06622v2","created_at":"2026-07-05T03:09:44.254514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06622","created_at":"2026-07-05T03:09:44.254514+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJGEPEG7XE4T","created_at":"2026-07-05T03:09:44.254514+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJGEPEG7XE4T6JRY","created_at":"2026-07-05T03:09:44.254514+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJGEPEG7","created_at":"2026-07-05T03:09:44.254514+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.15217","citing_title":"Contribution of expert aggregation to temperature prediction part i","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RJGEPEG7XE4T6JRYRIQ7ID2I4W","json":"https://pith.science/pith/RJGEPEG7XE4T6JRYRIQ7ID2I4W.json","graph_json":"https://pith.science/api/pith-number/RJGEPEG7XE4T6JRYRIQ7ID2I4W/graph.json","events_json":"https://pith.science/api/pith-number/RJGEPEG7XE4T6JRYRIQ7ID2I4W/events.json","paper":"https://pith.science/paper/RJGEPEG7"},"agent_actions":{"view_html":"https://pith.science/pith/RJGEPEG7XE4T6JRYRIQ7ID2I4W","download_json":"https://pith.science/pith/RJGEPEG7XE4T6JRYRIQ7ID2I4W.json","view_paper":"https://pith.science/paper/RJGEPEG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.06622&json=true","fetch_graph":"https://pith.science/api/pith-number/RJGEPEG7XE4T6JRYRIQ7ID2I4W/graph.json","fetch_events":"https://pith.science/api/pith-number/RJGEPEG7XE4T6JRYRIQ7ID2I4W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJGEPEG7XE4T6JRYRIQ7ID2I4W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJGEPEG7XE4T6JRYRIQ7ID2I4W/action/storage_attestation","attest_author":"https://pith.science/pith/RJGEPEG7XE4T6JRYRIQ7ID2I4W/action/author_attestation","sign_citation":"https://pith.science/pith/RJGEPEG7XE4T6JRYRIQ7ID2I4W/action/citation_signature","submit_replication":"https://pith.science/pith/RJGEPEG7XE4T6JRYRIQ7ID2I4W/action/replication_record"}},"created_at":"2026-07-05T03:09:44.254514+00:00","updated_at":"2026-07-05T03:09:44.254514+00:00"}