{"id":"https://openalex.org/W4417143735","doi":"https://doi.org/10.48550/arxiv.2512.05825","title":"Approximation of Box Decomposition Algorithm for Fast Hypervolume-Based Multi-Objective Optimization","display_name":"Approximation of Box Decomposition Algorithm for Fast Hypervolume-Based Multi-Objective Optimization","publication_year":2025,"publication_date":"2025-12-05","ids":{"openalex":"https://openalex.org/W4417143735","doi":"https://doi.org/10.48550/arxiv.2512.05825"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2512.05825","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.05825","pdf_url":"https://arxiv.org/pdf/2512.05825","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2512.05825","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062660811","display_name":"Shuhei Watanabe","orcid":"https://orcid.org/0000-0001-6611-2812"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Watanabe, Shuhei","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062660811"],"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.8776999711990356,"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.8776999711990356,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.06930000334978104,"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"}},{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.01600000075995922,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.6122999787330627},{"id":"https://openalex.org/keywords/bayesian-optimization","display_name":"Bayesian optimization","score":0.53329998254776},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4885999858379364},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46140000224113464},{"id":"https://openalex.org/keywords/function-approximation","display_name":"Function approximation","score":0.45010000467300415},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.40389999747276306},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.38089999556541443}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6122999787330627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5378999710083008},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.53329998254776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5253999829292297},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5238000154495239},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4885999858379364},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46140000224113464},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.45010000467300415},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.40389999747276306},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.38089999556541443},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.34709998965263367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33550000190734863},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.26089999079704285}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2512.05825","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.05825","pdf_url":"https://arxiv.org/pdf/2512.05825","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"text"},{"id":"doi:10.48550/arxiv.2512.05825","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.05825","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":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2512.05825","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.05825","pdf_url":"https://arxiv.org/pdf/2512.05825","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"text"},"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":{"Hypervolume":[0],"(HV)-based":[1],"Bayesian":[2],"optimization":[3],"(BO)":[4],"is":[5,90],"one":[6],"of":[7,18,32,108],"the":[8,15,20,30,46,63,94],"standard":[9],"approaches":[10],"for":[11],"multi-objective":[12],"decision-making.":[13],"However,":[14,85],"computational":[16],"cost":[17],"optimizing":[19],"acquisition":[21],"function":[22],"remains":[23],"a":[24,86],"significant":[25],"bottleneck,":[26],"primarily":[27],"due":[28],"to":[29,43],"expense":[31],"HV":[33,37],"improvement":[34,49],"calculations.":[35],"While":[36],"box-decomposition":[38],"offers":[39],"an":[40,82],"efficient":[41],"way":[42],"cope":[44],"with":[45],"frequent":[47],"exact":[48],"calculations,":[50],"it":[51],"suffers":[52],"from":[53,93],"super-polynomial":[54],"memory":[55],"complexity":[56],"$O(MN^{\\lfloor":[57],"\\frac{M":[58],"+":[59],"1}{2}":[60],"\\rfloor})$":[61],"in":[62],"worst":[64],"case":[65],"as":[66],"proposed":[67],"by":[68,101],"Lacour":[69],"et":[70,78],"al.":[71,79],"(2017).":[72],"To":[73],"tackle":[74],"this":[75,99,109],"problem,":[76],"Couckuyt":[77],"(2012)":[80],"employed":[81],"approximation":[83,110],"algorithm.":[84,111],"rigorous":[87],"algorithmic":[88,106],"description":[89],"currently":[91],"absent":[92],"literature.":[95],"This":[96],"paper":[97],"bridges":[98],"gap":[100],"providing":[102],"comprehensive":[103],"mathematical":[104],"and":[105],"details":[107]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-12-09T00:00:00"}