You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
-`t1`, `t2` : are define the timeinterval [t1,t2] within which the constraints are imposed onto the system,
@@ -28,5 +28,10 @@ where
28
28
-`reweight`: boolean indicating whether reweighting of forward trajectories is necessary, i.e. when:
29
29
- path constraints are relevant for the problem,
30
30
- the target is a non typical system state and the forward flow will be sampled as a reweighted Brownian bridge,
31
-
32
-
-`U` : function handle representing the path constraints, i.e. U(x,t) = ( x - sin(t) )^2 <imgsrc="https://latex.codecogs.com/svg.latex?\Large&space;U(x,t) = ( x - sin(t) )^2"title="path" />
31
+
-`U` : function handle representing the path constraints, i.e. <imgsrc="https://render.githubusercontent.com/render/math?math=U(x,t) = ( x - sin(t) )^2"> ,
32
+
-`dens_est` : idicator determining the method to be employed for the logarithmic gradient (score) estimation. Currently supported:
33
+
-`nonparametric` : for nonparametric sparse kernel estimation,
34
+
-`reject` : boolean variable determining whether rejection of backward trajectories failing to reach the initial condition will take place
35
+
(this is mostly used as an indicator of numerical instabilities - if everything runs smoothly 1 or 2 trajectories need to be deleted, but often none of them
36
+
if more trajectories get deleted, then rerun the computation with more particles N)
0 commit comments