메뉴 건너뛰기




Volumn 54, Issue 3, 2006, Pages 489-504

Adaptive importance sampling technique for Markov chains using stochastic approximation

Author keywords

Probability: Markov processes; Queues: Markovian; Simulation: efficiency

Indexed keywords

ADAPTIVE ALGORITHMS; APPROXIMATION THEORY; ASYMPTOTIC STABILITY; MARKOV PROCESSES; OPERATIONS RESEARCH; RANDOM PROCESSES;

EID: 33744819512     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1060.0291     Document Type: Article
Times cited : (59)

References (36)
  • 1
    • 33744819512 scopus 로고    scopus 로고
    • Adaptive importance sampling technique for Markov chains using stochastic approximation. Online companion
    • Ahamed, T. P. I., V. S. Borkar, S. Juneja. 2006. Adaptive importance sampling technique for Markov chains using stochastic approximation. Online companion. Oper. Res. http://or.pubs.informs.org/Pages/collect.html.
    • (2006) Oper. Res.
    • Ahamed, T.P.I.1    Borkar, V.S.2    Juneja, S.3
  • 2
    • 0000025104 scopus 로고
    • On the choice of alternative measures in importance sampling with Markov chains
    • Andradottir, S., D. P. Heyman, T. Ott. 1995. On the choice of alternative measures in importance sampling with Markov chains. Oper. Res. 43(3) 509-519.
    • (1995) Oper. Res. , vol.43 , Issue.3 , pp. 509-519
    • Andradottir, S.1    Heyman, D.P.2    Ott, T.3
  • 5
    • 0000692542 scopus 로고
    • Exponential convergence for Monte Carlo particle transport
    • Booth, T. E. 1985. Exponential convergence for Monte Carlo particle transport. Trans. Amer. Nuclear Soc. 50 267-268.
    • (1985) Trans. Amer. Nuclear Soc. , vol.50 , pp. 267-268
    • Booth, T.E.1
  • 6
    • 0032075427 scopus 로고    scopus 로고
    • Asynchronous stochastic approximation
    • Borkar, V. S. 1998. Asynchronous stochastic approximation. SIAM J. Control Optim. 36 840-851.
    • (1998) SIAM J. Control Optim. , vol.36 , pp. 840-851
    • Borkar, V.S.1
  • 7
    • 0036003892 scopus 로고    scopus 로고
    • On the lock-in probability of stochastic approximation
    • Borkar, V. S. 2002. On the lock-in probability of stochastic approximation. Combinatorics, Probab. Comput. 11 11-20.
    • (2002) Combinatorics, Probab. Comput. , vol.11 , pp. 11-20
    • Borkar, V.S.1
  • 8
    • 0033876515 scopus 로고    scopus 로고
    • The O.D.E. method for convergence of stochastic approximation and reinforcement learning
    • Borkar, V. S., S. P. Meyn. 2000. The O.D.E. method for convergence of stochastic approximation and reinforcement learning. SIAM J. Control Optim. 38 447-469.
    • (2000) SIAM J. Control Optim. , vol.38 , pp. 447-469
    • Borkar, V.S.1    Meyn, S.P.2
  • 11
    • 0031258478 scopus 로고    scopus 로고
    • Perturbation realization, potentials, and sensitivity analysis of Markov processes
    • Cao, X. R., H. F. Chen. 1997. Perturbation realization, potentials, and sensitivity analysis of Markov processes. IEEE Trans. Automatic Control 42 1382-1393.
    • (1997) IEEE Trans. Automatic Control , vol.42 , pp. 1382-1393
    • Cao, X.R.1    Chen, H.F.2
  • 13
    • 0034430430 scopus 로고    scopus 로고
    • Adaptive importance sampling simulation of queueing networks
    • J. A. Joines, R. R. Barton, K. Kang, P. A. Fishwick, eds. IEEE Press, Piscataway, NJ
    • De Boer, P. T., V. F. Nicola, R. Y. Rubinstein. 2000. Adaptive importance sampling simulation of queueing networks. J. A. Joines, R. R. Barton, K. Kang, P. A. Fishwick, eds. Proc. 2000 Winter Simulation Conf. IEEE Press, Piscataway, NJ, 646-655.
    • (2000) Proc. 2000 Winter Simulation Conf. , pp. 646-655
    • De Boer, P.T.1    Nicola, V.F.2    Rubinstein, R.Y.3
  • 14
    • 84904773005 scopus 로고
    • Two models for analyzing the dynamics of adaptation algorithms
    • Derevitskii, D. P., A. L. Fradkov. 1974. Two models for analyzing the dynamics of adaptation algorithms. Automation Remote Control 35 59-67.
    • (1974) Automation Remote Control , vol.35 , pp. 59-67
    • Derevitskii, D.P.1    Fradkov, A.L.2
  • 15
    • 0035696492 scopus 로고    scopus 로고
    • A Markov chain perspective on adaptive Monte Carlo algorithms
    • B. A. Peters, J. S. Smith, D. J. Medeiros, M. H. Rohrer, eds. IEEE Press, Piscataway, NJ
    • Desai, P. Y., P. W. Glynn. 2001. A Markov chain perspective on adaptive Monte Carlo algorithms. B. A. Peters, J. S. Smith, D. J. Medeiros, M. H. Rohrer, eds. Proc. 2001 Winter Simulation Conf. IEEE Press, Piscataway, NJ, 379-384.
    • (2001) Proc. 2001 Winter Simulation Conf. , pp. 379-384
    • Desai, P.Y.1    Glynn, P.W.2
  • 17
    • 84976805635 scopus 로고
    • Analysis of an importance sampling estimator for tandem queues
    • Glasserman, P., S. G. Kau. 1995. Analysis of an importance sampling estimator for tandem queues. ACM TOMACS 5 22-42.
    • (1995) ACM TOMACS , vol.5 , pp. 22-42
    • Glasserman, P.1    Kau, S.G.2
  • 18
    • 0001240715 scopus 로고
    • Importance sampling for stochastic simulations
    • Glynn, P. W., D. L. Iglehart. 1989. Importance sampling for stochastic simulations. Management Sci. 35 1367-1392.
    • (1989) Management Sci. , vol.35 , pp. 1367-1392
    • Glynn, P.W.1    Iglehart, D.L.2
  • 19
    • 0042792856 scopus 로고
    • Conditions for the applicability of the regenerative method
    • Glynn, P. W., D. L. Iglehart. 1993. Conditions for the applicability of the regenerative method. Management Sci. 39 1108-1111.
    • (1993) Management Sci. , vol.39 , pp. 1108-1111
    • Glynn, P.W.1    Iglehart, D.L.2
  • 21
    • 84976842451 scopus 로고
    • Fast simulation of rare events in queuing and reliability models
    • Heidelberger, P. 1995. Fast simulation of rare events in queuing and reliability models. ACM Trans. Model. Comput. Simulation 5(1) 43-85.
    • (1995) ACM Trans. Model. Comput. Simulation , vol.5 , Issue.1 , pp. 43-85
    • Heidelberger, P.1
  • 22
    • 0036926602 scopus 로고    scopus 로고
    • Confidence regions for stochastic approximation algorithms
    • E. Yucesan, C.-H. Chen, J. L. Snowdon, J. M. Charnes, eds. IEEE Press, Piscataway, NJ
    • Hsieh, M., P. W. Glynn. 2002. Confidence regions for stochastic approximation algorithms. E. Yucesan, C.-H. Chen, J. L. Snowdon, J. M. Charnes, eds. Proc. 2002 Winter Simulation Conf. IEEE Press, Piscataway, NJ, 370-376.
    • (2002) Proc. 2002 Winter Simulation Conf. , pp. 370-376
    • Hsieh, M.1    Glynn, P.W.2
  • 23
    • 33744829164 scopus 로고    scopus 로고
    • Efficient simulation of buffer overflow probabilities in Jackson networks with feedback
    • Juneja, S., V. Nicola. 2005. Efficient simulation of buffer overflow probabilities in Jackson networks with feedback. ACM TOMACS 15(4) 281-315.
    • (2005) ACM TOMACS , vol.15 , Issue.4 , pp. 281-315
    • Juneja, S.1    Nicola, V.2
  • 24
    • 23044509088 scopus 로고    scopus 로고
    • Rare event simulation techniques: An introduction and recent advances
    • Shane Henderson, Barry Nelson, eds. Elsevier. Forthcoming
    • Juneja, S., P. Shahabuddin. 2005. Rare event simulation techniques: An introduction and recent advances. Shane Henderson, Barry Nelson, eds. Handbook on Simulation. Elsevier. Forthcoming.
    • (2005) Handbook on Simulation
    • Juneja, S.1    Shahabuddin, P.2
  • 25
    • 0033449589 scopus 로고    scopus 로고
    • Adaptive importance sampling on discrete Markov chains
    • Kollman, C., K. Baggerly, D. Cox, R. Picard. 1999. Adaptive importance sampling on discrete Markov chains. Ann. Appl. Probab. 9 391-412.
    • (1999) Ann. Appl. Probab. , vol.9 , pp. 391-412
    • Kollman, C.1    Baggerly, K.2    Cox, D.3    Picard, R.4
  • 26
    • 0343893613 scopus 로고    scopus 로고
    • Actor-critic-type learning algorithms for Markov decision processes
    • Konda, V. R., V. S. Borkar. 1999. Actor-critic-type learning algorithms for Markov decision processes. SIAM J. Control Optim. 38 94-123.
    • (1999) SIAM J. Control Optim. , vol.38 , pp. 94-123
    • Konda, V.R.1    Borkar, V.S.2
  • 27
    • 0029487791 scopus 로고
    • Optimal importance sampling for Markovian systems
    • Vancouver, British Columbia, Canada
    • Kuruganti, I., S. Strickland. 1995. Optimal importance sampling for Markovian systems. Proc. 1995 IEEE Conf. Systems, Man Cybernetics. Vancouver, British Columbia, Canada, 195-200.
    • (1995) Proc. 1995 IEEE Conf. Systems, Man Cybernetics , pp. 195-200
    • Kuruganti, I.1    Strickland, S.2
  • 28
    • 0030397758 scopus 로고    scopus 로고
    • Importance sampling for Markov chains: Computing variance and determining optimal measures
    • IEEE Press, Piscataway, NJ
    • Kuruganti, I., S. Strickland. 1996. Importance sampling for Markov chains: Computing variance and determining optimal measures. Proc. 1996 Winter Simulation Conf. IEEE Press, Piscataway, NJ, 273-280.
    • (1996) Proc. 1996 Winter Simulation Conf. , pp. 273-280
    • Kuruganti, I.1    Strickland, S.2
  • 31
    • 3042683131 scopus 로고    scopus 로고
    • Simulating rare events by combining temporal difference methods and importance sampling
    • Randhawa, R. S., S. Juneja. 2004. Simulating rare events by combining temporal difference methods and importance sampling. ACM TOMACS 14 1-30.
    • (2004) ACM TOMACS , vol.14 , pp. 1-30
    • Randhawa, R.S.1    Juneja, S.2
  • 32
    • 0032114627 scopus 로고    scopus 로고
    • Analytical mean squared error curves for temporal difference learning
    • Singh, S., P. Dayan. 1998. Analytical mean squared error curves for temporal difference learning. Machine Learn. 32 5-40.
    • (1998) Machine Learn. , vol.32 , pp. 5-40
    • Singh, S.1    Dayan, P.2
  • 33
    • 0034428724 scopus 로고    scopus 로고
    • Importance sampling in derivatives security pricing
    • J. A. Joines, R. R. Barton, K. Jang, P. A. Fishwick, eds. IEEE Press, Piscataway, NJ
    • Su, Y., M. C. Fu. 2000. Importance sampling in derivatives security pricing. J. A. Joines, R. R. Barton, K. Jang, P. A. Fishwick, eds. Proc. 2000 Winter Simulation Conf. IEEE Press, Piscataway, NJ, 587-596.
    • (2000) Proc. 2000 Winter Simulation Conf. , pp. 587-596
    • Su, Y.1    Fu, M.C.2
  • 34
    • 33744829659 scopus 로고    scopus 로고
    • Optimal importance sampling in securities pricing
    • Su, Y., M. C. Fu. 2002. Optimal importance sampling in securities pricing. J. Comput. Finance 5 27-50.
    • (2002) J. Comput. Finance , vol.5 , pp. 27-50
    • Su, Y.1    Fu, M.C.2
  • 35
    • 0028497630 scopus 로고
    • Asynchronous stochastic approximation and Q-learning
    • Tsitsiklis, J. T. 1994. Asynchronous stochastic approximation and Q-learning. Machine Learn. 16 185-202.
    • (1994) Machine Learn. , vol.16 , pp. 185-202
    • Tsitsiklis, J.T.1
  • 36
    • 0032257707 scopus 로고    scopus 로고
    • Accelerated simulation for pricing Asian options
    • D. J. Medeiros, E. F. Watson, J. S. Carson, M. S. Manivannan, eds. IEEE Press, Piscataway, NJ
    • Vázquez-Abad, F. J., D. Dufresne. 1998. Accelerated simulation for pricing Asian options. D. J. Medeiros, E. F. Watson, J. S. Carson, M. S. Manivannan, eds. Proc. 1998 Winter Simulation Conf. IEEE Press, Piscataway, NJ, 1493-1500.
    • (1998) Proc. 1998 Winter Simulation Conf. , pp. 1493-1500
    • Vázquez-Abad, F.J.1    Dufresne, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.