Michal Witold Przewozniczek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Michal Witold Przewozniczek has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Marcin Michal Komarnicki
Wroclaw University of Science and Technology, Wroclaw, Poland
13 shared publications - Renato Tinós
University of São Paulo
13 shared publications - Francisco Chicano
Universidad de Málaga
8 shared publications - Krzysztof Walkowiak
Department of Systems and Computer Networks, Wrocaw University of Science and Technology, Wrocaw, Poland
8 shared publications - Bartosz Frej
Wroclaw University of Science and Technology, Wroclaw, Poland
5 shared publications - Agata M. Wijata
Silesian University of Technology, Gliwice, Poland
4 shared publications
Latest Publications
- 25 August 2026
- Published by Springer Nature
- p. 616-632
Untangling the Tapestry: k-Bounded Problems and Local Optima Networks
- 25 August 2026
- Published by Springer Nature
- p. 616-632
Untangling the Tapestry: k-Bounded Problems and Local Optima Networks
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 377-380
An Approach to Estimating Variable Importance in Genetic Algorithms with Different Mutation Rates
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 377-380
Open AccessAn Approach to Estimating Variable Importance in Genetic Algorithms with Different Mutation Rates
- Open Access
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 645-653
Limited Perfect Monotonical Surrogates Constructed Using Low-Cost Recursive Linkage Discovery with Guaranteed Output
Surrogates provide a cheap solution evaluation and offer significant leverage for optimizing computationally expensive problems. Usually, surrogates only approximate the original function. Recently, the perfect linear surrogates were proposed that ideally represent the original function. These surrogates do not mimic the original function. In fact, they are another (correct) representation of it and enable a wide range of possibilities, e.g., discovering the optimized function for problems where the direct transformation of the encoded solution into its evaluation is not available. However, many real-world problems can not be represented by linear models, making the aforementioned surrogates inapplicable. Therefore, we propose the Limited Monotonical Perfect Surrogate (LyMPuS), which overcomes this difficulty and enables the comparison of two solutions that differ by a single variable. Our proposition is suitable for limiting the cost of expensive local search procedures. The proposed surrogate is parameterless and can be trained on the fly without any separate surrogate-building step. It uses only the necessary fitness evaluations, and the already-paid costs are not wasted when the model is updated. Finally, it offers low-cost missing-linkage detection and low-cost linkage discovery, guaranteed to find a missing dependency in no more than 2⌈log2(n)⌉ steps.
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 645-653
Open AccessLimited Perfect Monotonical Surrogates Constructed Using Low-Cost Recursive Linkage Discovery with Guaranteed Output
Surrogates provide a cheap solution evaluation and offer significant leverage for optimizing computationally expensive problems. Usually, surrogates only approximate the original function. Recently, the perfect linear surrogates were proposed that ideally represent the original function. These surrogates do not mimic the original function. In fact, they are another (correct) representation of it and enable a wide range of possibilities, e.g., discovering the optimized function for problems where the direct transformation of the encoded solution into its evaluation is not available. However, many real-world problems can not be represented by linear models, making the aforementioned surrogates inapplicable. Therefore, we propose the Limited Monotonical Perfect Surrogate (LyMPuS), which overcomes this difficulty and enables the comparison of two solutions that differ by a single variable. Our proposition is suitable for limiting the cost of expensive local search procedures. The proposed surrogate is parameterless and can be trained on the fly without any separate surrogate-building step. It uses only the necessary fitness evaluations, and the already-paid costs are not wasted when the model is updated. Finally, it offers low-cost missing-linkage detection and low-cost linkage discovery, guaranteed to find a missing dependency in no more than 2⌈log2(n)⌉ steps.
- Open Access
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 636-644
The hop-like problem nature -- unveiling and modelling new features of real-world problems
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 636-644
Open AccessThe hop-like problem nature -- unveiling and modelling new features of real-world problems
- 30 January 2026
- Published by Springer Nature
- p. 607-622
Variable Importance and Interaction in Differential Evolution: Online Learning and a New Recombination Operator
- 30 January 2026
- Published by Springer Nature
- p. 607-622
Variable Importance and Interaction in Differential Evolution: Online Learning and a New Recombination Operator
- Open Access
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Granular Linkage Blocks - the gates to the Granular Function Form
Solving complex problems with Evolutionary Algorithms (EAs) efficiently and effectively often requires linkagebased variation, where variables are dependent because they together have a non-linear influence on the optimized function and, therefore, should be processed jointly. In black-box optimization, dependencies must first be discovered and then used during variation. Traditional linkage-learning techniques focus on discovering whether any two variables are dependent. While already powerful, this has its limitations, particularly when subfunctions overlap, making it difficult to decide which subsets of variables (masks) to process jointly. Limiting masks only to variables relevant to the optimization process increases the chance of finding improvement by variation operators. Some irrelevant dependencies can be eliminated by concerning the nonmonotonical instead of the non-linear influence of variable pairs on function value. However, the generalized subfunction-based representations that consider the non-monotonical dependencies are unavailable. Therefore, we propose the granular form of a function, a new concept aiming at representing the optimized problem in a subfunction-based manner that is convenient when non-monotonical dependencies are considered. We also propose a new approach to identify the Granular Linkage Blocks (GLBs), the argument sets of the granular form subfunctions. Using GLBs, we develop new variation operators and incorporate them into a new parameter-less optimizer. The experiments considering a large suite of well-known benchmarks confirm that exploiting the concepts arising from granular form provides better results than other state-of-the-art linkage-learning EAs.
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessGranular Linkage Blocks - the gates to the Granular Function Form
Solving complex problems with Evolutionary Algorithms (EAs) efficiently and effectively often requires linkagebased variation, where variables are dependent because they together have a non-linear influence on the optimized function and, therefore, should be processed jointly. In black-box optimization, dependencies must first be discovered and then used during variation. Traditional linkage-learning techniques focus on discovering whether any two variables are dependent. While already powerful, this has its limitations, particularly when subfunctions overlap, making it difficult to decide which subsets of variables (masks) to process jointly. Limiting masks only to variables relevant to the optimization process increases the chance of finding improvement by variation operators. Some irrelevant dependencies can be eliminated by concerning the nonmonotonical instead of the non-linear influence of variable pairs on function value. However, the generalized subfunction-based representations that consider the non-monotonical dependencies are unavailable. Therefore, we propose the granular form of a function, a new concept aiming at representing the optimized problem in a subfunction-based manner that is convenient when non-monotonical dependencies are considered. We also propose a new approach to identify the Granular Linkage Blocks (GLBs), the argument sets of the granular form subfunctions. Using GLBs, we develop new variation operators and incorporate them into a new parameter-less optimizer. The experiments considering a large suite of well-known benchmarks confirm that exploiting the concepts arising from granular form provides better results than other state-of-the-art linkage-learning EAs.
- Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 238-249
Conditional Direct Empirical Linkage Discovery for Solving Multi-Structured Problems
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 238-249
Open AccessConditional Direct Empirical Linkage Discovery for Solving Multi-Structured Problems
- Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 250-261
Empirical Linkage Discovery in Bi-Objective Optimization
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 250-261
Open AccessEmpirical Linkage Discovery in Bi-Objective Optimization