{"id":"https://openalex.org/W7160549366","doi":"https://doi.org/10.48550/arxiv.2605.04825","title":"Improving FMQA via Initial Training Data Design Considering Marginal Bit Coverage in One-Hot Encoding","display_name":"Improving FMQA via Initial Training Data Design Considering Marginal Bit Coverage in One-Hot Encoding","publication_year":2026,"publication_date":"2026-05-06","ids":{"openalex":"https://openalex.org/W7160549366","doi":"https://doi.org/10.48550/arxiv.2605.04825"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.04825","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.04825","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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.04825","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110705548","display_name":"Taiga Hayashi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hayashi, Taiga","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040695947","display_name":"Yuya Seki","orcid":"https://orcid.org/0000-0001-5393-2280"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seki, Yuya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038302327","display_name":"Kotaro Terada","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Terada, Kotaro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075497157","display_name":"Yosuke Mukasa","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mukasa, Yosuke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023738281","display_name":"Shuta Kikuchi","orcid":"https://orcid.org/0009-0002-1319-6834"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kikuchi, Shuta","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135624702","display_name":"Shu Tanaka","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tanaka, Shu","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.4106000065803528,"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.4106000065803528,"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.15039999783039093,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.062199998646974564,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/latin-hypercube-sampling","display_name":"Latin hypercube sampling","score":0.6711999773979187},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6019999980926514},{"id":"https://openalex.org/keywords/binary-data","display_name":"Binary data","score":0.5350000262260437},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.49410000443458557},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4936000108718872},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.49320000410079956},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.45899999141693115},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.43140000104904175},{"id":"https://openalex.org/keywords/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.41760000586509705},{"id":"https://openalex.org/keywords/multiplier","display_name":"Multiplier (economics)","score":0.4099000096321106}],"concepts":[{"id":"https://openalex.org/C20820323","wikidata":"https://www.wikidata.org/wiki/Q6496514","display_name":"Latin hypercube sampling","level":3,"score":0.6711999773979187},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6019999980926514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5612000226974487},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5351999998092651},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.5350000262260437},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5108000040054321},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.49410000443458557},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4936000108718872},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.49320000410079956},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.45899999141693115},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.43140000104904175},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.41760000586509705},{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.4099000096321106},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.36570000648498535},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.36169999837875366},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.3610000014305115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33889999985694885},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.32679998874664307},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3208000063896179},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.3165999948978424},{"id":"https://openalex.org/C51632099","wikidata":"https://www.wikidata.org/wiki/Q3985153","display_name":"Training set","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C39482219","wikidata":"https://www.wikidata.org/wiki/Q192826","display_name":"Kronecker delta","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C2983394010","wikidata":"https://www.wikidata.org/wiki/Q19885330","display_name":"Continuous variable","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C131675550","wikidata":"https://www.wikidata.org/wiki/Q7646884","display_name":"Surrogate model","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2671000063419342},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C139945424","wikidata":"https://www.wikidata.org/wiki/Q1940696","display_name":"Mean squared error","level":2,"score":0.2651999890804291},{"id":"https://openalex.org/C13926793","wikidata":"https://www.wikidata.org/wiki/Q3507155","display_name":"Group method of data handling","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.2554999887943268}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.04825","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.04825","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.04825","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.04825","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":"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":{"Factorization":[0],"machine":[1,15],"with":[2,18,125,145],"quadratic-optimization":[3],"annealing":[4],"(FMQA)":[5],"is":[6,27],"a":[7,13],"black-box":[8],"optimization":[9,123],"method":[10],"that":[11,85],"combines":[12],"factorization":[14],"(FM)":[16],"surrogate":[17],"QUBO-based":[19],"search":[20],"by":[21,71,90],"an":[22],"Ising":[23],"machine.":[24],"When":[25],"FMQA":[26],"applied":[28],"to":[29,77],"integer":[30],"or":[31],"discretized":[32],"continuous":[33],"variables":[34,46],"via":[35],"one-hot":[36,91],"encoding,":[37],"uniform":[38],"random":[39],"initial":[40,51,74],"sampling":[41,104,108],"can":[42],"leave":[43],"many":[44],"binary":[45,87],"never":[47],"active":[48],"in":[49],"the":[50,55,65,73,94,111,119,142,146,151],"training":[52,75],"data,":[53],"and":[54,110,116,127],"corresponding":[56],"FM":[57],"parameters":[58],"receive":[59],"no":[60],"direct":[61],"gradient":[62],"updates":[63],"from":[64],"observed":[66],"responses.":[67],"We":[68,100],"address":[69],"this":[70],"designing":[72],"data":[76],"achieve":[78],"complete":[79],"marginal":[80],"bit":[81],"coverage,":[82],"namely,":[83],"ensuring":[84],"every":[86],"variable":[88],"obtained":[89],"encoding":[92],"takes":[93],"value":[95],"one":[96],"at":[97],"least":[98],"once.":[99],"use":[101],"two":[102],"space-filling":[103],"methods,":[105],"Latin":[106],"hypercube":[107],"(LHS)":[109],"Sobol'":[112],"sequence,":[113],"yielding":[114],"LHS-FMQA":[115],"Sobol'-FMQA.":[117],"On":[118],"human-powered":[120],"aircraft":[121],"wing-shape":[122],"benchmark":[124],"17":[126],"32":[128],"design":[129],"variables,":[130],"both":[131],"proposed":[132],"methods":[133],"achieved":[134],"numerically":[135],"higher":[136],"mean":[137],"final":[138],"cruising":[139],"speeds":[140],"than":[141],"baseline":[143],"FMQA,":[144],"advantage":[147],"more":[148],"pronounced":[149],"on":[150],"32-variable":[152],"problem.":[153]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-08T00:00:00"}