IDEAS home Printed from https://ideas.repec.org/p/cte/wsrepe/ws110402.html
   My bibliography  Save this paper

Interacting multiple -- Try algorithms with different proposal distributions

Author

Listed:
  • Casarin, Roberto
  • Craiu, Radu
  • Leisen, Fabrizio

Abstract

We propose a new class of interacting Markov chain Monte Carlo (MCMC) algorithms designed for increasing the efficiency of a modified multiple-try Metropolis (MTM) algorithm. The extension with respect to the existing MCMC literature is twofold. The sampler proposed extends the basic MTM algorithm by allowing different proposal distributions in the multipletry generation step. We exploit the structure of the MTM algorithm with different proposal distributions to naturally introduce an interacting MTM mechanism (IMTM) that expands the class of population Monte Carlo methods and builds connections with the rapidly expanding world of adaptive MCMC. We show the validity of the algorithm and discuss the choice of the selection weights and of the different proposals. We provide numerical studies which show that the new algorithm can perform better than the basic MTM algorithm and that the interaction mechanism allows the IMTM to efficiently explore the state space.

Suggested Citation

  • Casarin, Roberto & Craiu, Radu & Leisen, Fabrizio, 2011. "Interacting multiple -- Try algorithms with different proposal distributions," DES - Working Papers. Statistics and Econometrics. WS ws110402, Universidad Carlos III de Madrid. Departamento de Estadística.
    • Handle: RePEc:cte:wsrepe:ws110402
    as

    Download full text from publisher

    File URL: https://e-archivo.uc3m.es/bitstream/handle/10016/10683/ws110402.pdf?sequence=1
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Billio, Monica & Casarin, Roberto & Osuntuyi, Anthony, 2016. "Efficient Gibbs sampling for Markov switching GARCH models," Computational Statistics & Data Analysis, Elsevier, vol. 100(C), pages 37-57.
    2. Fabrizio Leisen & Roberto Casarin & David Luengo & Luca Martino, 2013. "Adaptive Sticky Generalized Metropolis," Working Papers 2013:19, Department of Economics, University of Venice "Ca' Foscari".
    3. Luca Martino & Jesse Read, 2013. "On the flexibility of the design of multiple try Metropolis schemes," Computational Statistics, Springer, vol. 28(6), pages 2797-2823, December.

    More about this item

    Keywords

    Interacting Monte Carlo;

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cte:wsrepe:ws110402. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Ana Poveda (email available below). General contact details of provider: http://portal.uc3m.es/portal/page/portal/dpto_estadistica .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.