{"id":"https://openalex.org/W4416967190","doi":"https://doi.org/10.48550/arxiv.2512.01732","title":"Beyond Scaffold: A Unified Spatio-Temporal Gradient Tracking Method","display_name":"Beyond Scaffold: A Unified Spatio-Temporal Gradient Tracking Method","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W4416967190","doi":"https://doi.org/10.48550/arxiv.2512.01732"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2512.01732","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.01732","pdf_url":"https://arxiv.org/pdf/2512.01732","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2512.01732","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100764456","display_name":"Yan Huang","orcid":"https://orcid.org/0000-0002-0575-0156"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Huang, Yan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016660429","display_name":"Jinming Xu","orcid":"https://orcid.org/0000-0003-3250-963X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Jinming","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100726036","display_name":"Jiming Chen","orcid":"https://orcid.org/0000-0001-7993-3193"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Jiming","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5045975901","display_name":"Karl Henrik Johansson","orcid":"https://orcid.org/0000-0001-9940-5929"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Johansson, Karl Henrik","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100764456"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.7085999846458435,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.7085999846458435,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.2321999967098236,"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/T13553","display_name":"Age of Information Optimization","score":0.007899999618530273,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.6460999846458435},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.5713000297546387},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5257999897003174},{"id":"https://openalex.org/keywords/tracking","display_name":"Tracking (education)","score":0.5109999775886536},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5001000165939331},{"id":"https://openalex.org/keywords/communication-noise","display_name":"Communication noise","score":0.45969998836517334},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.451200008392334},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4343000054359436}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6460999846458435},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.5713000297546387},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5257999897003174},{"id":"https://openalex.org/C2775936607","wikidata":"https://www.wikidata.org/wiki/Q466845","display_name":"Tracking (education)","level":2,"score":0.5109999775886536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5077999830245972},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5001000165939331},{"id":"https://openalex.org/C16210155","wikidata":"https://www.wikidata.org/wiki/Q5154140","display_name":"Communication noise","level":2,"score":0.45969998836517334},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.451200008392334},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4343000054359436},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.42820000648498535},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.39989998936653137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3720000088214874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3643999993801117},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3416000008583069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3346000015735626},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3262999951839447},{"id":"https://openalex.org/C29265498","wikidata":"https://www.wikidata.org/wiki/Q7047719","display_name":"Noise measurement","level":3,"score":0.3206999897956848},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2856000065803528},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.2808000147342682},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2547000050544739}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2512.01732","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.01732","pdf_url":"https://arxiv.org/pdf/2512.01732","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2512.01732","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.01732","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2512.01732","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.01732","pdf_url":"https://arxiv.org/pdf/2512.01732","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4416967190.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"distributed":[1,81],"and":[2,26,70,134],"federated":[3,57],"learning":[4,58],"algorithms,":[5],"communication":[6,17,149,190],"overhead":[7],"is":[8],"often":[9],"reduced":[10],"by":[11],"performing":[12],"multiple":[13],"local":[14,28,42,105,157],"updates":[15,158],"between":[16],"rounds.":[18],"However,":[19],"due":[20],"to":[21,38,95,107,153,167,180],"data":[22,97,119],"heterogeneity":[23],"across":[24,92],"nodes":[25,94],"the":[27,39,46,55,89,144,154,163,174,185],"gradient":[29,67,75,91,169],"noise":[30,176,186],"within":[31],"each":[32],"node,":[33],"this":[34,51],"strategy":[35],"can":[36],"lead":[37],"drift":[40],"of":[41,104,156],"models":[43],"away":[44],"from":[45,178],"global":[47,90],"optimum.":[48],"To":[49],"address":[50],"issue,":[52],"we":[53,121],"revisit":[54],"well-known":[56],"method":[59],"Scaffold":[60],"(Karimireddy":[61],"et":[62],"al.,":[63],"2020)":[64],"under":[65],"a":[66,72,101,126,135],"tracking":[68,76,170],"perspective,":[69],"propose":[71],"unified":[73],"spatio-temporal":[74],"algorithm,":[77],"termed":[78],"ST-GT,":[79],"for":[80,130,138,162],"stochastic":[82],"optimization":[83],"over":[84],"time-varying":[85],"graphs.":[86],"ST-GT":[87,124,142,172],"tracks":[88],"neighboring":[93],"mitigate":[96],"heterogeneity,":[98,120],"while":[99],"maintaining":[100],"running":[102],"average":[103],"gradients":[106],"substantially":[108],"suppress":[109],"noise,":[110],"with":[111,151],"slightly":[112],"more":[113],"storage":[114],"overhead.":[115],"Without":[116],"assuming":[117],"bounded":[118],"prove":[122],"that":[123],"attains":[125],"linear":[127,146],"convergence":[128],"rate":[129,137],"strongly":[131],"convex":[132],"problems":[133],"sublinear":[136],"nonconvex":[139],"cases.":[140],"Notably,":[141],"achieves":[143],"first":[145],"speed-up":[147],"in":[148],"complexity":[150],"respect":[152],"number":[155],"per":[159],"round":[160],"$\u03c4$":[161],"strongly-convex":[164],"setting.":[165],"Compared":[166],"traditional":[168],"methods,":[171],"reduces":[173],"topology-dependent":[175],"term":[177],"$\u03c3^2$":[179,183],"$\u03c3^2/\u03c4$,":[181],"where":[182],"denotes":[184],"level,":[187],"thereby":[188],"improving":[189],"efficiency.":[191]},"counts_by_year":[],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-12-03T00:00:00"}