Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.10777 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- The concepts of linkage, building blocks, and problem decomposition have long existed in the genetic algorithm field and have guided the development of model-based genetic algorithms for decades. However, their definitions are usually vague, making it difficult to develop theoretical support. This paper provides an algorithm-independent definition to describe the concept of linkage. With this definition, the paper proves that any problem with a bounded degree of linkage is decomposable and that proper problem decomposition is possible via linkage learning. The way of decomposition given in this paper also offers a new perspective on nearly decomposable problems with bounded difficulty and building blocks from the theoretical aspect. Finally, this paper relates problem decomposition to probably approximately correct (PAC) learning and proves that the global optima of problems with bounded decomposition difficulty are PAC learnable and the decomposition is decidable in polynomial time under certain conditions.