{"id":"https://openalex.org/W7155411046","doi":"https://doi.org/10.48550/arxiv.2604.20183","title":"Dual-Cluster Memory Agent: Resolving Multi-Paradigm Ambiguity in Optimization Problem Solving","display_name":"Dual-Cluster Memory Agent: Resolving Multi-Paradigm Ambiguity in Optimization Problem Solving","publication_year":2026,"publication_date":"2026-04-22","ids":{"openalex":"https://openalex.org/W7155411046","doi":"https://doi.org/10.48550/arxiv.2604.20183"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.20183","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.20183","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":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.2604.20183","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134430214","display_name":"Xinyu Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Xinyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134418559","display_name":"Yuchen Wan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wan, Yuchen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134381880","display_name":"Boxuan Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Boxuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134457930","display_name":"Zesheng Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Zesheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134399197","display_name":"Lingling Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Lingling","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070094915","display_name":"Bifan Wei","orcid":"https://orcid.org/0000-0002-9732-3011"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wei, Bifan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134365794","display_name":"Jun S. Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Jun","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.17149999737739563,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.17149999737739563,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.09220000356435776,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.08389999717473984,"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/ambiguity","display_name":"Ambiguity","score":0.738099992275238},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.6291000247001648},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.593500018119812},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5412999987602234},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5228999853134155},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.47519999742507935}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7389000058174133},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.738099992275238},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.6291000247001648},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.593500018119812},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5412999987602234},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5228999853134155},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.47519999742507935},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.46230000257492065},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.38089999556541443},{"id":"https://openalex.org/C12186640","wikidata":"https://www.wikidata.org/wiki/Q6815743","display_name":"Memory model","level":3,"score":0.36489999294281006},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35670000314712524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31040000915527344},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30469998717308044},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.29679998755455017},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C137293760","wikidata":"https://www.wikidata.org/wiki/Q3621696","display_name":"Language model","level":2,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.20183","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.20183","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":"doi:10.48550/arxiv.2604.20183","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.20183","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":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":{"Large":[0],"Language":[1],"Models":[2],"(LLMs)":[3],"often":[4],"struggle":[5],"with":[6,103],"structural":[7],"ambiguity":[8],"in":[9,43],"optimization":[10,110],"problems,":[11],"where":[12],"a":[13,44,127],"single":[14],"problem":[15],"admits":[16],"multiple":[17],"related":[18],"but":[19],"conflicting":[20],"modeling":[21,60],"paradigms,":[22],"hindering":[23],"effective":[24],"solution":[25,92],"generation.":[26],"To":[27],"address":[28],"this,":[29],"we":[30],"propose":[31],"Dual-Cluster":[32,51],"Memory":[33,52],"Agent":[34],"(DCM-Agent)":[35],"to":[36,48,59,89],"enhance":[37],"performance":[38,118],"by":[39,133],"leveraging":[40],"historical":[41,57],"solutions":[42,58],"training-free":[45],"manner.":[46],"Central":[47],"this":[49,84],"is":[50],"Construction.":[53],"This":[54,77],"agent":[55,85],"assigns":[56],"and":[61,75,95,98,147],"coding":[62],"clusters,":[63],"then":[64],"distills":[65],"each":[66],"cluster's":[67],"content":[68],"into":[69],"three":[70],"structured":[71,104],"types:":[72],"Approach,":[73],"Checklist,":[74],"Pitfall.":[76],"process":[78],"derives":[79],"generalizable":[80],"guidance":[81],"knowledge.":[82,105],"Furthermore,":[83],"introduces":[86],"Memory-augmented":[87],"Inference":[88],"dynamically":[90],"navigate":[91],"paths,":[93],"detect":[94],"repair":[96],"errors,":[97],"adaptively":[99],"switch":[100],"reasoning":[101],"paths":[102],"The":[106],"experiments":[107],"across":[108],"seven":[109],"benchmarks":[111],"demonstrate":[112],"that":[113],"DCM-Agent":[114],"achieves":[115],"an":[116],"average":[117],"improvement":[119],"of":[120],"11%-":[121],"21%.":[122],"Notably,":[123],"our":[124],"analysis":[125],"reveals":[126],"``knowledge":[128],"inheritance''":[129],"phenomenon:":[130],"memory":[131],"constructed":[132],"larger":[134],"models":[135,139],"can":[136],"guide":[137],"smaller":[138],"toward":[140],"superior":[141],"performance,":[142],"highlighting":[143],"the":[144],"framework's":[145],"scalability":[146],"efficiency.":[148]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-24T00:00:00"}