paper-with-me

Papers

Statistical Distance Based Deterministic Offspring Selection in SMC Methods

2022-12-23 · Oskar Kviman, Hazal Koptagel, Harald Melin, Jens Lagergren

Over the years, sequential Monte Carlo (SMC) and, equivalently, particle filter (PF) theory has gained substantial attention from researchers. However, the performance of the resampling methodology, also known as offspring selection, has not advanced recently. We propose two deterministic offspring selection methods, which strive to minimize the Kullback-Leibler (KL) divergence and the total variation (TV) distance, respectively, between the particle distribution prior and subsequent to the offspring selection. By reducing the statistical distance between the selected offspring and the joint distribution, we obtain a heuristic search procedure that performs superior to a maximum likelihood search in precisely those contexts where the latter performs better than an SMC. For SMC and particle Markov chain Monte Carlo (pMCMC), our proposed offspring selection methods always outperform or compare favorably with the two state-of-the-art resampling schemes on two models commonly used as benchmarks from the literature.

📄 PDF Abstract BibTeX arXiv:2212.12290

Code (0)

등록된 구현이 없습니다.

Tasks

Heuristic Search

Similar Papers 제목 키워드 기반

Dynamic sampling bias and overdispersion induced by skewed offspring distributions

2021-03-10 · Takashi Okada, Oskar Hallatschek

Natural populations often show enhanced genetic drift consistent with a strong skew in their offspring number distribution. The skew arises because the variability of family sizes is either inherently strong or amplified…

Preselection via Classification: A Case Study on Evolutionary Multiobjective Optimization

2017-08-03 · Jinyuan Zhang, Aimin Zhou, Ke Tang, Guixu Zhang

In evolutionary algorithms, a preselection operator aims to select the promising offspring solutions from a candidate offspring set. It is usually based on the estimated or real objective values of the candidate offsprin…

ClassificationEvolutionary AlgorithmsGeneral ClassificationMultiobjective Optimization

On the Success Rate of Crossover Operators for Genetic Programming with Offspring Selection

2013-09-23 · Gabriel Kronberger, Stephan Winkler, Michael Affenzeller, Andreas Beham 외

Genetic programming is a powerful heuristic search technique that is used for a number of real world applications to solve among others regression, classification, and time-series forecasting problems. A lot of progress …

Heuristic SearchTime SeriesTime Series AnalysisTime Series Forecasting

A generalized Price equation for fuzzy set-mappings

2023-12-20 · Matthias Borgstede

The Price equation provides a formal account of selection building on a right-total mapping between two classes of individuals, that is usually interpreted as a parent-offspring relation. This paper presents a new formul…

Guaranteed Deterministic Bounds on the Total Variation Distance between Univariate Mixtures

2018-06-29 · Frank Nielsen, Ke Sun

The total variation distance is a core statistical distance between probability measures that satisfies the metric axioms, with value always falling in $[0,1]$. This distance plays a fundamental role in machine learning …

Two-sample testing