Dynamic State Space Partitioning for Adaptive Simulation Algorithms

Adaptive simulation algorithms can automatically change their configuration during runtime to adapt to changing computational demands of a simulation, e.g., triggered by a changing number of model entities or the execution of a rare event. These algorithms can improve the performance of simulations. They can also reduce the configuration effort of the user. By using such algorithms with machine learning techniques, the advantages come with a cost, i.e., the algorithm needs time to learn good adaptation policies and it must be equipped with the ability to observe its environment. An important challenge is to partition the observations to suitable macro states to improve the effectiveness and efficiency of the learning algorithm. Typically, aggregation algorithms, e.g., the adaptive vector quantization algorithm (AVQ), that dynamically partition the state space during runtime are preferred here. In this paper, we integrate the AVQ into an adaptive simulation algorithm.