Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities
From MaRDI portal
Publication:892799
DOI10.1007/s11222-013-9384-6zbMath1325.62153OpenAlexW2087822012MaRDI QIDQ892799
Sooyoung Cheon, Faming Liang, Kai Yu, Yuguo Chen
Publication date: 12 November 2015
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-013-9384-6
Computational methods in Markov chains (60J22) Sampling theory, sample surveys (62D05) Monte Carlo methods (65C05) Stochastic approximation (62L20) Contingency tables (62H17)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting
- Trajectory averaging for stochastic approximation MCMC algorithms
- Computing p-values in conditional independence models for a contingency table
- Free energy methods for Bayesian inference: efficient exploration of univariate Gaussian mixture posteriors
- Improving SAMC using smoothing methods: Theory and applications to Bayesian model selection problems
- On the use of stochastic approximation Monte Carlo for Monte Carlo integration
- Data-swapping: A technique for disclosure control
- Markov bases for decomposable graphical models
- Algebraic algorithms for sampling from conditional distributions
- Stochastic approximation and its applications
- Negative examples for sequential importance sampling of binary contingency tables
- Efficient importance sampling for binary contingency tables
- The Wang-Landau algorithm reaches the flat histogram criterion in finite time
- Markov bases of three-way tables are arbitrarily complicated
- A theory on flat histogram Monte Carlo algorithms
- Sequential importance sampling for multiway tables
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Sampling large tables with constraints
- Sequential Monte Carlo Samplers
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- A network algorithm for the exact treatment of the 2×k contingency table
- An importance sampling algorithm for exact conditional tests in log-linear models
- Dynamically Weighted Importance Sampling in Monte Carlo Computation
- Equation of State Calculations by Fast Computing Machines
- Convergence of the Wang-Landau algorithm
- Stochastic Approximation in Monte Carlo Computation
- Stability of Stochastic Approximation under Verifiable Conditions
- Simulation and the Monte Carlo Method
- Monte Carlo sampling methods using Markov chains and their applications
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- A Generalized Wang–Landau Algorithm for Monte Carlo Computation
- A Stochastic Approximation Method
- Sampling binary contingency tables with a greedy start
