We summarize the analysis step with deterministic maps in Algorithm .
Note that
there are many possible variations for the definition
of the prior-to-posterior update (REF ).
Most notably, \(\smash{\widehat{\mathcal {T}}}\)  need not
approximate
a KR rearrangement:
in fact any map that pushes forward \(\eta \)  to \(\pi _S\)  would work,
e.g.,
maps induced by the flows of ODEs
[1]}, [2]}, [3]}
or
by the composition of many simple functions [4]}, [5]}, including deep neural networks [6]}.
