Reunderstanding Slice Sampling as Parallel MCMC

被引:0
|
作者
Tran, Khoa T. [1 ]
Ninness, Brett [1 ]
机构
[1] Univ Newcastle, Sch Elect Engn & Comp Sci, Callaghan, NSW 2308, Australia
关键词
MARKOV-CHAINS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A robust slice sampler, which guarantees no repeated samples, is found as a special case of Metropolis sampling that can interact with parallel chains to efficiently sample from multi-modal densities even with possibly isolated support sets. The algorithm is completely automated with no tuning required. Implications to particle filtering design for on-line state and parameter joint estimation is also discussed.
引用
收藏
页码:1197 / 1202
页数:6
相关论文
共 50 条
  • [31] Group Importance Sampling for particle filtering and MCMC
    Martino, Luca
    Elvira, Victor
    Camps-Valls, Gustau
    DIGITAL SIGNAL PROCESSING, 2018, 82 : 133 - 151
  • [32] Efficient MCMC sampling in dynamic mixture models
    Fiorentini, Gabriele
    Planas, Christophe
    Rossi, Alessandro
    STATISTICS AND COMPUTING, 2014, 24 (01) : 77 - 89
  • [33] Bayesian estimation of chirplet signals by MCMC sampling
    Lin, CC
    Djuric, PM
    2001 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-VI, PROCEEDINGS: VOL I: SPEECH PROCESSING 1; VOL II: SPEECH PROCESSING 2 IND TECHNOL TRACK DESIGN & IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS NEURALNETWORKS FOR SIGNAL PROCESSING; VOL III: IMAGE & MULTIDIMENSIONAL SIGNAL PROCESSING MULTIMEDIA SIGNAL PROCESSING, 2001, : 3129 - 3132
  • [34] MCMC curve sampling and geometric conditional simulation
    Fan, Ayres
    Fisher, John W., III
    Kane, Jonathan
    Willsky, Alan S.
    COMPUTATIONAL IMAGING VI, 2008, 6814
  • [35] Efficient MCMC sampling in dynamic mixture models
    Gabriele Fiorentini
    Christophe Planas
    Alessandro Rossi
    Statistics and Computing, 2014, 24 : 77 - 89
  • [36] MCMC Sampling Statistical Method to Solve the Optimization
    Rong, Tengzhong
    Xiao, Zhi
    FRONTIERS OF MANUFACTURING AND DESIGN SCIENCE II, PTS 1-6, 2012, 121-126 : 937 - 941
  • [37] A Comparison of MCMC Sampling for Probabilistic Logic Programming
    Azzolini, Damiano
    Riguzzi, Fabrizio
    Masotti, Franco
    Lamma, Evelina
    ADVANCES IN ARTIFICIAL INTELLIGENCE, AI*IA 2019, 2019, 11946 : 18 - 29
  • [38] Finding Network Motifs Using MCMC Sampling
    Saha, Tanay Kumar
    Al Hasan, Mohammad
    COMPLEX NETWORKS VI, 2015, 597 : 13 - 24
  • [39] Advanced MCMC methods for sampling on diffusion pathspace
    Beskos, Alexandros
    Kalogeropoulos, Konstantinos
    Pazos, Erik
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2013, 123 (04) : 1415 - 1453
  • [40] Improving MCMC, using efficient importance sampling
    Liesenfeld, Roman
    Richard, Jean-Francois
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2008, 53 (02) : 272 - 288