Sequential Entropy Pooling Heuristics

9 Pages Posted: 5 Oct 2021 Last revised: 11 Aug 2023

Date Written: October 5, 2021


This article introduces two sequential heuristics that are designed to overcome some of the practical limitations of the Entropy Pooling (EP) method. Both heuristics repeatedly apply EP to sequentially arrive at the posterior probability and usually lead to significantly better solutions than the original approach. In some cases, the sequential heuristics coincide with the original method, while they automatically ensure logical consistency in others. They are also able to solve interesting and practically relevant problems that the original approach simply cannot. Given the benefits of the sequential heuristics, this article argues that they should become the standard for future EP applications.

Documented Python code that replicates the results of the original approach is available in the open-source package More information about the package can be found on

Keywords: Entropy Pooling, relative entropy, Kullback-Leibler divergence, change of measure, market views, stress-tests, Monte Carlo simulation, nonlinear convex optimization, heuristic algorithms, Python Programming Language.

JEL Classification: C02, C11, C61, G1

Suggested Citation

Vorobets, Anton, Sequential Entropy Pooling Heuristics (October 5, 2021). Available at SSRN: or

Anton Vorobets (Contact Author)

Fortitudo Technologies ( email )

Østre Stationsvej 39B, 8. th.
Odense C, 5000


Do you have negative results from your research you’d like to share?

Paper statistics

Abstract Views
PlumX Metrics