{"id":"https://openalex.org/W4213455174","doi":"https://doi.org/10.1109/wsc52266.2021.9715515","title":"On Solving Distributionally Robust Optimization Formulations Efficiently","display_name":"On Solving Distributionally Robust Optimization Formulations Efficiently","publication_year":2021,"publication_date":"2021-12-12","ids":{"openalex":"https://openalex.org/W4213455174","doi":"https://doi.org/10.1109/wsc52266.2021.9715515"},"language":"en","primary_location":{"id":"doi:10.1109/wsc52266.2021.9715515","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc52266.2021.9715515","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102864970","display_name":"Soumyadip Ghosh","orcid":"https://orcid.org/0000-0001-7621-5874"},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Soumyadip Ghosh","raw_affiliation_strings":["Mathematical Sciences, IBM Research, Thomas J. Watson Research Center,Yorktown Heights,NY,USA,10198"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Sciences, IBM Research, Thomas J. Watson Research Center,Yorktown Heights,NY,USA,10198","institution_ids":["https://openalex.org/I4210114115"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013152760","display_name":"Mark S. Squillante","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark S. Squillante","raw_affiliation_strings":["Mathematical Sciences, IBM Research, Thomas J. Watson Research Center,Yorktown Heights,NY,USA,10198"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Sciences, IBM Research, Thomas J. Watson Research Center,Yorktown Heights,NY,USA,10198","institution_ids":["https://openalex.org/I4210114115"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086410869","display_name":"Ebisa Wollega","orcid":null},"institutions":[{"id":"https://openalex.org/I114312114","display_name":"Colorado State University Pueblo","ror":"https://ror.org/02gn3zg65","country_code":"US","type":"education","lineage":["https://openalex.org/I114312114"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ebisa D. Wollega","raw_affiliation_strings":["Colorado State University-Pueblo,Department of Engineering,Pueblo,CO,USA,81001"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Colorado State University-Pueblo,Department of Engineering,Pueblo,CO,USA,81001","institution_ids":["https://openalex.org/I114312114"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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":"33","issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998000264167786,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9979000091552734,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7582100629806519},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.6662502288818359},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6334035992622375},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.6031308770179749},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.558417558670044},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.5426817536354065},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5354182124137878},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.527456521987915},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5224501490592957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5126668214797974},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.500211238861084},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.441714882850647},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4344191253185272},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4171024560928345},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.41509032249450684},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09294149279594421}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7582100629806519},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.6662502288818359},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6334035992622375},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.6031308770179749},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.558417558670044},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.5426817536354065},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5354182124137878},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.527456521987915},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5224501490592957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5126668214797974},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.500211238861084},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.441714882850647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4344191253185272},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4171024560928345},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.41509032249450684},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09294149279594421},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wsc52266.2021.9715515","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc52266.2021.9715515","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1484551447","https://openalex.org/W1490324987","https://openalex.org/W1534416612","https://openalex.org/W2093488901","https://openalex.org/W2096749624","https://openalex.org/W2112081648","https://openalex.org/W2150102617","https://openalex.org/W2163715525","https://openalex.org/W2537619949","https://openalex.org/W2564590721","https://openalex.org/W2962771675","https://openalex.org/W2963433607","https://openalex.org/W2963450292","https://openalex.org/W2999543921","https://openalex.org/W3092425680","https://openalex.org/W3097101849","https://openalex.org/W3103360925","https://openalex.org/W3120740533","https://openalex.org/W4210688903","https://openalex.org/W4237551148","https://openalex.org/W4244606392","https://openalex.org/W4247165901","https://openalex.org/W4253361323","https://openalex.org/W4287549435","https://openalex.org/W4295352925","https://openalex.org/W4299356147","https://openalex.org/W6681875376","https://openalex.org/W6730898090","https://openalex.org/W6745454490","https://openalex.org/W6762463284","https://openalex.org/W6784398165","https://openalex.org/W6785453043","https://openalex.org/W6788325805"],"related_works":["https://openalex.org/W4206903459","https://openalex.org/W2754816816","https://openalex.org/W4366280654","https://openalex.org/W3160167280","https://openalex.org/W4231621013","https://openalex.org/W4362706668","https://openalex.org/W3008318776","https://openalex.org/W1977633006","https://openalex.org/W4286899070","https://openalex.org/W2041416246"],"abstract_inverted_index":{"In":[0],"this":[1,46],"paper":[2],"we":[3,99],"propose":[4],"and":[5,115],"investigate":[6],"a":[7,25,57,62,90,109],"new":[8],"stochastic":[9,113],"gradient":[10,49],"descent":[11],"(SGD)":[12],"algorithm":[13],"to":[14,40,79],"efficiently":[15],"solve":[16],"distributionally":[17],"robust":[18],"optimization":[19],"(DRO)":[20],"formulations":[21,35,134],"that":[22,107],"arise":[23],"across":[24],"wide":[26],"range":[27],"of":[28,36,50,64,86,93,124],"applications.":[29],"Our":[30],"approach":[31,126],"for":[32,89],"the":[33,41,48,51,65,71,102,121],"min-max":[34],"DRO":[37,133],"applies":[38],"SGD":[39],"outer":[42],"minimization":[43],"problem.":[44],"Towards":[45],"end,":[47],"inner":[52],"maximization":[53],"is":[54,74],"estimated":[55],"by":[56],"sample":[58],"average":[59],"approximation":[60],"using":[61],"subset":[63,72],"data":[66],"in":[67,130],"each":[68],"iteration,":[69],"where":[70],"size":[73],"progressively":[75],"increased":[76],"over":[77,127],"iterations":[78],"ensure":[80],"convergence.":[81],"We":[82],"rigorously":[83],"establish":[84],"convergence":[85],"our":[87,125],"method":[88],"broad":[91],"class":[92],"models.":[94],"For":[95],"strongly":[96],"convex":[97],"models,":[98],"also":[100],"determine":[101],"optimal":[103],"support-size":[104],"growth":[105],"sequence":[106],"balances":[108],"fundamental":[110],"tradeoff":[111],"between":[112],"error":[114],"computational":[116],"effort.":[117],"Empirical":[118],"results":[119],"demonstrate":[120],"significant":[122],"benefits":[123],"previous":[128],"work":[129],"solving":[131],"these":[132],"efficiently.":[135]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}