scientific article; zbMATH DE number 6781368
From MaRDI portal
Publication:5361314
zbMath1433.68394arXiv1505.02827MaRDI QIDQ5361314
Rémi Bardenet, Arnaud Doucet, Christopher C. Holmes
Publication date: 27 September 2017
Full work available at URL: https://arxiv.org/abs/1505.02827
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods in Markov chains (60J22) Bayesian inference (62F15) Computational aspects of data analysis and big data (68T09)
Related Items (41)
Piecewise deterministic Markov processes for continuous-time Monte Carlo ⋮ Piecewise deterministic Markov processes for scalable Monte Carlo on restricted domains ⋮ Distributed Bayesian Inference in Linear Mixed-Effects Models ⋮ The Block-Poisson Estimator for Optimally Tuned Exact Subsampling MCMC ⋮ An Approach to Incorporate Subsampling Into a Generic Bayesian Hierarchical Model ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Adaptive schemes for piecewise deterministic Monte Carlo algorithms ⋮ Markov chain Monte Carlo approach to the analysis of response patterns in data collection process ⋮ A two-stage adaptive Metropolis algorithm ⋮ Distributed computation for marginal likelihood based model choice ⋮ When ecological individual heterogeneity models and large data collide: an importance sampling approach ⋮ Divide-and-conquer Metropolis-Hastings samplers with matched samples ⋮ Variational Bayes in State Space Models: Inferential and Predictive Accuracy ⋮ Efficient Bayesian shape-restricted function estimation with constrained Gaussian process priors ⋮ Improving sampling accuracy of stochastic gradient MCMC methods via non-uniform subsampling of gradients ⋮ Lévy Langevin Monte Carlo ⋮ Bayes in action in deep learning and dictionary learning ⋮ Perturbation theory for Markov chains via Wasserstein distance ⋮ Subsampling sequential Monte Carlo for static Bayesian models ⋮ Efficient MCMC for Gibbs random fields using pre-computation ⋮ Theoretical properties of quasi-stationary Monte Carlo methods ⋮ Principles of experimental design for big data analysis ⋮ Joining and splitting models with Markov melding ⋮ Unnamed Item ⋮ Two-stage Metropolis-Hastings for tall data ⋮ Leave Pima Indians alone: binary regression as a benchmark for Bayesian computation ⋮ The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method ⋮ Stochastic gradient Langevin dynamics with adaptive drifts ⋮ Speeding Up MCMC by Efficient Data Subsampling ⋮ Subsampling MCMC -- an introduction for the survey statistician ⋮ Unnamed Item ⋮ Irreversible samplers from jump and continuous Markov processes ⋮ Informed sub-sampling MCMC: approximate Bayesian inference for large datasets ⋮ Control variates for stochastic gradient MCMC ⋮ A sample covariance-based approach for spatial binary data ⋮ Laplacian Smoothing Stochastic Gradient Markov Chain Monte Carlo ⋮ Stochastic Gradient Markov Chain Monte Carlo ⋮ Unnamed Item
This page was built for publication:
