A direct local search method and its application to a markovian model
|A direct local search method and its application to a markovian model
|Year of Publication
|Taushanov, Z, Berchtold, A
|Statistics, Optimization & Information Computing
|heuristic, Hidden Mixture Transition Distribution (HMTD) model, hill-climbing method, longitudinal data, optimization
While the hidden mixture transition distribution (HMTD) model is a powerful framework for the description, analysis, and classification of longitudinal sequences of continuous data, it is notoriously difficult to estimate because of the complexity of its solution space. In this paper, we explore how a new heuristic specifically developed for the HMTD performs compared to different standard optimization algorithms. This specific heuristic can be classified as a hill-climbing method, and different variants are proposed, including a jittering procedure to escape local maxima and measures to speed up the convergence.Different popular approaches are used for comparison, including PSO, SA, GA, NM, L-BFGS-B, and DE. The same HMTD model was optimized on different datasets and the results were compared in terms of both fit to the data and estimated parameters. Even if the complexity of the problem implies that no one algorithm can be considered as an overall best, our heuristic performed well in all situations, leading to useful solutions in terms of both fit and interpretability.