An Introspective on the Retrospective-approximation Paradigm. Pasupathy, R. In Jain, S., Creasey, R. R., Himmelspach, J., White, K. P., & Fu, M., editors, Proceedings of the 2011 Winter Simulation Conference, pages 412–421, Piscataway, NJ, 2011. Institute of Electrical and Electronics Engineers, Inc.. Paper abstract bibtex Retrospective Approximation (RA) is a solution paradigm introduced in the early 1990s by Chen and Schmeiser for solving one-dimensional stochastic root finding problems (SRFPs). The RA paradigm can be thought of as a refined and implementable version of sample average approximation, where a sequence of approximate problems are strategically generated and solved to identify iterates that progressively approach the desired solution. While originally aimed at one-dimensional SRFPs, the paradigm's broader utility, particularly within general simulation optimization algorithms, is becoming increasingly evident. We discuss the RA paradigm, demonstrate its usefulness, present the key results and papers on the topic over the last fifteen years, and speculate fruitful future directions.
@inproceedings{2011pasWSC,
author = {R. Pasupathy},
title = {An Introspective on the Retrospective-approximation Paradigm},
booktitle = {Proceedings of the 2011 Winter Simulation Conference},
Publisher = {Institute of Electrical and Electronics Engineers, Inc.},
Address = {Piscataway, NJ},
editor = {S. Jain and R. R. Creasey and J. Himmelspach and K. P. White and M. Fu},
pages = {412--421},
year = {2011},
url = {http://www.informs-sim.org/wsc11papers/035.pdf},
keywords = {retrospective approximation, stochastic root-finding},
abstract = {Retrospective Approximation (RA) is a solution paradigm introduced in the early 1990s by Chen and Schmeiser for solving one-dimensional stochastic root finding problems (SRFPs). The RA paradigm can be thought of as a refined and implementable version of sample average approximation, where a sequence of approximate problems are strategically generated and solved to identify iterates that progressively approach the desired solution. While originally aimed at one-dimensional SRFPs, the paradigm's broader utility, particularly within general simulation optimization algorithms, is becoming increasingly evident. We discuss the RA paradigm, demonstrate its usefulness, present the key results and papers on the topic over the last fifteen years, and speculate fruitful future directions.}}
%------ 2010 ------------------
Downloads: 0
{"_id":"wakv4XdEFtRHLe4E5","bibbaseid":"pasupathy-anintrospectiveontheretrospectiveapproximationparadigm-2011","author_short":["Pasupathy, R."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["R."],"propositions":[],"lastnames":["Pasupathy"],"suffixes":[]}],"title":"An Introspective on the Retrospective-approximation Paradigm","booktitle":"Proceedings of the 2011 Winter Simulation Conference","publisher":"Institute of Electrical and Electronics Engineers, Inc.","address":"Piscataway, NJ","editor":[{"firstnames":["S."],"propositions":[],"lastnames":["Jain"],"suffixes":[]},{"firstnames":["R.","R."],"propositions":[],"lastnames":["Creasey"],"suffixes":[]},{"firstnames":["J."],"propositions":[],"lastnames":["Himmelspach"],"suffixes":[]},{"firstnames":["K.","P."],"propositions":[],"lastnames":["White"],"suffixes":[]},{"firstnames":["M."],"propositions":[],"lastnames":["Fu"],"suffixes":[]}],"pages":"412–421","year":"2011","url":"http://www.informs-sim.org/wsc11papers/035.pdf","keywords":"retrospective approximation, stochastic root-finding","abstract":"Retrospective Approximation (RA) is a solution paradigm introduced in the early 1990s by Chen and Schmeiser for solving one-dimensional stochastic root finding problems (SRFPs). The RA paradigm can be thought of as a refined and implementable version of sample average approximation, where a sequence of approximate problems are strategically generated and solved to identify iterates that progressively approach the desired solution. While originally aimed at one-dimensional SRFPs, the paradigm's broader utility, particularly within general simulation optimization algorithms, is becoming increasingly evident. We discuss the RA paradigm, demonstrate its usefulness, present the key results and papers on the topic over the last fifteen years, and speculate fruitful future directions.","bibtex":"@inproceedings{2011pasWSC,\n\tauthor = {R. Pasupathy},\n\ttitle = {An Introspective on the Retrospective-approximation Paradigm},\n\tbooktitle = {Proceedings of the 2011 Winter Simulation Conference},\n\tPublisher = {Institute of Electrical and Electronics Engineers, Inc.},\n\tAddress = {Piscataway, NJ},\n\teditor = {S. Jain and R. R. Creasey and J. Himmelspach and K. P. White and M. Fu},\n\tpages = {412--421},\n\tyear = {2011},\n\turl = {http://www.informs-sim.org/wsc11papers/035.pdf},\n\tkeywords = {retrospective approximation, stochastic root-finding},\n\tabstract = {Retrospective Approximation (RA) is a solution paradigm introduced in the early 1990s by Chen and Schmeiser for solving one-dimensional stochastic root finding problems (SRFPs). The RA paradigm can be thought of as a refined and implementable version of sample average approximation, where a sequence of approximate problems are strategically generated and solved to identify iterates that progressively approach the desired solution. While originally aimed at one-dimensional SRFPs, the paradigm's broader utility, particularly within general simulation optimization algorithms, is becoming increasingly evident. We discuss the RA paradigm, demonstrate its usefulness, present the key results and papers on the topic over the last fifteen years, and speculate fruitful future directions.}}\n\n%------ 2010 ------------------\n\n","author_short":["Pasupathy, R."],"editor_short":["Jain, S.","Creasey, R. R.","Himmelspach, J.","White, K. P.","Fu, M."],"key":"2011pasWSC","id":"2011pasWSC","bibbaseid":"pasupathy-anintrospectiveontheretrospectiveapproximationparadigm-2011","role":"author","urls":{"Paper":"http://www.informs-sim.org/wsc11papers/035.pdf"},"keyword":["retrospective approximation","stochastic root-finding"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"web.ics.purdue.edu/~pasupath/rpVitapublist.bib","dataSources":["Q4TNB6PfH2Ne5F2fj"],"keywords":["retrospective approximation","stochastic root-finding"],"search_terms":["introspective","retrospective","approximation","paradigm","pasupathy"],"title":"An Introspective on the Retrospective-approximation Paradigm","year":2011}