{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:REHYKA5SIRBEWP42FHEL4QAYDO","short_pith_number":"pith:REHYKA5S","schema_version":"1.0","canonical_sha256":"890f8503b244424b3f9a29c8be40181bb0293d6d4b6359e3b59367b987ff719a","source":{"kind":"arxiv","id":"1803.07374","version":1},"attestation_state":"computed","paper":{"title":"Fastest Rates for Stochastic Mirror Descent Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Filip Hanzely, Peter Richt\\'arik","submitted_at":"2018-03-20T11:27:01Z","abstract_excerpt":"Relative smoothness - a notion introduced by Birnbaum et al. (2011) and rediscovered by Bauschke et al. (2016) and Lu et al. (2016) - generalizes the standard notion of smoothness typically used in the analysis of gradient type methods. In this work we are taking ideas from well studied field of stochastic convex optimization and using them in order to obtain faster algorithms for minimizing relatively smooth functions. We propose and analyze two new algorithms: Relative Randomized Coordinate Descent (relRCD) and Relative Stochastic Gradient Descent (relSGD), both generalizing famous algorithm"},"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":"1803.07374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-20T11:27:01Z","cross_cats_sorted":["cs.CC","cs.NA","math.NA"],"title_canon_sha256":"31002c689665cbcdec0f722970894027b76ff50466ee19a445a7ed10e46a74e9","abstract_canon_sha256":"02624a5200ac3a28963c66ea5a07faba3200f821f47d348952ac606d73cf5877"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:22.688368Z","signature_b64":"3hQgbxPlsql8QztwaDhLNtuuk2BOn7DMeOfhGpcuuNSJHk66KWmbbB/0MvLRLl7hjlr7/dJTyxDCwbcDpnnNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"890f8503b244424b3f9a29c8be40181bb0293d6d4b6359e3b59367b987ff719a","last_reissued_at":"2026-05-18T00:20:22.687759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:22.687759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fastest Rates for Stochastic Mirror Descent Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Filip Hanzely, Peter Richt\\'arik","submitted_at":"2018-03-20T11:27:01Z","abstract_excerpt":"Relative smoothness - a notion introduced by Birnbaum et al. (2011) and rediscovered by Bauschke et al. (2016) and Lu et al. (2016) - generalizes the standard notion of smoothness typically used in the analysis of gradient type methods. In this work we are taking ideas from well studied field of stochastic convex optimization and using them in order to obtain faster algorithms for minimizing relatively smooth functions. We propose and analyze two new algorithms: Relative Randomized Coordinate Descent (relRCD) and Relative Stochastic Gradient Descent (relSGD), both generalizing famous algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07374","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":"1803.07374","created_at":"2026-05-18T00:20:22.687869+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.07374v1","created_at":"2026-05-18T00:20:22.687869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07374","created_at":"2026-05-18T00:20:22.687869+00:00"},{"alias_kind":"pith_short_12","alias_value":"REHYKA5SIRBE","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"REHYKA5SIRBEWP42","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"REHYKA5S","created_at":"2026-05-18T12:32:50.500415+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/REHYKA5SIRBEWP42FHEL4QAYDO","json":"https://pith.science/pith/REHYKA5SIRBEWP42FHEL4QAYDO.json","graph_json":"https://pith.science/api/pith-number/REHYKA5SIRBEWP42FHEL4QAYDO/graph.json","events_json":"https://pith.science/api/pith-number/REHYKA5SIRBEWP42FHEL4QAYDO/events.json","paper":"https://pith.science/paper/REHYKA5S"},"agent_actions":{"view_html":"https://pith.science/pith/REHYKA5SIRBEWP42FHEL4QAYDO","download_json":"https://pith.science/pith/REHYKA5SIRBEWP42FHEL4QAYDO.json","view_paper":"https://pith.science/paper/REHYKA5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.07374&json=true","fetch_graph":"https://pith.science/api/pith-number/REHYKA5SIRBEWP42FHEL4QAYDO/graph.json","fetch_events":"https://pith.science/api/pith-number/REHYKA5SIRBEWP42FHEL4QAYDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REHYKA5SIRBEWP42FHEL4QAYDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REHYKA5SIRBEWP42FHEL4QAYDO/action/storage_attestation","attest_author":"https://pith.science/pith/REHYKA5SIRBEWP42FHEL4QAYDO/action/author_attestation","sign_citation":"https://pith.science/pith/REHYKA5SIRBEWP42FHEL4QAYDO/action/citation_signature","submit_replication":"https://pith.science/pith/REHYKA5SIRBEWP42FHEL4QAYDO/action/replication_record"}},"created_at":"2026-05-18T00:20:22.687869+00:00","updated_at":"2026-05-18T00:20:22.687869+00:00"}