Negative association, ordering and convergence of resampling methods
From MaRDI portal
Publication:2313285
DOI10.1214/18-AOS1746zbMath1429.62154arXiv1707.01845WikidataQ127815103 ScholiaQ127815103MaRDI QIDQ2313285
Nick Whiteley, Nicolas Chopin, Mathieu Gerber
Publication date: 18 July 2019
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.01845
Inference from stochastic processes and prediction (62M20) Nonparametric statistical resampling methods (62G09) Signal detection and filtering (aspects of stochastic processes) (60G35)
Related Items (22)
An Invitation to Sequential Monte Carlo Samplers ⋮ Population Quasi-Monte Carlo ⋮ Global Consensus Monte Carlo ⋮ Unbiased simulation of rare events in continuous time ⋮ Cost free hyper-parameter selection/averaging for Bayesian inverse problems with vanilla and Rao-blackwellized SMC samplers ⋮ Properties of marginal sequential Monte Carlo methods ⋮ Sequential Monte Carlo samplers to fit and compare insurance loss models ⋮ The divide-and-conquer sequential Monte Carlo algorithm: theoretical properties and limit theorems ⋮ Random assignment versus fixed assignment in multilevel importance splitting for estimating stochastic reach probabilities ⋮ A Particle Method for Solving Fredholm Equations of the First Kind ⋮ Controlled sequential Monte Carlo ⋮ A Practical Example for the Non-linear Bayesian Filtering of Model Parameters ⋮ Multilevel Sequential Importance Sampling for Rare Event Estimation ⋮ Unnamed Item ⋮ Limit theorems for cloning algorithms ⋮ Optimal potential functions for the interacting particle system method ⋮ Simple conditions for convergence of sequential Monte Carlo genealogies with applications ⋮ Particle methods for stochastic differential equation mixed effects models ⋮ Application of the interacting particle system method to piecewise deterministic Markov processes used in reliability ⋮ Negative association, ordering and convergence of resampling methods ⋮ Sequential Monte Carlo samplers with independent Markov chain Monte Carlo proposals ⋮ On resampling schemes for particle filters with weakly informative observations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on auxiliary particle filters
- Pointwise smoothness of space-filling functions
- The weighted bootstrap
- A comparison theorem on moment inequalities between negatively associated and independent random variables
- Negative association of random variables, with applications
- Negative association, ordering and convergence of resampling methods
- Recursive Monte Carlo filters: algorithms and theoretical analysis
- Central limit theorem for sequential Monte Carlo methods and its application to Bayesian inference
- Inference in hidden Markov models.
- Convergence of sequential quasi-Monte Carlo smoothing algorithms
- Sampling algorithms.
- Sequential Monte Carlo Methods in Practice
- Van der Corput and Golden Ratio Sequences Along the Hilbert Space-Filling Curve
- Empirical Processes in Survey Sampling with (Conditional) Poisson Designs
- Negative Dependence and Srinivasan's Sampling Process
- Variance Reduction via Lattice Rules
- Particle Markov Chain Monte Carlo for Efficient Numerical Simulation
- Positive Influence and Negative Dependence
- On the auxiliary particle filter
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Unequal probability sampling without replacement through a splitting method
- Asymptotic Statistics
- Sequential Monte Carlo Methods for Dynamic Systems
- Filtering via Simulation: Auxiliary Particle Filters
- Balls and bins: A study in negative dependence
- A survey of convergence results on particle filtering methods for practitioners
- Sequential Quasi Monte Carlo
- Extensible Grids: Uniform Sampling on a Space Filling Curve
- Functions of bounded variation, signed measures, and a general Koksma–Hlawka inequality
- On the Theory of Systematic Sampling, I
This page was built for publication: Negative association, ordering and convergence of resampling methods
