Shadow Simulated Annealing algorithm: a new tool for global optimisation and statistical inference

07/15/2019
by   R. Stoica, et al.
0

This paper develops a new global optimisation method that applies to a family of criteria that are not entirely known. This family includes the criteria obtained from the class of posteriors that have nor-malising constants that are analytically not tractable. The procedure applies to posterior probability densities that are continuously differen-tiable with respect to their parameters. The proposed approach avoids the re-sampling needed for the classical Monte Carlo maximum likelihood inference, while providing the missing convergence properties of the ABC based methods. Results on simulated data and real data are presented. The real data application fits an inhomogeneous area interaction point process to cosmological data. The obtained results validate two important aspects of the galaxies distribution in our Universe : proximity of the galaxies from the cosmic filament network together with territorial clustering at given range of interactions. Finally, conclusions and perspectives are depicted.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2018

A simulated annealing procedure based on the ABC Shadow algorithm for statistical inference of point processes

Recently a new algorithm for sampling posteriors of unnormalised probabi...
research
06/06/2020

On a family that unifies Generalized Marshall-Olkin and Poisson-G family of distribution

Unifying the generalized Marshall-Olkin (GMO) and Poisson-G (P-G) a new ...
research
09/30/2020

Some Remarks on Replicated Simulated Annealing

Recently authors have introduced the idea of training discrete weights n...
research
02/11/2020

Generalized Poisson Difference Autoregressive Processes

This paper introduces a new stochastic process with values in the set Z ...
research
04/01/2019

Robust Optimisation Monte Carlo

This paper is on Bayesian inference for parametric statistical models th...
research
12/29/2019

Stochastic Approximation EM for Exploratory Item Factor Analysis

The stochastic approximation EM algorithm (SAEM) is described for the es...
research
12/02/2019

Clustering via Ant Colonies: Parameter Analysis and Improvement of the Algorithm

An ant colony optimization approach for partitioning a set of objects is...

Please sign up or login with your details

Forgot password? Click here to reset