{"id":"https://openalex.org/W7155070770","doi":"https://doi.org/10.48550/arxiv.2604.18196","title":"Similarity-based Portfolio Construction for Black-box Optimization","display_name":"Similarity-based Portfolio Construction for Black-box Optimization","publication_year":2026,"publication_date":"2026-04-20","ids":{"openalex":"https://openalex.org/W7155070770","doi":"https://doi.org/10.48550/arxiv.2604.18196"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.18196","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.18196","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.18196","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123866412","display_name":"Catalin-Viorel Dinu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dinu, Catalin-Viorel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075992713","display_name":"Diederick Vermetten","orcid":"https://orcid.org/0000-0003-3040-7162"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vermetten, Diederick","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113223493","display_name":"Carola Doerr","orcid":"https://orcid.org/0000-0003-2727-9569"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Doerr, Carola","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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.42750000953674316,"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.42750000953674316,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.17669999599456787,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.09030000120401382,"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/portfolio","display_name":"Portfolio","score":0.7208999991416931},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.64410001039505},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5917999744415283},{"id":"https://openalex.org/keywords/variance","display_name":"Variance (accounting)","score":0.5659000277519226},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5156999826431274},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.446399986743927},{"id":"https://openalex.org/keywords/efficient-frontier","display_name":"Efficient frontier","score":0.40209999680519104},{"id":"https://openalex.org/keywords/portfolio-optimization","display_name":"Portfolio optimization","score":0.39820000529289246}],"concepts":[{"id":"https://openalex.org/C2780821815","wikidata":"https://www.wikidata.org/wiki/Q5340806","display_name":"Portfolio","level":2,"score":0.7208999991416931},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6776999831199646},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.64410001039505},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5917999744415283},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.5659000277519226},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5156999826431274},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45840001106262207},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.446399986743927},{"id":"https://openalex.org/C51485801","wikidata":"https://www.wikidata.org/wiki/Q16966861","display_name":"Efficient frontier","level":3,"score":0.40209999680519104},{"id":"https://openalex.org/C202655437","wikidata":"https://www.wikidata.org/wiki/Q7231728","display_name":"Portfolio optimization","level":3,"score":0.39820000529289246},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.38420000672340393},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C134121241","wikidata":"https://www.wikidata.org/wiki/Q899301","display_name":"Yield (engineering)","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.28949999809265137},{"id":"https://openalex.org/C9725762","wikidata":"https://www.wikidata.org/wiki/Q1072885","display_name":"Modern portfolio theory","level":3,"score":0.28209999203681946},{"id":"https://openalex.org/C74510933","wikidata":"https://www.wikidata.org/wiki/Q1936145","display_name":"Project portfolio management","level":3,"score":0.2815999984741211},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.273499995470047},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2646999955177307},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C62644790","wikidata":"https://www.wikidata.org/wiki/Q3454689","display_name":"Variance reduction","level":3,"score":0.2513999938964844},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.25}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.18196","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.18196","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.18196","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.18196","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"score":0.44061601161956787,"display_name":"No poverty","id":"https://metadata.un.org/sdg/1"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"black-box":[1,158],"optimization,":[2],"a":[3,13,19,47,87,110,132],"central":[4],"question":[5],"is":[6,53,105],"which":[7],"algorithm":[8,68,102],"to":[9,11,32,54,86,100,139,143],"use":[10],"solve":[12],"given,":[14],"previously":[15],"unseen,":[16],"problem.":[17],"Selecting":[18],"single":[20,48,88],"algorithm,":[21],"however,":[22],"entails":[23],"inherent":[24],"risks:":[25],"inaccuracies":[26],"in":[27,46,156],"the":[28,56,83,101,115,121,125,151],"selector":[29],"may":[30],"lead":[31],"poor":[33],"choices,":[34],"and":[35,74,149],"even":[36],"well-performing":[37],"algorithms":[38],"with":[39],"high":[40],"variance":[41,72],"can":[42,93],"yield":[43],"unsatisfactory":[44],"results":[45],"run.":[49],"A":[50],"natural":[51],"remedy":[52],"split":[55],"evaluation":[57],"budget":[58,85],"across":[59],"multiple":[60],"runs":[61],"of":[62,153],"potentially":[63],"different":[64],"algorithms.":[65],"Such":[66],"sequential":[67],"portfolios":[69,92,141],"benefit":[70],"from":[71],"reduction":[73],"complementarities":[75],"between":[76],"algorithms,":[77],"often":[78],"outperforming":[79],"approaches":[80],"that":[81,109],"allocate":[82],"entire":[84],"solver.":[89,128],"While":[90],"effective":[91,135],"be":[94],"constructed":[95,113],"post-hoc,":[96],"transferring":[97],"this":[98],"idea":[99],"selection":[103,155],"setting":[104],"non-trivial.":[106],"We":[107,129],"show":[108],"naive":[111],"portfolio":[112,154],"over":[114],"full":[116],"training":[117],"set":[118],"already":[119],"outperforms":[120],"strongest":[122],"traditional":[123],"baseline,":[124],"virtual":[126],"best":[127],"then":[130],"propose":[131],"simple":[133],"yet":[134],"k-nearest-neighbor-based":[136],"finetuning":[137],"approach":[138],"construct":[140],"tailored":[142],"unseen":[144],"instances,":[145],"yielding":[146],"further":[147],"improvements":[148],"highlighting":[150],"effectiveness":[152],"fixed-budget":[157],"optimization.":[159]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-22T00:00:00"}