{"id":"https://openalex.org/W7127955665","doi":"https://doi.org/10.48550/arxiv.2602.04396","title":"LoRDO: Distributed Low-Rank Optimization with Infrequent Communication","display_name":"LoRDO: Distributed Low-Rank Optimization with Infrequent Communication","publication_year":2026,"publication_date":"2026-02-04","ids":{"openalex":"https://openalex.org/W7127955665","doi":"https://doi.org/10.48550/arxiv.2602.04396"},"language":"en","primary_location":{"id":"pmh:oai:eprints.lancs.ac.uk:238030","is_oa":true,"landing_page_url":null,"pdf_url":"https://eprints.lancs.ac.uk/id/eprint/238030/1/2602.04396v1.pdf","source":{"id":"https://openalex.org/S4306401916","display_name":"Lancaster EPrints (Lancaster University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67415387","host_organization_name":"Lancaster University","host_organization_lineage":["https://openalex.org/I67415387"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Monograph"},"type":"book","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://eprints.lancs.ac.uk/id/eprint/238030/1/2602.04396v1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jovanovi\u0107, Andrej","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jovanovi\u0107, Andrej","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086333889","display_name":"Alex Iacob","orcid":"https://orcid.org/0009-0006-8293-5628"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iacob, Alex","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037126089","display_name":"Mher Safaryan","orcid":"https://orcid.org/0000-0001-6290-1398"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Safaryan, Mher","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019107294","display_name":"Ionu\u021b-Vlad Modoranu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Modoranu, Ionut-Vlad","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036418545","display_name":"Lorenzo Sani","orcid":"https://orcid.org/0000-0002-6474-4696"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sani, Lorenzo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125127176","display_name":"William F. Shen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shen, William F.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040821950","display_name":"Xinchi Qiu","orcid":"https://orcid.org/0000-0002-7654-4448"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qiu, Xinchi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120504470","display_name":"Dan Alistarh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alistarh, Dan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5026859250","display_name":"Nicholas D. Lane","orcid":"https://orcid.org/0000-0002-9954-6366"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lane, Nicholas D.","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":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0470173,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.8331999778747559,"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.8331999778747559,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.09200000017881393,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.037700001150369644,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.6628000140190125},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.445499986410141},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.3961000144481659},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.3921999931335449},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3912999927997589},{"id":"https://openalex.org/keywords/interconnection","display_name":"Interconnection","score":0.3709000051021576},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.35370001196861267},{"id":"https://openalex.org/keywords/communications-protocol","display_name":"Communications protocol","score":0.3312000036239624},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.32760000228881836}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7524999976158142},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.6628000140190125},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5336999893188477},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.445499986410141},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.3961000144481659},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.3921999931335449},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3912999927997589},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.3709000051021576},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.35370001196861267},{"id":"https://openalex.org/C12269588","wikidata":"https://www.wikidata.org/wiki/Q132364","display_name":"Communications protocol","level":2,"score":0.3312000036239624},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3206000030040741},{"id":"https://openalex.org/C2779582901","wikidata":"https://www.wikidata.org/wiki/Q21013010","display_name":"Distributed learning","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3001999855041504},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2953999936580658},{"id":"https://openalex.org/C158156997","wikidata":"https://www.wikidata.org/wiki/Q1416645","display_name":"Models of communication","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C2776207758","wikidata":"https://www.wikidata.org/wiki/Q5303302","display_name":"Downstream (manufacturing)","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C101765175","wikidata":"https://www.wikidata.org/wiki/Q577764","display_name":"Communications system","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.2614000141620636},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:eprints.lancs.ac.uk:238030","is_oa":true,"landing_page_url":null,"pdf_url":"https://eprints.lancs.ac.uk/id/eprint/238030/1/2602.04396v1.pdf","source":{"id":"https://openalex.org/S4306401916","display_name":"Lancaster EPrints (Lancaster University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67415387","host_organization_name":"Lancaster University","host_organization_lineage":["https://openalex.org/I67415387"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Monograph"},{"id":"doi:10.48550/arxiv.2602.04396","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.04396","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:eprints.lancs.ac.uk:238030","is_oa":true,"landing_page_url":null,"pdf_url":"https://eprints.lancs.ac.uk/id/eprint/238030/1/2602.04396v1.pdf","source":{"id":"https://openalex.org/S4306401916","display_name":"Lancaster EPrints (Lancaster University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67415387","host_organization_name":"Lancaster University","host_organization_lineage":["https://openalex.org/I67415387"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Monograph"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320005","display_name":"Royal Academy of Engineering","ror":"https://ror.org/0526snb40"},{"id":"https://openalex.org/F4320336061","display_name":"Research England","ror":"https://ror.org/02wxr8x18"},{"id":"https://openalex.org/F4320337380","display_name":"Division of Mathematical Sciences","ror":"https://ror.org/051fftw81"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7127955665.pdf","grobid_xml":"https://content.openalex.org/works/W7127955665.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Distributed":[0],"training":[1],"of":[2,28,117],"foundation":[3],"models":[4],"via":[5],"$\\texttt{DDP}$":[6,107],"is":[7],"limited":[8],"by":[9,22,122],"interconnect":[10],"bandwidth.":[11],"While":[12],"infrequent":[13,67],"communication":[14,26,121],"strategies":[15],"reduce":[16],"synchronization":[17],"frequency,":[18],"they":[19,82],"remain":[20],"bottlenecked":[21],"the":[23,39,46,85],"memory":[24],"and":[25,111],"requirements":[27],"optimizer":[29],"states.":[30],"Low-rank":[31],"optimizers":[32],"can":[33],"alleviate":[34],"these":[35],"constraints;":[36],"however,":[37],"in":[38,108,135],"local-update":[40],"regime,":[41],"workers":[42],"lack":[43],"access":[44],"to":[45,50,88],"full-batch":[47],"gradients":[48],"required":[49],"compute":[51],"low-rank":[52,64,90,106],"projections,":[53],"which":[54],"degrades":[55],"performance.":[56],"We":[57,69],"propose":[58],"$\\texttt{LoRDO}$,":[59],"a":[60,89,98],"principled":[61],"framework":[62],"unifying":[63],"optimization":[65,86],"with":[66,105,139],"synchronization.":[68],"first":[70],"demonstrate":[71],"that,":[72],"while":[73,119],"global":[74],"projections":[75],"based":[76],"on":[77],"pseudo-gradients":[78],"are":[79],"theoretically":[80],"superior,":[81],"permanently":[83],"restrict":[84],"trajectory":[87],"subspace.":[91],"To":[92],"restore":[93],"subspace":[94],"exploration,":[95],"we":[96,127],"introduce":[97],"full-rank":[99],"quasi-hyperbolic":[100],"update.":[101],"$\\texttt{LoRDO}$":[102,130],"achieves":[103],"near-parity":[104],"language":[109],"modeling":[110],"downstream":[112],"tasks":[113],"at":[114],"model":[115],"scales":[116],"$125$M--$720$M,":[118],"reducing":[120],"$\\approx":[123],"10":[124],"\\times$.":[125],"Finally,":[126],"show":[128],"that":[129],"improves":[131],"performance":[132],"even":[133],"more":[134],"very":[136],"low-memory":[137],"settings":[138],"small":[140],"rank/batch":[141],"size.":[142]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-07T00:00:00"}