{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3TNULGU7SO5GVHZ3TJQK52RLDN","short_pith_number":"pith:3TNULGU7","schema_version":"1.0","canonical_sha256":"dcdb459a9f93ba6a9f3b9a60aeea2b1b4ca9cfb9b4c85a2880e9f1babeead31d","source":{"kind":"arxiv","id":"1410.3118","version":12},"attestation_state":"computed","paper":{"title":"Efficient randomized mirror descents in stochastic online convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Vladimir Spokoiny, Yurii Nesterov","submitted_at":"2014-10-12T17:03:44Z","abstract_excerpt":"In the paper we consider an application of mirror descent (dual averaging) to the stochastic online convex optimization problems. We compare classical mirror descent (Nemirovski-Yudin, 1979) with dual averaging (Nesterov, 2005) and Grigoriadis-Khachiyan algorithm (1995). Grigoriadis-Khachiyan algorithm has just proved to be a randomized mirror descent (dual averaging) with randomization in KL-projection of (sub)gradient to a unit simplex. We found out that this randomization is an optimal way of solving sparse matrix games and some other problems arising in convex optimization and experts weig"},"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":"1410.3118","kind":"arxiv","version":12},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-12T17:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"f37d2e5f7764ea0daaf11d4e6e8095b424e71a112dfdff51cf807c27e3f8ba9a","abstract_canon_sha256":"7a32486af372c184eb0f90c2bf076cbfaf6611c2d447962238b89744813cc1fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:28.897224Z","signature_b64":"aaRh9BSL/oXjYbOFwCliNhF80fbfNIFoe4bVXXiig1cfOIqJNgvJD4kv4oOCV57WGU5abbKQ4eoBUQKzaQs/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcdb459a9f93ba6a9f3b9a60aeea2b1b4ca9cfb9b4c85a2880e9f1babeead31d","last_reissued_at":"2026-05-18T00:55:28.896619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:28.896619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient randomized mirror descents in stochastic online convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Vladimir Spokoiny, Yurii Nesterov","submitted_at":"2014-10-12T17:03:44Z","abstract_excerpt":"In the paper we consider an application of mirror descent (dual averaging) to the stochastic online convex optimization problems. We compare classical mirror descent (Nemirovski-Yudin, 1979) with dual averaging (Nesterov, 2005) and Grigoriadis-Khachiyan algorithm (1995). Grigoriadis-Khachiyan algorithm has just proved to be a randomized mirror descent (dual averaging) with randomization in KL-projection of (sub)gradient to a unit simplex. We found out that this randomization is an optimal way of solving sparse matrix games and some other problems arising in convex optimization and experts weig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3118","kind":"arxiv","version":12},"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":"1410.3118","created_at":"2026-05-18T00:55:28.896737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3118v12","created_at":"2026-05-18T00:55:28.896737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3118","created_at":"2026-05-18T00:55:28.896737+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TNULGU7SO5G","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TNULGU7SO5GVHZ3","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TNULGU7","created_at":"2026-05-18T12:28:11.866339+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/3TNULGU7SO5GVHZ3TJQK52RLDN","json":"https://pith.science/pith/3TNULGU7SO5GVHZ3TJQK52RLDN.json","graph_json":"https://pith.science/api/pith-number/3TNULGU7SO5GVHZ3TJQK52RLDN/graph.json","events_json":"https://pith.science/api/pith-number/3TNULGU7SO5GVHZ3TJQK52RLDN/events.json","paper":"https://pith.science/paper/3TNULGU7"},"agent_actions":{"view_html":"https://pith.science/pith/3TNULGU7SO5GVHZ3TJQK52RLDN","download_json":"https://pith.science/pith/3TNULGU7SO5GVHZ3TJQK52RLDN.json","view_paper":"https://pith.science/paper/3TNULGU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3118&json=true","fetch_graph":"https://pith.science/api/pith-number/3TNULGU7SO5GVHZ3TJQK52RLDN/graph.json","fetch_events":"https://pith.science/api/pith-number/3TNULGU7SO5GVHZ3TJQK52RLDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TNULGU7SO5GVHZ3TJQK52RLDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TNULGU7SO5GVHZ3TJQK52RLDN/action/storage_attestation","attest_author":"https://pith.science/pith/3TNULGU7SO5GVHZ3TJQK52RLDN/action/author_attestation","sign_citation":"https://pith.science/pith/3TNULGU7SO5GVHZ3TJQK52RLDN/action/citation_signature","submit_replication":"https://pith.science/pith/3TNULGU7SO5GVHZ3TJQK52RLDN/action/replication_record"}},"created_at":"2026-05-18T00:55:28.896737+00:00","updated_at":"2026-05-18T00:55:28.896737+00:00"}