{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:65CNNNUS3J6S7SSTWM3YELHANZ","short_pith_number":"pith:65CNNNUS","schema_version":"1.0","canonical_sha256":"f744d6b692da7d2fca53b337822ce06e6a4dcad39c8248ac6362705974dea39d","source":{"kind":"arxiv","id":"1811.09955","version":3},"attestation_state":"computed","paper":{"title":"Online Newton Step Algorithm with Estimated Gradient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Binbin Liu, Huan Liu, Jundong Li, Ling Jian, Xijun Liang, Yunquan Song","submitted_at":"2018-11-25T05:58:57Z","abstract_excerpt":"Online learning with limited information feedback (bandit) tries to solve the problem where an online learner receives partial feedback information from the environment in the course of learning. Under this setting, Flaxman et al.[8] extended Zinkevich's classical Online Gradient Descent (OGD) algorithm [29] by proposing the Online Gradient Descent with Expected Gradient (OGDEG) algorithm. Specifically, it uses a simple trick to approximate the gradient of the loss function $f_t$ by evaluating it at a single point and bounds the expected regret as $\\mathcal{O}(T^{5/6})$ [8], where the number o"},"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":"1811.09955","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-25T05:58:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0baf8e72409c82b03cc0b60ee7454ca2a5d8689fe00dfdd2ec0c521760796028","abstract_canon_sha256":"ae7964ad6d2a89225d0221912890f12bb2ba52332fffd81a41de7f3ec679c67b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:13.989573Z","signature_b64":"Kl+GipjqRl6M41IjCX9k7BhkJax0bs7GXaENLP2glN4P3uFQwRUJR1TStigdCcMArwP3SS6QV4FpsSDveD+UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f744d6b692da7d2fca53b337822ce06e6a4dcad39c8248ac6362705974dea39d","last_reissued_at":"2026-05-17T23:51:13.989038Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:13.989038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Newton Step Algorithm with Estimated Gradient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Binbin Liu, Huan Liu, Jundong Li, Ling Jian, Xijun Liang, Yunquan Song","submitted_at":"2018-11-25T05:58:57Z","abstract_excerpt":"Online learning with limited information feedback (bandit) tries to solve the problem where an online learner receives partial feedback information from the environment in the course of learning. Under this setting, Flaxman et al.[8] extended Zinkevich's classical Online Gradient Descent (OGD) algorithm [29] by proposing the Online Gradient Descent with Expected Gradient (OGDEG) algorithm. Specifically, it uses a simple trick to approximate the gradient of the loss function $f_t$ by evaluating it at a single point and bounds the expected regret as $\\mathcal{O}(T^{5/6})$ [8], where the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09955","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":"1811.09955","created_at":"2026-05-17T23:51:13.989109+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.09955v3","created_at":"2026-05-17T23:51:13.989109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09955","created_at":"2026-05-17T23:51:13.989109+00:00"},{"alias_kind":"pith_short_12","alias_value":"65CNNNUS3J6S","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"65CNNNUS3J6S7SST","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"65CNNNUS","created_at":"2026-05-18T12:32:08.215937+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/65CNNNUS3J6S7SSTWM3YELHANZ","json":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ.json","graph_json":"https://pith.science/api/pith-number/65CNNNUS3J6S7SSTWM3YELHANZ/graph.json","events_json":"https://pith.science/api/pith-number/65CNNNUS3J6S7SSTWM3YELHANZ/events.json","paper":"https://pith.science/paper/65CNNNUS"},"agent_actions":{"view_html":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ","download_json":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ.json","view_paper":"https://pith.science/paper/65CNNNUS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.09955&json=true","fetch_graph":"https://pith.science/api/pith-number/65CNNNUS3J6S7SSTWM3YELHANZ/graph.json","fetch_events":"https://pith.science/api/pith-number/65CNNNUS3J6S7SSTWM3YELHANZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ/action/storage_attestation","attest_author":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ/action/author_attestation","sign_citation":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ/action/citation_signature","submit_replication":"https://pith.science/pith/65CNNNUS3J6S7SSTWM3YELHANZ/action/replication_record"}},"created_at":"2026-05-17T23:51:13.989109+00:00","updated_at":"2026-05-17T23:51:13.989109+00:00"}