{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T13:46:12Z","timestamp":1768916772522,"version":"3.49.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T00:00:00Z","timestamp":1547683200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2019,1,18]]},"abstract":"<jats:p>We consider a general min-max optimization formulation defined over a sample space X, probability distribution P on X<\/jats:p>","DOI":"10.1145\/3305218.3305235","type":"journal-article","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T17:15:15Z","timestamp":1547745315000},"page":"45-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On Min-Max Optimization Over Large Data Sets"],"prefix":"10.1145","volume":"46","author":[{"given":"Soumyadip","family":"Ghosh","sequence":"first","affiliation":[{"name":"Thomas J. Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark S.","family":"Squillante","sequence":"additional","affiliation":[{"name":"Thomas J. Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ebisa D.","family":"Wollega","sequence":"additional","affiliation":[{"name":"Colorado State University-Pueblo, Pueblo, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1120.1641"},{"key":"e_1_2_1_2_1","unstructured":"J. Blanchet Y. Kang and K. Murthy. Robust Wasserstein Profile Inference and Applications to Machine Learning. ArXiv e-prints Oct 2016.  J. Blanchet Y. Kang and K. Murthy. Robust Wasserstein Profile Inference and Applications to Machine Learning. ArXiv e-prints Oct 2016."},{"key":"e_1_2_1_3_1","unstructured":"L. Bottou F. Curtis and J. Nocedal. Optimization Methods for Large-Scale Machine Learning. ArXiv e-prints Jun 2016.  L. Bottou F. Curtis and J. Nocedal. Optimization Methods for Large-Scale Machine Learning. ArXiv e-prints Jun 2016."},{"key":"e_1_2_1_4_1","unstructured":"J. Duchi P. Glynn and H. Namkoong. Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach. ArXiv e-prints Oct 2016.  J. Duchi P. Glynn and H. Namkoong. Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach. ArXiv e-prints Oct 2016."},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"S. Ghosh and H. Lam. Robust analysis in stochastic simulation: Computation and performance guarantees. Op. Res. to appear 2018.  S. Ghosh and H. Lam. Robust analysis in stochastic simulation: Computation and performance guarantees. Op. Res. to appear 2018.","DOI":"10.1287\/opre.2018.1765"},{"key":"e_1_2_1_6_1","unstructured":"S. Ghosh M. Squillante and E. Wollega. Efficient Stochastic Gradient Descent for Distributionally Robust Learning. ArXiv e-prints May 2018.  S. Ghosh M. Squillante and E. Wollega. Efficient Stochastic Gradient Descent for Distributionally Robust Learning. ArXiv e-prints May 2018."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3219358.3219362"},{"key":"e_1_2_1_8_1","unstructured":"M. Lichman. UCI machine learning repository 2013.  M. Lichman. UCI machine learning repository 2013."},{"key":"e_1_2_1_9_1","first-page":"2208","article-title":"Stochastic gradient methods for distributionally robust optimization with f-divergences","volume":"29","author":"Namkoong H.","year":"2016","journal-title":"NIPS"},{"key":"e_1_2_1_10_1","first-page":"2971","article-title":"Variance-based regularization with convex objectives","volume":"30","author":"Namkoong H.","year":"2017","journal-title":"NIPS"},{"key":"e_1_2_1_11_1","volume-title":"ICLR","author":"Sinha A.","year":"2018"},{"key":"e_1_2_1_12_1","unstructured":"S. Wilks. Mathematical Statistics. Wiley 1962.  S. Wilks. Mathematical Statistics. Wiley 1962."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3305218.3305235","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3305218.3305235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:58:09Z","timestamp":1750208289000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3305218.3305235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,17]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,1,18]]}},"alternative-id":["10.1145\/3305218.3305235"],"URL":"https:\/\/doi.org\/10.1145\/3305218.3305235","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2019,1,17]]},"assertion":[{"value":"2019-01-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}