{"id":"https://openalex.org/W7127290578","doi":"https://doi.org/10.48550/arxiv.2602.01372","title":"Robust Sublinear Convergence Rates for Iterative Bregman Projections","display_name":"Robust Sublinear Convergence Rates for Iterative Bregman Projections","publication_year":2026,"publication_date":"2026-02-01","ids":{"openalex":"https://openalex.org/W7127290578","doi":"https://doi.org/10.48550/arxiv.2602.01372"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.01372","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124879465","display_name":"Gabriel Peyr\u00e9","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peyr\u00e9, Gabriel","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5124879465"],"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.7121999859809875,"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.7121999859809875,"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/T10229","display_name":"Geometric Analysis and Curvature Flows","score":0.06679999828338623,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.05550000071525574,"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/sublinear-function","display_name":"Sublinear function","score":0.7681000232696533},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5070000290870667},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.4828000068664551},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4699999988079071},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.38749998807907104},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.3856000006198883},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.37209999561309814},{"id":"https://openalex.org/keywords/orthant","display_name":"Orthant","score":0.36970001459121704}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7681000232696533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7508999705314636},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5070000290870667},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.4828000068664551},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4699999988079071},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4219000041484833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4049000144004822},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.38749998807907104},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3856000006198883},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.37209999561309814},{"id":"https://openalex.org/C2780016784","wikidata":"https://www.wikidata.org/wiki/Q2714507","display_name":"Orthant","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.321399986743927},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.31540000438690186},{"id":"https://openalex.org/C149073432","wikidata":"https://www.wikidata.org/wiki/Q4960382","display_name":"Bregman divergence","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.29899999499320984},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.2752000093460083}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.01372","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.01372","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.01372","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.01372","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Entropic":[0],"regularization":[1,85],"provides":[2],"a":[3,72,151],"simple":[4],"way":[5],"to":[6,24,96,150],"approximate":[7],"linear":[8],"programs":[9],"whose":[10],"constraints":[11],"split":[12,162],"into":[13,166],"two":[14],"(or":[15],"more)":[16],"tractable":[17],"blocks.":[18,167],"The":[19,135],"resulting":[20],"objectives":[21],"are":[22],"amenable":[23],"cyclic":[25],"Kullback-Leibler":[26],"(KL)":[27],"Bregman":[28],"projections,":[29],"with":[30,71],"the":[31,45,59,83,89,103,128,139,143,158,161,164,173,177,187,197],"classical":[32],"Sinkhorn":[33],"algorithm":[34,175],"for":[35,92,126,176],"optimal":[36,94],"transport":[37,95],"(balanced,":[38],"unbalanced,":[39],"gradient":[40],"flows,":[41],"barycenters,":[42],"\\dots)":[43],"as":[44],"canonical":[46],"example.":[47],"Assuming":[48],"uniformly":[49],"bounded":[50],"primal":[51],"mass":[52],"and":[53],"dual":[54,60,144,153],"radius,":[55],"we":[56,111,171],"prove":[57],"that":[58,74,142],"objective":[61],"of":[62,138,160,163,199],"these":[63],"KL":[64,133],"projections":[65],"decreases":[66],"at":[67],"an":[68,169],"$O(1/k)$":[69],"rate":[70],"constant":[73],"scales":[75],"only":[76],"linearly":[77,99],"in":[78,106,190],"$1/\u03b3$,":[79],"where":[80,194],"$\u03b3$":[81,121],"is":[82,141,196],"entropic":[84,93],"parameter.":[86],"This":[87],"extends":[88],"guarantees":[90],"known":[91],"any":[97],"such":[98,113],"constrained":[100],"problem.":[101],"Following":[102],"terminology":[104],"introduced":[105],"[Chizat":[107],"et":[108],"al":[109],"2025],":[110],"call":[112],"rates":[114],"\"robust\",":[115],"because":[116],"this":[117],"mild":[118],"dependence":[119],"on":[120,157,180,186],"underpins":[122],"favorable":[123],"complexity":[124],"bounds":[125],"approximating":[127],"unregularized":[129],"problem":[130],"via":[131],"alternating":[132],"projections.":[134],"crucial":[136],"aspect":[137],"analysis":[140],"radius":[145],"should":[146],"be":[147],"measured":[148],"according":[149],"block-quotient":[152],"seminorm,":[154],"which":[155],"depends":[156],"structure":[159],"constraint":[165],"As":[168],"application,":[170],"derive":[172],"flow-Sinkhorn":[174],"Wasserstein-1":[178],"distance":[179],"graphs.":[181],"It":[182],"achieves":[183],"$\u03b5$-additive":[184],"accuracy":[185],"transshipment":[188],"cost":[189],"$O(p/\u03b5^{4})$":[191],"arithmetic":[192],"operations,":[193],"$p$":[195],"number":[198],"edges.":[200]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-04T00:00:00"}