{"id":"https://openalex.org/W7162760632","doi":"https://doi.org/10.48550/arxiv.2605.29005","title":"LoRe: Adaptive Interaction-Evaluation Routing with Per-Step Interaction Budgets for Iterative Graph Solvers","display_name":"LoRe: Adaptive Interaction-Evaluation Routing with Per-Step Interaction Budgets for Iterative Graph Solvers","publication_year":2026,"publication_date":"2026-05-27","ids":{"openalex":"https://openalex.org/W7162760632","doi":"https://doi.org/10.48550/arxiv.2605.29005"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.29005","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29005","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":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.2605.29005","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137350907","display_name":"Jintao Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Jintao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137352103","display_name":"Yong-Yi Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yong-Yi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137383999","display_name":"Zheng-An Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Zheng-An","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100703985","display_name":"Heng Fan","orcid":"https://orcid.org/0000-0002-5328-2449"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fan, Heng","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/T11273","display_name":"Advanced Graph Neural Networks","score":0.7929999828338623,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.7929999828338623,"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.03840000182390213,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.023900000378489494,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/speedup","display_name":"Speedup","score":0.8876000046730042},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7113000154495239},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6432999968528748},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.6360999941825867},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5898000001907349},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5194000005722046},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4462999999523163},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.44020000100135803}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8876000046730042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7522000074386597},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7113000154495239},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6432999968528748},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.6360999941825867},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5898000001907349},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5194000005722046},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46939998865127563},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4462999999523163},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.44020000100135803},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4219000041484833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4115000069141388},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38019999861717224},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3147999942302704},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3061999976634979},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.28450000286102295},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.2549999952316284}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.29005","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29005","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":"doi:10.48550/arxiv.2605.29005","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.29005","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":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"Diffusion-based":[0],"neural":[1],"solvers":[2],"for":[3],"combinatorial":[4],"optimization":[5],"repeatedly":[6],"re-evaluate":[7],"dense":[8],"edge/factor":[9],"interactions,":[10,62],"making":[11],"inference":[12,95],"expensive":[13],"in":[14,119],"wall-clock":[15,80],"time":[16],"and":[17,109,132,151],"often":[18],"memory-bound":[19],"at":[20,43,144],"scale.":[21],"Inspired":[22],"by":[23,54],"the":[24,87,100,126],"computational":[25],"methodologies":[26],"of":[27,52,64],"many-body":[28],"physics,":[29],"we":[30],"introduce":[31],"LoRe,":[32],"a":[33,49,66,105,110,140,147],"training-free,":[34],"inference-time":[35],"drop-in":[36],"wrapper":[37],"that":[38],"enforces":[39],"per-step":[40],"interaction-evaluation":[41],"budgeting:":[42],"each":[44],"iteration,":[45],"it":[46],"evaluates":[47],"only":[48],"fixed":[50,67],"fraction":[51],"interactions":[53],"dynamically":[55],"routing":[56],"computation":[57],"to":[58,135],"high-conflict":[59],"or":[60,73],"high-uncertainty":[61],"instead":[63],"using":[65],"sparsification":[68],"(e.g.,":[69],"static":[70,74],"kNN":[71],"graphs":[72],"masks).":[75],"Under":[76],"fully":[77],"inclusive":[78],"end-to-end":[79],"accounting,":[81],"LoRe":[82,138],"substantially":[83],"improves":[84],"scalability":[85],"on":[86,125],"Maximum":[88],"Independent":[89],"Set":[90],"(MIS)":[91],"problem,":[92],"extending":[93],"feasible":[94],"more":[96],"than":[97],"$3\\times$":[98],"beyond":[99],"baseline's":[101],"out-of-memory":[102],"limit,":[103],"delivering":[104],"$\\sim":[106,111,141],"8\\times$":[107],"speedup":[108,143],"12\\times$":[112],"peak-memory":[113],"reduction,":[114],"with":[115,146],"solution":[116],"quality":[117],"preserved":[118],"this":[120],"regime.":[121],"Demonstrating":[122],"cross-task":[123],"generality":[124],"large-scale":[127],"Traveling":[128],"Salesperson":[129],"Problem":[130],"(TSP)":[131],"zero-shot":[133],"robustness":[134],"topology":[136],"shifts,":[137],"achieves":[139],"15\\times$":[142],"$n=1000$":[145],"$44\\times$":[148],"memory":[149],"reduction":[150],"competitive":[152],"tour":[153],"quality.":[154]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-30T00:00:00"}