Assessing Search and Unsupervised Clustering Algorithms in Nested Sampling - Oxydes en basses dimensions Access content directly
Journal Articles Entropy Year : 2023

Assessing Search and Unsupervised Clustering Algorithms in Nested Sampling


Nested sampling is an efficient method for calculating Bayesian evidence in data analysis and partition functions of potential energies. It is based on an exploration using a dynamical set of sampling points that evolves to higher values of the sampled function. When several maxima are present, this exploration can be a very difficult task. Different codes implement different strategies. Local maxima are generally treated separately, applying cluster recognition of the sampling points based on machine learning methods. We present here the development and implementation of different search and clustering methods on the nested_fit code. Slice sampling and the uniform search method are added in addition to the random walk already implemented. Three new cluster recognition methods are also developed. The efficiency of the different strategies, in terms of accuracy and number of likelihood calls, is compared considering a series of benchmark tests, including model comparison and a harmonic energy potential. Slice sampling proves to be the most stable and accurate search strategy. The different clustering methods present similar results but with very different computing time and scaling. Different choices of the stopping criterion of the algorithm, another critical issue of nested sampling, are also investigated with the harmonic energy potential.
Fichier principal
Vignette du fichier
2023_E_Maillard.pdf (2.91 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03988205 , version 1 (14-02-2023)



Lune Maillard, Fabio Finocchi, Martino Trassinelli. Assessing Search and Unsupervised Clustering Algorithms in Nested Sampling. Entropy, 2023, 25 (2), pp.347. ⟨10.3390/e25020347⟩. ⟨hal-03988205⟩
36 View
15 Download



Gmail Facebook X LinkedIn More