{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M6FCWYQUQVFUE5G4QBKH2O5PYM","short_pith_number":"pith:M6FCWYQU","schema_version":"1.0","canonical_sha256":"678a2b6214854b4274dc80547d3bafc309dffad81ef6a8bf499711887d7f7d87","source":{"kind":"arxiv","id":"1806.04781","version":1},"attestation_state":"computed","paper":{"title":"On the Convergence Rate of Stochastic Mirror Descent for Nonsmooth Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Niao He, Siqi Zhang","submitted_at":"2018-06-12T21:56:48Z","abstract_excerpt":"In this paper, we investigate the non-asymptotic stationary convergence behavior of Stochastic Mirror Descent (SMD) for nonconvex optimization. We focus on a general class of nonconvex nonsmooth stochastic optimization problems, in which the objective can be decomposed into a relatively weakly convex function (possibly non-Lipschitz) and a simple non-smooth convex regularizer. We prove that SMD, without the use of mini-batch, is guaranteed to converge to a stationary point in a convergence rate of $ \\mathcal{O}(1/\\sqrt{t}) $. The efficiency estimate matches with existing results for stochastic"},"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":"1806.04781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-12T21:56:48Z","cross_cats_sorted":[],"title_canon_sha256":"8891c2a2de1e785cca1d245406f1ea0ee898c840a1fe76c3e01f34013b53bb4a","abstract_canon_sha256":"6a845e12c366b00173ccde53fbfba5a26467331611f767f9993e0e82bbc887c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:20.902226Z","signature_b64":"7lhKYgFAfJotQJb9s2qBDvwqopxzuGwz6n8uoSNneHwfZCe94GdEwczguB5vDqZ1iZ0YhPNpJpl/mjxyynaHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"678a2b6214854b4274dc80547d3bafc309dffad81ef6a8bf499711887d7f7d87","last_reissued_at":"2026-05-18T00:13:20.901737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:20.901737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Convergence Rate of Stochastic Mirror Descent for Nonsmooth Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Niao He, Siqi Zhang","submitted_at":"2018-06-12T21:56:48Z","abstract_excerpt":"In this paper, we investigate the non-asymptotic stationary convergence behavior of Stochastic Mirror Descent (SMD) for nonconvex optimization. We focus on a general class of nonconvex nonsmooth stochastic optimization problems, in which the objective can be decomposed into a relatively weakly convex function (possibly non-Lipschitz) and a simple non-smooth convex regularizer. We prove that SMD, without the use of mini-batch, is guaranteed to converge to a stationary point in a convergence rate of $ \\mathcal{O}(1/\\sqrt{t}) $. The efficiency estimate matches with existing results for stochastic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04781","kind":"arxiv","version":1},"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":"1806.04781","created_at":"2026-05-18T00:13:20.901798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04781v1","created_at":"2026-05-18T00:13:20.901798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04781","created_at":"2026-05-18T00:13:20.901798+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6FCWYQUQVFU","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6FCWYQUQVFUE5G4","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6FCWYQU","created_at":"2026-05-18T12:32:37.024351+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/M6FCWYQUQVFUE5G4QBKH2O5PYM","json":"https://pith.science/pith/M6FCWYQUQVFUE5G4QBKH2O5PYM.json","graph_json":"https://pith.science/api/pith-number/M6FCWYQUQVFUE5G4QBKH2O5PYM/graph.json","events_json":"https://pith.science/api/pith-number/M6FCWYQUQVFUE5G4QBKH2O5PYM/events.json","paper":"https://pith.science/paper/M6FCWYQU"},"agent_actions":{"view_html":"https://pith.science/pith/M6FCWYQUQVFUE5G4QBKH2O5PYM","download_json":"https://pith.science/pith/M6FCWYQUQVFUE5G4QBKH2O5PYM.json","view_paper":"https://pith.science/paper/M6FCWYQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04781&json=true","fetch_graph":"https://pith.science/api/pith-number/M6FCWYQUQVFUE5G4QBKH2O5PYM/graph.json","fetch_events":"https://pith.science/api/pith-number/M6FCWYQUQVFUE5G4QBKH2O5PYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6FCWYQUQVFUE5G4QBKH2O5PYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6FCWYQUQVFUE5G4QBKH2O5PYM/action/storage_attestation","attest_author":"https://pith.science/pith/M6FCWYQUQVFUE5G4QBKH2O5PYM/action/author_attestation","sign_citation":"https://pith.science/pith/M6FCWYQUQVFUE5G4QBKH2O5PYM/action/citation_signature","submit_replication":"https://pith.science/pith/M6FCWYQUQVFUE5G4QBKH2O5PYM/action/replication_record"}},"created_at":"2026-05-18T00:13:20.901798+00:00","updated_at":"2026-05-18T00:13:20.901798+00:00"}