{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FACUYPAAI4NLRQGJZJTZHTWZAU","short_pith_number":"pith:FACUYPAA","schema_version":"1.0","canonical_sha256":"28054c3c00471ab8c0c9ca6793ced9050879ff6789f081359e27e333bf27a4c5","source":{"kind":"arxiv","id":"1812.10186","version":3},"attestation_state":"computed","paper":{"title":"Dynamic Online Gradient Descent with Improved Query Complexity: A Theoretical Revisit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"En Zhu, Jianping Yin, Xinwang Liu, Yawei Zhao","submitted_at":"2018-12-26T00:28:27Z","abstract_excerpt":"We provide a new theoretical analysis framework to investigate online gradient descent in the dynamic environment. Comparing with the previous work, the new framework recovers the state-of-the-art dynamic regret, but does not require extra gradient queries for every iteration. Specifically, when functions are $\\alpha$ strongly convex and $\\beta$ smooth, to achieve the state-of-the-art dynamic regret, the previous work requires $O(\\kappa)$ with $\\kappa = \\frac{\\beta}{\\alpha}$ queries of gradients at every iteration. But, our framework shows that the query complexity can be improved to be $O(1)$"},"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":"1812.10186","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-26T00:28:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"057fcdd723652e0a7d18cb239f7f302f58e1f1e0673cb2ed2d4e6da2b4ade994","abstract_canon_sha256":"1c310f49754cc7d33ee98ad846aaf5640c6f5078bdf59e6d44d19155cecc2084"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:40.611909Z","signature_b64":"UHueHXIO83CKs3knDDban1Z/iEZ9gCrDE6/QYmpqeXc9L7a5eecn9snM+Uhakv482O8xm6m2JAC0c8dMK2YNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28054c3c00471ab8c0c9ca6793ced9050879ff6789f081359e27e333bf27a4c5","last_reissued_at":"2026-05-17T23:56:40.611262Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:40.611262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Online Gradient Descent with Improved Query Complexity: A Theoretical Revisit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"En Zhu, Jianping Yin, Xinwang Liu, Yawei Zhao","submitted_at":"2018-12-26T00:28:27Z","abstract_excerpt":"We provide a new theoretical analysis framework to investigate online gradient descent in the dynamic environment. Comparing with the previous work, the new framework recovers the state-of-the-art dynamic regret, but does not require extra gradient queries for every iteration. Specifically, when functions are $\\alpha$ strongly convex and $\\beta$ smooth, to achieve the state-of-the-art dynamic regret, the previous work requires $O(\\kappa)$ with $\\kappa = \\frac{\\beta}{\\alpha}$ queries of gradients at every iteration. But, our framework shows that the query complexity can be improved to be $O(1)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10186","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":"1812.10186","created_at":"2026-05-17T23:56:40.611382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10186v3","created_at":"2026-05-17T23:56:40.611382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10186","created_at":"2026-05-17T23:56:40.611382+00:00"},{"alias_kind":"pith_short_12","alias_value":"FACUYPAAI4NL","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FACUYPAAI4NLRQGJ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FACUYPAA","created_at":"2026-05-18T12:32:22.470017+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/FACUYPAAI4NLRQGJZJTZHTWZAU","json":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU.json","graph_json":"https://pith.science/api/pith-number/FACUYPAAI4NLRQGJZJTZHTWZAU/graph.json","events_json":"https://pith.science/api/pith-number/FACUYPAAI4NLRQGJZJTZHTWZAU/events.json","paper":"https://pith.science/paper/FACUYPAA"},"agent_actions":{"view_html":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU","download_json":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU.json","view_paper":"https://pith.science/paper/FACUYPAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10186&json=true","fetch_graph":"https://pith.science/api/pith-number/FACUYPAAI4NLRQGJZJTZHTWZAU/graph.json","fetch_events":"https://pith.science/api/pith-number/FACUYPAAI4NLRQGJZJTZHTWZAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU/action/storage_attestation","attest_author":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU/action/author_attestation","sign_citation":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU/action/citation_signature","submit_replication":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU/action/replication_record"}},"created_at":"2026-05-17T23:56:40.611382+00:00","updated_at":"2026-05-17T23:56:40.611382+00:00"}