Central Limit Theorems for constructing confidence regions in strictly convex multi-objective simulation optimization. Hunter, S. R. & Pasupathy, R. In Feng, B., Pedrielli, G., Peng, Y., Shashaani, S., Song, E., Corlu, C. G., Lee, L. H., Chew, E. P., Roeder, T., & Lendermann, P, editors, Proceedings of the 2022 Winter Simulation Conference, pages 3015–3026, Piscataway, NJ, 2022. IEEE.
![Central Limit Theorems for constructing confidence regions in strictly convex multi-objective simulation optimization [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper doi abstract bibtex 2 downloads
Paper doi abstract bibtex 2 downloads We consider the context of multi-objective simulation optimization (MOSO) with strictly convex objectives. We show that under certain types of scalarizations, a $(1-α)$-confidence region on the efficient set can be constructed if the scaled error field (over the scalarization parameter) associated with the estimated efficient set converges weakly to a mean-zero Gaussian process. The main result in this paper proves such a ``Central Limit Theorem.'' A corresponding result on the scaled error field of the image of the efficient set also holds, leading to an analogous confidence region on the Pareto set. The suggested confidence regions are still hypothetical in that they may be infinite-dimensional and therefore not computable, an issue under ongoing investigation.
@inproceedings{2022hunpasWSC,
Year = {2022},
Author = {S. R. Hunter and R. Pasupathy},
Title = {Central {L}imit {T}heorems for constructing confidence regions in strictly convex multi-objective simulation optimization},
Booktitle = {Proceedings of the 2022 Winter Simulation Conference},
Editor = {B. Feng and G. Pedrielli and Y. Peng and S. Shashaani and E. Song and C. G. Corlu and L. H. Lee and E. P. Chew and T. Roeder and P Lendermann},
Publisher = {IEEE},
Address = {Piscataway, NJ},
doi = {10.1109/WSC57314.2022.10015390},
pages = {3015--3026},
url_Paper = {http://web.ics.purdue.edu/~hunter63/PAPERS/pre2022hunpasWSC.pdf},
abstract = {We consider the context of multi-objective simulation optimization (MOSO) with strictly convex objectives. We show that under certain types of scalarizations, a $(1-\alpha)$-confidence region on the efficient set can be constructed if the scaled error field (over the scalarization parameter) associated with the estimated efficient set converges weakly to a mean-zero Gaussian process. The main result in this paper proves such a ``Central Limit Theorem.'' A corresponding result on the scaled error field of the image of the efficient set also holds, leading to an analogous confidence region on the Pareto set. The suggested confidence regions are still hypothetical in that they may be infinite-dimensional and therefore not computable, an issue under ongoing investigation.},
keywords = {simulation or stochastic optimization > multi-objective > continuous}}Downloads: 2
{"_id":"DjoSQc44nL9Aq39g7","bibbaseid":"hunter-pasupathy-centrallimittheoremsforconstructingconfidenceregionsinstrictlyconvexmultiobjectivesimulationoptimization-2022","author_short":["Hunter, S. R.","Pasupathy, R."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","year":"2022","author":[{"firstnames":["S.","R."],"propositions":[],"lastnames":["Hunter"],"suffixes":[]},{"firstnames":["R."],"propositions":[],"lastnames":["Pasupathy"],"suffixes":[]}],"title":"Central Limit Theorems for constructing confidence regions in strictly convex multi-objective simulation optimization","booktitle":"Proceedings of the 2022 Winter Simulation Conference","editor":[{"firstnames":["B."],"propositions":[],"lastnames":["Feng"],"suffixes":[]},{"firstnames":["G."],"propositions":[],"lastnames":["Pedrielli"],"suffixes":[]},{"firstnames":["Y."],"propositions":[],"lastnames":["Peng"],"suffixes":[]},{"firstnames":["S."],"propositions":[],"lastnames":["Shashaani"],"suffixes":[]},{"firstnames":["E."],"propositions":[],"lastnames":["Song"],"suffixes":[]},{"firstnames":["C.","G."],"propositions":[],"lastnames":["Corlu"],"suffixes":[]},{"firstnames":["L.","H."],"propositions":[],"lastnames":["Lee"],"suffixes":[]},{"firstnames":["E.","P."],"propositions":[],"lastnames":["Chew"],"suffixes":[]},{"firstnames":["T."],"propositions":[],"lastnames":["Roeder"],"suffixes":[]},{"firstnames":["P"],"propositions":[],"lastnames":["Lendermann"],"suffixes":[]}],"publisher":"IEEE","address":"Piscataway, NJ","doi":"10.1109/WSC57314.2022.10015390","pages":"3015–3026","url_paper":"http://web.ics.purdue.edu/~hunter63/PAPERS/pre2022hunpasWSC.pdf","abstract":"We consider the context of multi-objective simulation optimization (MOSO) with strictly convex objectives. We show that under certain types of scalarizations, a $(1-α)$-confidence region on the efficient set can be constructed if the scaled error field (over the scalarization parameter) associated with the estimated efficient set converges weakly to a mean-zero Gaussian process. The main result in this paper proves such a ``Central Limit Theorem.'' A corresponding result on the scaled error field of the image of the efficient set also holds, leading to an analogous confidence region on the Pareto set. The suggested confidence regions are still hypothetical in that they may be infinite-dimensional and therefore not computable, an issue under ongoing investigation.","keywords":"simulation or stochastic optimization > multi-objective > continuous","bibtex":"@inproceedings{2022hunpasWSC,\n\tYear = {2022},\n\tAuthor = {S. R. Hunter and R. Pasupathy},\n\tTitle = {Central {L}imit {T}heorems for constructing confidence regions in strictly convex multi-objective simulation optimization},\n\tBooktitle = {Proceedings of the 2022 Winter Simulation Conference},\n\tEditor = {B. Feng and G. Pedrielli and Y. Peng and S. Shashaani and E. Song and C. G. Corlu and L. H. Lee and E. P. Chew and T. Roeder and P Lendermann},\n\tPublisher = {IEEE},\n Address = {Piscataway, NJ},\n\tdoi = {10.1109/WSC57314.2022.10015390},\n\tpages = {3015--3026},\n\turl_Paper = {http://web.ics.purdue.edu/~hunter63/PAPERS/pre2022hunpasWSC.pdf},\n\tabstract = {We consider the context of multi-objective simulation optimization (MOSO) with strictly convex objectives. We show that under certain types of scalarizations, a $(1-\\alpha)$-confidence region on the efficient set can be constructed if the scaled error field (over the scalarization parameter) associated with the estimated efficient set converges weakly to a mean-zero Gaussian process. The main result in this paper proves such a ``Central Limit Theorem.'' A corresponding result on the scaled error field of the image of the efficient set also holds, leading to an analogous confidence region on the Pareto set. The suggested confidence regions are still hypothetical in that they may be infinite-dimensional and therefore not computable, an issue under ongoing investigation.},\n\tkeywords = {simulation or stochastic optimization > multi-objective > continuous}}\n\t\n","author_short":["Hunter, S. R.","Pasupathy, R."],"editor_short":["Feng, B.","Pedrielli, G.","Peng, Y.","Shashaani, S.","Song, E.","Corlu, C. G.","Lee, L. H.","Chew, E. P.","Roeder, T.","Lendermann, P"],"key":"2022hunpasWSC","id":"2022hunpasWSC","bibbaseid":"hunter-pasupathy-centrallimittheoremsforconstructingconfidenceregionsinstrictlyconvexmultiobjectivesimulationoptimization-2022","role":"author","urls":{" paper":"http://web.ics.purdue.edu/~hunter63/PAPERS/pre2022hunpasWSC.pdf"},"keyword":["simulation or stochastic optimization > multi-objective > continuous"],"metadata":{"authorlinks":{}},"downloads":2},"bibtype":"inproceedings","biburl":"http://web.ics.purdue.edu/~hunter63/PAPERS/srhunterweb.bib","dataSources":["ZEwmdExPMCtzAbo22","PkcXzWbdqPvM6bmCx"],"keywords":["simulation or stochastic optimization > multi-objective > continuous"],"search_terms":["central","limit","theorems","constructing","confidence","regions","strictly","convex","multi","objective","simulation","optimization","hunter","pasupathy"],"title":"Central Limit Theorems for constructing confidence regions in strictly convex multi-objective simulation optimization","year":2022,"downloads":3}