{"id":"https://openalex.org/W7154404972","doi":"https://doi.org/10.48550/arxiv.2604.09909","title":"Last-Iterate Convergence of Randomized Kaczmarz and SGD with Greedy Step Size","display_name":"Last-Iterate Convergence of Randomized Kaczmarz and SGD with Greedy Step Size","publication_year":2026,"publication_date":"2026-04-10","ids":{"openalex":"https://openalex.org/W7154404972","doi":"https://doi.org/10.48550/arxiv.2604.09909"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.09909","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09909","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.09909","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124661398","display_name":"Micha\u0142 Derezi\u0144ski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Derezi\u0144ski, Micha\u0142","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133569953","display_name":"Xiaoyu Dong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dong, Xiaoyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9611999988555908,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9611999988555908,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.01510000042617321,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.00430000014603138,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6470000147819519},{"id":"https://openalex.org/keywords/interpolation","display_name":"Interpolation (computer graphics)","score":0.5022000074386597},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.44119998812675476},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.4235999882221222},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4090999960899353},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.3643999993801117}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7878000140190125},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6470000147819519},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5468000173568726},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.5022000074386597},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4440000057220459},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.44119998812675476},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.4235999882221222},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4090999960899353},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3643999993801117},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35089999437332153},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.32269999384880066},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C171836373","wikidata":"https://www.wikidata.org/wiki/Q2266329","display_name":"Linear interpolation","level":3,"score":0.2703999876976013}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.09909","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09909","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.09909","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09909","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.43066251277923584}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"last-iterate":[2],"convergence":[3,47],"of":[4,74,86],"SGD":[5],"with":[6],"greedy":[7],"step":[8],"size":[9],"over":[10],"smooth":[11],"quadratics":[12],"in":[13],"the":[14,21,41,68,72,84],"interpolation":[15],"regime,":[16],"a":[17,50,87,96],"setting":[18],"which":[19,92],"captures":[20],"classical":[22],"Randomized":[23],"Kaczmarz":[24],"algorithm":[25],"as":[26,28],"well":[27],"other":[29],"popular":[30],"iterative":[31],"linear":[32],"system":[33],"solvers.":[34],"For":[35],"these":[36],"methods,":[37],"we":[38,70,93],"show":[39],"that":[40],"$t$-th":[42],"iterate":[43],"attains":[44],"an":[45,61],"$O(1/t^{3/4})$":[46],"rate,":[48],"addressing":[49],"question":[51],"posed":[52],"by":[53,83],"Attia,":[54],"Schliserman,":[55],"Sherman,":[56],"and":[57],"Koren,":[58],"who":[59],"gave":[60],"$O(1/t^{1/2})$":[62],"guarantee":[63],"for":[64],"this":[65],"setting.":[66],"In":[67],"proof,":[69],"introduce":[71],"family":[73],"stochastic":[75],"contraction":[76],"processes,":[77],"whose":[78],"behavior":[79],"can":[80],"be":[81],"described":[82],"evolution":[85],"certain":[88],"deterministic":[89],"eigenvalue":[90],"equation,":[91],"analyze":[94],"via":[95],"careful":[97],"discrete-to-continuous":[98],"reduction.":[99]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-15T00:00:00"}