{"id":"https://openalex.org/W7135193126","doi":"https://doi.org/10.48550/arxiv.2603.11874","title":"An Evolutionary Algorithm with Probabilistic Annealing for Large-scale Sparse Multi-objective Optimization","display_name":"An Evolutionary Algorithm with Probabilistic Annealing for Large-scale Sparse Multi-objective Optimization","publication_year":2026,"publication_date":"2026-03-12","ids":{"openalex":"https://openalex.org/W7135193126","doi":"https://doi.org/10.48550/arxiv.2603.11874"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.11874","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11874","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":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.2603.11874","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129043796","display_name":"Shuai Shao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shao, Shuai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129040945","display_name":"Yuhao Sun","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Yuhao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129020945","display_name":"Xing Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Xing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129007767","display_name":"Ye Tian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tian, Ye","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129059780","display_name":"Guan Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Guan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128962755","display_name":"Jin Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Jin","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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9603000283241272,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9603000283241272,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.0038999998942017555,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.0032999999821186066,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6093000173568726},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5884000062942505},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5493000149726868},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4812999963760376},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.45730000734329224},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.39910000562667847},{"id":"https://openalex.org/keywords/binary-entropy-function","display_name":"Binary entropy function","score":0.3736000061035156}],"concepts":[{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6093000173568726},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5884000062942505},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5493000149726868},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5070000290870667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4912000000476837},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4812999963760376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45750001072883606},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.45730000734329224},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.39910000562667847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39469999074935913},{"id":"https://openalex.org/C44415725","wikidata":"https://www.wikidata.org/wiki/Q4913893","display_name":"Binary entropy function","level":3,"score":0.3736000061035156},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.3391000032424927},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.336899995803833},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.29510000348091125},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29170000553131104},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.11874","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11874","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":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.2603.11874","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11874","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":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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Large-scale":[0],"sparse":[1,30,107],"multi-objective":[2,77,108],"optimization":[3],"problems":[4,173],"(LSMOPs)":[5],"are":[6],"prevalent":[7],"in":[8,23,186],"real-world":[9,175],"applications,":[10],"where":[11],"optimal":[12],"solutions":[13],"typically":[14],"contain":[15],"only":[16],"a":[17,45,122,162],"few":[18],"nonzero":[19,85],"variables,":[20,50],"such":[21],"as":[22],"adversarial":[24],"attacks,":[25],"critical":[26,84],"node":[27],"detection,":[28],"and":[29,61,70,167,174,191],"signal":[31],"reconstruction.":[32],"Since":[33],"the":[34,51,66,83,158,179],"function":[35,90],"evaluation":[36],"of":[37,48,59,188],"LSMOPs":[38],"often":[39],"relies":[40],"on":[41,171],"large-scale":[42,106],"datasets":[43],"involving":[44],"large":[46],"number":[47],"decision":[49,86],"search":[52,156],"space":[53],"becomes":[54],"extremely":[55],"high-dimensional.":[56],"The":[57,110],"coexistence":[58],"sparsity":[60],"high":[62],"dimensionality":[63],"greatly":[64],"intensifies":[65],"conflict":[67],"between":[68,165],"exploration":[69,148,166],"exploitation,":[71,132],"making":[72],"it":[73],"difficult":[74],"for":[75,105],"existing":[76],"evolutionary":[78,100,184],"algorithms":[79,185],"(MOEAs)":[80],"to":[81,149],"identify":[82],"variables":[87],"within":[88],"limited":[89],"evaluations.":[91],"To":[92],"address":[93],"this":[94,96],"challenge,":[95],"paper":[97],"proposes":[98],"an":[99,134,143],"algorithm":[101,111,160,181],"with":[102,118,126,138],"probabilistic":[103],"annealing":[104],"optimization.":[109],"is":[112],"driven":[113],"by":[114],"two":[115],"probability":[116,124,136],"vectors":[117],"distinct":[119],"entropy":[120,129,141],"characteristics:":[121],"convergence-oriented":[123],"vector":[125,137],"relatively":[127],"low":[128],"ensures":[130],"stable":[131],"whereas":[133],"annealed":[135],"gradually":[139],"decreasing":[140],"enables":[142],"adaptive":[144],"transition":[145],"from":[146],"global":[147],"local":[150],"refinement.":[151],"By":[152],"integrating":[153],"these":[154],"complementary":[155],"dynamics,":[157],"proposed":[159,180],"achieves":[161],"dynamic":[163],"equilibrium":[164],"exploitation.":[168],"Experimental":[169],"results":[170],"benchmark":[172],"applications":[176],"demonstrate":[177],"that":[178],"outperforms":[182],"state-of-the-art":[183],"terms":[187],"both":[189],"convergence":[190],"diversity.":[192]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-14T00:00:00"}