Conference paper · 2013 · Open access
Time dependent global optimization via Bayesian inference and Sequential Monte Carlo sampling
Annals of Computer Science and Information Systems, 363–370 · Published 1 September 2013
In brief
“Time dependent global optimization via Bayesian inference and Sequential Monte Carlo sampling” is a 2013 conference paper by Piotr Kopka and 2 co-authors, published in Annals of Computer Science and Information Systems. OpenAlex counts 0 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at Annals of Computer Science and Information Systems.
- Citations
- 0
- References
- 9
- Authors
- 3
Abstract
—In many areas of application it is important to estimate unknown model parameters in order to model precisely the underlying dynamics of a physical system. In recent years, Sequential Monte Carlo (SMC) methods have become a very popular tool for Bayesian parameter estimation. In this case, the problem of finding the best parameters configuration comes to the optimization issue which is to determine the best fit. In this paper, the application of this approach to the classical global optimization problem is described. We consider the situation when optimized functions are dynamical i.e. the global extremum is changing in time. For this purpose, we adapt two dimensional Ackley and four-dimensional Wood functions. Our aim is to find the most probable localization of the extremum in each time with the use of the Bayesian approach joined with the Markov Chain Monte Carlo (MCMC) and SMC algorithms. We propose a mechanism for dynamic tuning of the proposal distribution in SMC. The approach is based on the Metropolis-Hastings algo-rithm, combined with a resampling mechanism to achieve better results. We have examined different version of the proposed SMC and MCMC algorithms in terms of effectiveness to estimate the probabilistic distributions. The effect is demonstrated using two benchmark optimization problems. Computed results show that the proposed mechanisms can significantly improve optimization results compared to standard MCMC. I.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Kopka, P., Wawrzynczak, A., & Borysiewicz, M. J. (2013). Time dependent global optimization via Bayesian inference and Sequential Monte Carlo sampling. Annals of Computer Science and Information Systems, 363–370. https://fedcsis.org/proceedings/2013/pliks/338.pdf
MLA 9
Kopka, Piotr, et al. “Time dependent global optimization via Bayesian inference and Sequential Monte Carlo sampling.” Annals of Computer Science and Information Systems, 2013, pp. 363–370. https://fedcsis.org/proceedings/2013/pliks/338.pdf.
Chicago
Kopka, Piotr, Anna Wawrzynczak, and Mieczysław Józef Borysiewicz. 2013. “Time dependent global optimization via Bayesian inference and Sequential Monte Carlo sampling.” Annals of Computer Science and Information Systems: 363–370. https://fedcsis.org/proceedings/2013/pliks/338.pdf.
Harvard
Kopka, P., Wawrzynczak, A. and Borysiewicz, M. J. (2013) ‘Time dependent global optimization via Bayesian inference and Sequential Monte Carlo sampling’, Annals of Computer Science and Information Systems, pp. 363–370. Available at: https://fedcsis.org/proceedings/2013/pliks/338.pdf.
IEEE
P. Kopka, A. Wawrzynczak, and M. J. Borysiewicz, “Time dependent global optimization via Bayesian inference and Sequential Monte Carlo sampling,” Annals of Computer Science and Information Systems, pp. 363–370, 2013.
BibTeX
@inproceedings{kopka2013time,
title = {{Time dependent global optimization via Bayesian inference and Sequential Monte Carlo sampling}},
author = {Kopka, Piotr and Wawrzynczak, Anna and Borysiewicz, Mieczysław Józef},
booktitle = {Annals of Computer Science and Information Systems},
year = {2013},
pages = {363--370},
url = {https://fedcsis.org/proceedings/2013/pliks/338.pdf}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Statistics and Probability › Markov Chains and Monte Carlo Methods
- sequential Monte Carlo
- Bayesian parameter estimation
- Markov chain Monte Carlo
- Metropolis-Hastings algorithm
- resampling
- Ackley function
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Kopka, P., Wawrzynczak, A., & Borysiewicz, M. J. (2013). Time dependent global optimization via Bayesian inference and Sequential Monte Carlo sampling. Annals of Computer Science and Information Systems, 363–370. https://fedcsis.org/proceedings/2013/pliks/338.pdf
How many times has this paper been cited?
0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Annals of Computer Science and Information Systems: sign in and open the full text from this page.
Who wrote this paper?
Piotr Kopka, Anna Wawrzynczak, Mieczysław Józef Borysiewicz.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.