{"id":"https://openalex.org/W7155008314","doi":"https://doi.org/10.48550/arxiv.2604.15837","title":"Stein Variational Black-Box Combinatorial Optimization","display_name":"Stein Variational Black-Box Combinatorial Optimization","publication_year":2026,"publication_date":"2026-04-17","ids":{"openalex":"https://openalex.org/W7155008314","doi":"https://doi.org/10.48550/arxiv.2604.15837"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.15837","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15837","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.2604.15837","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080055042","display_name":"Thomas Landais","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Landais, Thomas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001023584","display_name":"Olivier Goudet","orcid":"https://orcid.org/0000-0001-7040-5052"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Goudet, Olivier","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134023666","display_name":"Adrien Go\u00ebffon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Go\u00ebffon, Adrien","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110660182","display_name":"Fr\u00e9d\u00e9ric Saubion","orcid":"https://orcid.org/0000-0001-8227-7174"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saubion, Fr\u00e9d\u00e9ric","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134064947","display_name":"Sylvain Lamprier","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lamprier, Sylvain","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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.8666999936103821,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.8666999936103821,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.053199999034404755,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.01119999960064888,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6850000023841858},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5785999894142151},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5227000117301941},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5164999961853027},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5120000243186951},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4684999883174896},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4593999981880188},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4478999972343445},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.43540000915527344}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6850000023841858},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6205999851226807},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5785999894142151},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5227000117301941},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5164999961853027},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5120000243186951},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4684999883174896},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4593999981880188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44929999113082886},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4478999972343445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.446399986743927},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.43540000915527344},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.40549999475479126},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.37119999527931213},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.35850000381469727},{"id":"https://openalex.org/C91852762","wikidata":"https://www.wikidata.org/wiki/Q3307742","display_name":"Fitness landscape","level":3,"score":0.3174000084400177},{"id":"https://openalex.org/C145671259","wikidata":"https://www.wikidata.org/wiki/Q1493786","display_name":"Discrete optimization","level":3,"score":0.31040000915527344},{"id":"https://openalex.org/C153782549","wikidata":"https://www.wikidata.org/wiki/Q175116","display_name":"Discrete space","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.30640000104904175},{"id":"https://openalex.org/C2777742833","wikidata":"https://www.wikidata.org/wiki/Q1964083","display_name":"Reciprocal","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2939000129699707},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.2890999913215637},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.287200003862381},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.28290000557899475},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.27059999108314514},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2653000056743622},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.2651999890804291},{"id":"https://openalex.org/C89611455","wikidata":"https://www.wikidata.org/wiki/Q6804646","display_name":"Mechanism (biology)","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2567000091075897}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.15837","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15837","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.2604.15837","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15837","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":{"Combinatorial":[0],"black-box":[1,139],"optimization":[2,140],"in":[3,47,72,107],"high-dimensional":[4],"settings":[5],"demands":[6],"a":[7,31,39,67,130],"careful":[8],"trade-off":[9],"between":[10],"exploiting":[11],"promising":[12,131],"regions":[13],"of":[14,42,87,124],"the":[15,62,73,78,88,99,122],"search":[16],"space":[17],"and":[18,82,106],"preserving":[19],"sufficient":[20],"exploration":[21],"to":[22,65,80],"identify":[23],"multiple":[24],"optima.":[25],"Although":[26],"Estimation-of-Distribution":[27],"Algorithms":[28],"(EDAs)":[29],"provide":[30],"powerful":[32],"model-based":[33],"framework,":[34],"they":[35],"often":[36],"concentrate":[37],"on":[38,116],"single":[40],"region":[41],"interest,":[43],"which":[44],"may":[45],"result":[46],"premature":[48],"convergence":[49],"when":[50],"facing":[51],"complex":[52],"or":[53],"multimodal":[54],"objective":[55],"landscapes.":[56],"In":[57],"this":[58],"work,":[59],"we":[60],"incorporate":[61],"Stein":[63,125],"operator":[64],"introduce":[66],"repulsive":[68],"mechanism":[69],"among":[70],"particles":[71],"parameter":[74],"space,":[75],"thereby":[76],"encouraging":[77],"population":[79],"disperse":[81],"jointly":[83],"explore":[84],"several":[85,108],"modes":[86],"fitness":[89],"landscape.":[90],"Empirical":[91],"evaluations":[92],"across":[93],"diverse":[94],"benchmark":[95],"problems":[96],"show":[97],"that":[98],"proposed":[100],"method":[101],"achieves":[102],"performance":[103],"competitive":[104],"with,":[105],"cases":[109],"superior":[110],"to,":[111],"leading":[112],"state-of-the-art":[113],"approaches,":[114],"particularly":[115],"large-scale":[117],"instances.":[118],"These":[119],"findings":[120],"highlight":[121],"potential":[123],"variational":[126],"gradient":[127],"descent":[128],"as":[129],"direction":[132],"for":[133],"addressing":[134],"large,":[135],"computationally":[136],"expensive,":[137],"discrete":[138],"problems.":[141]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-21T00:00:00"}