π€ AI Summary
This work addresses the inefficiency of existing time-sensitive importance splitting methods, which rely on single-sample timer values to assess state importance and often fail to reach high-importance states, resulting in excessive unproductive simulations. To overcome this limitation, the paper proposes a novel approach that integrates conditional resampling with global age information. The method introduces an importance evaluation mechanism based on feasible timer sets, incorporates a global age-based pruning strategy, and establishes a unified distance metric encompassing timer boundaries, resampling events, and global age. This integrated framework substantially enhances the accuracy of importance splitting estimators and demonstrates markedly superior performance over conventional techniques in models with unbounded timers.
π Abstract
Importance splitting (ISPLIT) evaluates the probabilities of rare events in non-Markovian models. It requires a heuristic importance function (IFUN) that estimates the distance to the target. While including timer evaluations in the IFUN can substantially improve the effectiveness of ISPLIT, the existing time-sensitive IFUNs evaluate simulation states with respect to single sampled timer values. Thus, reaching highly important states requires simultaneously sampling specific combinations of timer values, yielding several unproductive simulation runs. In this paper, we revisit time-sensitive ISPLIT with the goal of steering simulation runs towards important states. First, we study how timer values can be resampled conditioned on the elapsed time. The importance can be evaluated by considering the set of feasible timer values, decoupling importance estimation from timer samples. Second, we exploit the global age of a simulation to identify and prune the executions that can no longer reach the target within the remaining time budget. Together, these ideas lead to a taxonomy of distance metrics clarifying the role of timer bounds, resampling, and the global age. In particular, for models with unbounded timers, we show that time-sensitive IFUNs collapse to ordinary IFUNs under resampling. Experiments demonstrate that the proposed formulations substantially improve the accuracy of ISPLIT estimators.