{"id":"https://openalex.org/W4415306750","doi":"https://doi.org/10.4230/lipics.icalp.2025.8","title":"Identifying Approximate Minimizers Under Stochastic Uncertainity","display_name":"Identifying Approximate Minimizers Under Stochastic Uncertainity","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415306750","doi":"https://doi.org/10.4230/lipics.icalp.2025.8"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2504.17019","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.17019","pdf_url":"https://arxiv.org/pdf/2504.17019","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":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/2504.17019","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082319037","display_name":"Hessa Al-Thani","orcid":"https://orcid.org/0000-0002-1777-1069"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Al-Thani, Hessa","raw_affiliation_strings":["Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":"https://orcid.org/0000-0002-1777-1069","affiliations":[{"raw_affiliation_string":"Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051270969","display_name":"Viswanath Nagarajan","orcid":"https://orcid.org/0000-0002-9514-5581"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nagarajan, Viswanath","raw_affiliation_strings":["Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":"https://orcid.org/0000-0002-9514-5581","affiliations":[{"raw_affiliation_string":"Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27837315"],"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.3163999915122986,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.3163999915122986,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.2824000120162964,"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/T11801","display_name":"Reservoir Engineering and Simulation Methods","score":0.2615000009536743,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6396999955177307},{"id":"https://openalex.org/keywords/stochastic-dominance","display_name":"Stochastic dominance","score":0.5927000045776367},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5260000228881836},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4830999970436096},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.44850000739097595},{"id":"https://openalex.org/keywords/stochastic-process","display_name":"Stochastic process","score":0.430400013923645},{"id":"https://openalex.org/keywords/random-sequence","display_name":"Random sequence","score":0.40860000252723694},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4041000008583069}],"concepts":[{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6396999955177307},{"id":"https://openalex.org/C33252445","wikidata":"https://www.wikidata.org/wiki/Q3713315","display_name":"Stochastic dominance","level":2,"score":0.5927000045776367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5662999749183655},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5285999774932861},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5260000228881836},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4830999970436096},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.44850000739097595},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.430400013923645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42910000681877136},{"id":"https://openalex.org/C186515451","wikidata":"https://www.wikidata.org/wiki/Q228191","display_name":"Random sequence","level":3,"score":0.40860000252723694},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4041000008583069},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.3822999894618988},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3718000054359436},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.367000013589859},{"id":"https://openalex.org/C99888217","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping time","level":2,"score":0.34689998626708984},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.34369999170303345},{"id":"https://openalex.org/C32645036","wikidata":"https://www.wikidata.org/wiki/Q475164","display_name":"Stochastic ordering","level":2,"score":0.3327000141143799},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2637999951839447},{"id":"https://openalex.org/C127491075","wikidata":"https://www.wikidata.org/wiki/Q7617825","display_name":"Stochastic modelling","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2504.17019","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.17019","pdf_url":"https://arxiv.org/pdf/2504.17019","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2504.17019","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.17019","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.icalp.2025.8","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2025.8","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2504.17019","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.17019","pdf_url":"https://arxiv.org/pdf/2504.17019","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":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":{"We":[0],"study":[1],"a":[2,22,31,80,84,94,107,115,129,156],"fundamental":[3],"stochastic":[4,165],"selection":[5],"problem":[6,50],"involving":[7],"n":[8],"independent":[9],"random":[10,40],"variables,":[11,41],"each":[12],"of":[13,55,60,132],"which":[14],"can":[15],"be":[16],"queried":[17],"at":[18,42],"some":[19],"cost.":[20,45],"Given":[21],"tolerance":[23],"level":[24],"\u03b4,":[25],"the":[26,39,58,61,75,111,118,139,146,150],"goal":[27,76],"is":[28,51,77,159],"to":[29,48,78],"find":[30,79],"\u03b4-approximately":[32],"minimum":[33,43],"(or":[34],"maximum)":[35],"value":[36,82,113],"over":[37],"all":[38,87],"expected":[44],"A":[46],"solution":[47],"this":[49],"an":[52],"adaptive":[53],"sequence":[54,131],"queries,":[56],"where":[57,155],"choice":[59],"next":[62],"query":[63,88,101],"may":[64],"depend":[65],"on":[66,73,124],"previously-observed":[67],"values.":[68],"Two":[69],"variants":[70],"arise,":[71],"depending":[72],"whether":[74],"\u03b4-minimum":[81,112],"or":[83],"\u03b4-minimizer.":[85,119],"When":[86,100],"costs":[89,102],"are":[90,103],"uniform,":[91],"we":[92,105,135],"provide":[93,106],"4-approximation":[95],"algorithm":[96,109,151],"for":[97,110,117],"both":[98],"variants.":[99],"non-uniform,":[104],"5.83-approximation":[108],"and":[114,152,162],"7.47-approximation":[116],"All":[120],"our":[121],"algorithms":[122],"rely":[123],"non-adaptive":[125],"policies":[126],"(that":[127],"perform":[128],"fixed":[130],"queries),":[133],"so":[134],"also":[136],"upper":[137],"bound":[138],"corresponding":[140],"\"adaptivity\"":[141],"gaps.":[142],"Our":[143],"analysis":[144],"relates":[145],"stopping":[147],"probabilities":[148],"in":[149,160],"optimal":[153],"policies,":[154],"key":[157],"step":[158],"proving":[161],"using":[163],"certain":[164],"dominance":[166],"properties.":[167]},"counts_by_year":[],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2025-10-18T00:00:00"}