{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:42W3RUMPPERD72OI7GJEM6SHTJ","short_pith_number":"pith:42W3RUMP","schema_version":"1.0","canonical_sha256":"e6adb8d18f79223fe9c8f992467a479a6648c66e431ce276a00e5b50e464c23b","source":{"kind":"arxiv","id":"1710.04718","version":3},"attestation_state":"computed","paper":{"title":"\"Relative-Continuity\" for Non-Lipschitz Non-Smooth Convex Optimization using Stochastic (or Deterministic) Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haihao Lu","submitted_at":"2017-10-12T20:56:25Z","abstract_excerpt":"The usual approach to developing and analyzing first-order methods for non-smooth (stochastic or deterministic) convex optimization assumes that the objective function is uniformly Lipschitz continuous with parameter $M_f$. However, in many settings the non-differentiable convex function $f(\\cdot)$ is not uniformly Lipschitz continuous -- for example (i) the classical support vector machine (SVM) problem, (ii) the problem of minimizing the maximum of convex quadratic functions, and even (iii) the univariate setting with $f(x) := \\max\\{0, x\\} + x^2$. Herein we develop a notion of \"relative cont"},"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":"1710.04718","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-12T20:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"c233d01e7d72088fa53529877e30c8c7bc57130302f31fd14fb24d5812a6d2eb","abstract_canon_sha256":"6b51402f3670b71b8d48e75a4169a686647200bc3b68fa28ac4e1b65880b1392"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:15.877440Z","signature_b64":"2WwYMwxkGp2VSXCIYlYg1K3gppX8FX09DS+NwUL+zH2W4lxUhAA5RZAMAFiK89BHqBn0TuSijg7ZxHbbflUhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6adb8d18f79223fe9c8f992467a479a6648c66e431ce276a00e5b50e464c23b","last_reissued_at":"2026-05-18T00:08:15.876937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:15.876937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"\"Relative-Continuity\" for Non-Lipschitz Non-Smooth Convex Optimization using Stochastic (or Deterministic) Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haihao Lu","submitted_at":"2017-10-12T20:56:25Z","abstract_excerpt":"The usual approach to developing and analyzing first-order methods for non-smooth (stochastic or deterministic) convex optimization assumes that the objective function is uniformly Lipschitz continuous with parameter $M_f$. However, in many settings the non-differentiable convex function $f(\\cdot)$ is not uniformly Lipschitz continuous -- for example (i) the classical support vector machine (SVM) problem, (ii) the problem of minimizing the maximum of convex quadratic functions, and even (iii) the univariate setting with $f(x) := \\max\\{0, x\\} + x^2$. Herein we develop a notion of \"relative cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04718","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":"1710.04718","created_at":"2026-05-18T00:08:15.877011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04718v3","created_at":"2026-05-18T00:08:15.877011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04718","created_at":"2026-05-18T00:08:15.877011+00:00"},{"alias_kind":"pith_short_12","alias_value":"42W3RUMPPERD","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"42W3RUMPPERD72OI","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"42W3RUMP","created_at":"2026-05-18T12:30:58.224056+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/42W3RUMPPERD72OI7GJEM6SHTJ","json":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ.json","graph_json":"https://pith.science/api/pith-number/42W3RUMPPERD72OI7GJEM6SHTJ/graph.json","events_json":"https://pith.science/api/pith-number/42W3RUMPPERD72OI7GJEM6SHTJ/events.json","paper":"https://pith.science/paper/42W3RUMP"},"agent_actions":{"view_html":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ","download_json":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ.json","view_paper":"https://pith.science/paper/42W3RUMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04718&json=true","fetch_graph":"https://pith.science/api/pith-number/42W3RUMPPERD72OI7GJEM6SHTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/42W3RUMPPERD72OI7GJEM6SHTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ/action/storage_attestation","attest_author":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ/action/author_attestation","sign_citation":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ/action/citation_signature","submit_replication":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ/action/replication_record"}},"created_at":"2026-05-18T00:08:15.877011+00:00","updated_at":"2026-05-18T00:08:15.877011+00:00"}