{"id":"https://openalex.org/W7126244374","doi":"https://doi.org/10.48550/arxiv.2601.21048","title":"Test-Time Adaptation for Unsupervised Combinatorial Optimization","display_name":"Test-Time Adaptation for Unsupervised Combinatorial Optimization","publication_year":2026,"publication_date":"2026-01-28","ids":{"openalex":"https://openalex.org/W7126244374","doi":"https://doi.org/10.48550/arxiv.2601.21048"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2601.21048","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","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/A5023972038","display_name":"Yiqiao Liao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liao, Yiqiao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Koushanfar, Farinaz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Koushanfar, Farinaz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5091717833","display_name":"Parinaz Naghizadeh","orcid":"https://orcid.org/0000-0002-2277-1709"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Naghizadeh, Parinaz","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":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11228571,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.30790001153945923,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.30790001153945923,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.11129999905824661,"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"}},{"id":"https://openalex.org/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.06629999727010727,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6140000224113464},{"id":"https://openalex.org/keywords/unsupervised-learning","display_name":"Unsupervised learning","score":0.5605999827384949},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5465999841690063},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.521399974822998},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5005000233650208},{"id":"https://openalex.org/keywords/inductive-bias","display_name":"Inductive bias","score":0.4560999870300293},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.3991999924182892},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.3456999957561493}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6883999705314636},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6567000150680542},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6140000224113464},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.6053000092506409},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.5605999827384949},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5465999841690063},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.521399974822998},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5005000233650208},{"id":"https://openalex.org/C197352929","wikidata":"https://www.wikidata.org/wiki/Q1074074","display_name":"Inductive bias","level":4,"score":0.4560999870300293},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.3456999957561493},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.33489999175071716},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.3122999966144562},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3095000088214874},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.29989999532699585},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.28139999508857727},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C45942800","wikidata":"https://www.wikidata.org/wiki/Q245652","display_name":"Ensemble learning","level":2,"score":0.25760000944137573}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2601.21048","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2601.21048","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.21048","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":"pmh:doi:10.48550/arxiv.2601.21048","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","score":0.5913257002830505,"display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Unsupervised":[0],"neural":[1],"combinatorial":[2,221],"optimization":[3,222],"(NCO)":[4],"enables":[5],"learning":[6],"powerful":[7],"solvers":[8],"without":[9],"access":[10],"to":[11,53,61,150,167],"ground-truth":[12],"solutions.":[13],"Existing":[14],"approaches":[15],"fall":[16],"into":[17],"two":[18,100,140],"disjoint":[19],"paradigms:":[20,101],"models":[21,29,103,117],"trained":[22,153,171],"for":[23,88,109,143],"generalization":[24,82],"across":[25,216],"instances,":[26],"and":[27,58,137,161,206,212,219,232],"instance-specific":[28,177,233],"optimized":[30],"independently":[31],"at":[32,120],"test":[33,121],"time.":[34,122],"While":[35],"the":[36,47,67,77,85,139,194,210],"former":[37],"are":[38,49,59],"efficient":[39],"during":[40],"inference,":[41],"they":[42],"lack":[43],"effective":[44,89,162],"instance-wise":[45,90,110],"adaptability;":[46],"latter":[48],"flexible":[50],"but":[51],"fail":[52],"exploit":[54],"learned":[55,80],"inductive":[56,78,157],"structure":[57],"prone":[60],"poor":[62,106],"local":[63],"optima.":[64],"This":[65],"motivates":[66],"central":[68],"question":[69],"of":[70,197,214],"our":[71],"work:":[72],"how":[73],"can":[74],"we":[75,127],"leverage":[76],"bias":[79],"through":[81],"while":[83,155,186],"unlocking":[84],"flexibility":[86],"required":[87],"adaptation?":[91],"We":[92],"first":[93],"identify":[94],"a":[95,130,170,227],"challenge":[96],"in":[97],"bridging":[98],"these":[99],"generalization-focused":[102],"often":[104],"constitute":[105],"warm":[107],"starts":[108],"optimization,":[111],"potentially":[112],"underperforming":[113],"even":[114],"randomly":[115],"initialized":[116],"when":[118],"fine-tuned":[119],"To":[123],"resolve":[124],"this":[125],"incompatibility,":[126],"propose":[128],"TACO,":[129],"model-agnostic":[131],"test-time":[132],"adaptation":[133],"framework":[134],"that":[135],"unifies":[136],"extends":[138],"existing":[141],"paradigms":[142],"unsupervised":[144,163,234],"NCO.":[145,235],"TACO":[146,181,215],"applies":[147],"strategic":[148],"warm-starting":[149],"partially":[151],"relax":[152],"parameters":[154],"preserving":[156],"bias,":[158],"enabling":[159],"rapid":[160],"adaptation.":[164],"Crucially,":[165],"compared":[166],"naively":[168],"fine-tuning":[169],"generalizable":[172,231],"model":[173,178],"or":[174],"optimizing":[175],"an":[176],"from":[179],"scratch,":[180],"achieves":[182],"better":[183],"solution":[184],"quality":[185],"incurring":[187],"negligible":[188],"additional":[189],"computational":[190],"cost.":[191],"Experiments":[192],"on":[193],"canonical":[195],"problems":[196],"minimum":[198],"vertex":[199],"cover,":[200],"maximum":[201,203],"clique,":[202],"independent":[204],"set,":[205],"max":[207],"cut":[208],"demonstrate":[209],"effectiveness":[211],"robustness":[213],"static,":[217],"distribution-shifted,":[218],"dynamic":[220],"problems,":[223],"establishing":[224],"it":[225],"as":[226],"practical":[228],"bridge":[229],"between":[230]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-01T00:00:00"}