Mateusz Zaborski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mateusz Zaborski has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Jacek Mańdziuk
Warsaw University of Technology
6 shared publications - Michał Okulewicz
Warsaw University of Technology
2 shared publications - Marcin Woźniak
Faculty of Applied Mathematics, Silesian University of Technology, Gliwice, Poland
1 shared publication Michał Okulewicz
Faculty of Mathematics and Information Science , Warsaw University of Technology , Poland
1 shared publication
Latest Publications
- 24 January 2023
- Published by Springer Nature
- p. 265-276
LQ-R-SHADE: R-SHADE with Quadratic Surrogate Model
- 24 January 2023
- Published by Springer Nature
- p. 265-276
LQ-R-SHADE: R-SHADE with Quadratic Surrogate Model
- 4 November 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 131
Multidimensional Red Fox meta-heuristic for complex optimization
- 4 November 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 131
Multidimensional Red Fox meta-heuristic for complex optimization
- 21 October 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 131
Self-Adapting Particle Swarm Optimization for continuous black box optimization
- 21 October 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 131
Self-Adapting Particle Swarm Optimization for continuous black box optimization
- 14 August 2022
- Published by Springer Nature
- p. 146-159
Surrogate-Assisted LSHADE Algorithm Utilizing Recursive Least Squares Filter
- 14 August 2022
- Published by Springer Nature
- p. 146-159
Surrogate-Assisted LSHADE Algorithm Utilizing Recursive Least Squares Filter
- Open Access
- 1 September 2020
- Published by Walter de Gruyter GmbH in Foundations of Computing and Decision Sciences
- Vol. 45 (3) , 233-254
Analysis of statistical model-based optimization enhancements in Generalized Self-Adapting Particle Swarm Optimization framework
This paper presents characteristics of model-based optimization methods utilized within the Generalized Self-Adapting Particle Swarm Optimization (GA– PSO) – a hybrid global optimization framework proposed by the authors. GAPSO has been designed as a generalization of a Particle Swarm Optimization (PSO) algorithm on the foundations of a large degree of independence of individual particles. GAPSO serves as a platform for studying optimization algorithms in the context of the following research hypothesis: (1) it is possible to improve the performance of an optimization algorithm through utilization of more function samples than standard PSO sample-based memory, (2) combining specialized sampling methods (i.e. PSO, Differential Evolution, model-based optimization) will result in a better algorithm performance than using each of them separately. The inclusion of model-based enhancements resulted in the necessity of extending the GAPSO framework by means of an external samples memory - this enhanced model is referred to as M-GAPSO in the paper. We investigate the features of two model-based optimizers: one utilizing a quadratic function and the other one utilizing a polynomial function. We analyze the conditions under which those model-based approaches provide an effective sampling strategy. Proposed model-based optimizers are evaluated on the functions from the COCO BBOB benchmark set.
- 1 September 2020
- Published by Walter de Gruyter GmbH in Foundations of Computing and Decision Sciences
- Vol. 45 (3) , 233-254
Open AccessAnalysis of statistical model-based optimization enhancements in Generalized Self-Adapting Particle Swarm Optimization framework
This paper presents characteristics of model-based optimization methods utilized within the Generalized Self-Adapting Particle Swarm Optimization (GA– PSO) – a hybrid global optimization framework proposed by the authors. GAPSO has been designed as a generalization of a Particle Swarm Optimization (PSO) algorithm on the foundations of a large degree of independence of individual particles. GAPSO serves as a platform for studying optimization algorithms in the context of the following research hypothesis: (1) it is possible to improve the performance of an optimization algorithm through utilization of more function samples than standard PSO sample-based memory, (2) combining specialized sampling methods (i.e. PSO, Differential Evolution, model-based optimization) will result in a better algorithm performance than using each of them separately. The inclusion of model-based enhancements resulted in the necessity of extending the GAPSO framework by means of an external samples memory - this enhanced model is referred to as M-GAPSO in the paper. We investigate the features of two model-based optimizers: one utilizing a quadratic function and the other one utilizing a polynomial function. We analyze the conditions under which those model-based approaches provide an effective sampling strategy. Proposed model-based optimizers are evaluated on the functions from the COCO BBOB benchmark set.
- Open Access
Generalized Self-Adapting Particle Swarm Optimization algorithm with archive of samples
In this paper we enhance Generalized Self-Adapting Particle Swarm Optimization algorithm (GAPSO), initially introduced at the Parallel Problem Solving from Nature 2018 conference, and to investigate its properties. The research on GAPSO is underlined by the two following assumptions: (1) it is possible to achieve good performance of an optimization algorithm through utilization of all of the gathered samples, (2) the best performance can be accomplished by means of a combination of specialized sampling behaviors (Particle Swarm Optimization, Differential Evolution, and locally fitted square functions). From a software engineering point of view, GAPSO considers a standard Particle Swarm Optimization algorithm as an ideal starting point for creating a generalpurpose global optimization framework. Within this framework hybrid optimization algorithms are developed, and various additional techniques (like algorithm restart management or adaptation schemes) are tested. The paper introduces a new version of the algorithm, abbreviated as M-GAPSO. In comparison with the original GAPSO formulation it includes the following four features: a global restart management scheme, samples gathering within an R-Tree based index (archive/memory of samples), adaptation of a sampling behavior based on a global particle performance, and a specific approach to local search. The above-mentioned enhancements resulted in improved performance of M-GAPSO over GAPSO, observed on both COCO BBOB testbed and in the black-box optimization competition BBComp. Also, for lower dimensionality functions (up to 5D) results of M-GAPSO are better or comparable to the state-of-the art version of CMA-ES (namely the KL-BIPOP-CMA-ES algorithm presented at the GECCO 2017 conference).
Open AccessGeneralized Self-Adapting Particle Swarm Optimization algorithm with archive of samples
In this paper we enhance Generalized Self-Adapting Particle Swarm Optimization algorithm (GAPSO), initially introduced at the Parallel Problem Solving from Nature 2018 conference, and to investigate its properties. The research on GAPSO is underlined by the two following assumptions: (1) it is possible to achieve good performance of an optimization algorithm through utilization of all of the gathered samples, (2) the best performance can be accomplished by means of a combination of specialized sampling behaviors (Particle Swarm Optimization, Differential Evolution, and locally fitted square functions). From a software engineering point of view, GAPSO considers a standard Particle Swarm Optimization algorithm as an ideal starting point for creating a generalpurpose global optimization framework. Within this framework hybrid optimization algorithms are developed, and various additional techniques (like algorithm restart management or adaptation schemes) are tested. The paper introduces a new version of the algorithm, abbreviated as M-GAPSO. In comparison with the original GAPSO formulation it includes the following four features: a global restart management scheme, samples gathering within an R-Tree based index (archive/memory of samples), adaptation of a sampling behavior based on a global particle performance, and a specific approach to local search. The above-mentioned enhancements resulted in improved performance of M-GAPSO over GAPSO, observed on both COCO BBOB testbed and in the black-box optimization competition BBComp. Also, for lower dimensionality functions (up to 5D) results of M-GAPSO are better or comparable to the state-of-the art version of CMA-ES (namely the KL-BIPOP-CMA-ES algorithm presented at the GECCO 2017 conference).