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
The current bottleneck in gMAM is the interpolation step which has to be doen every optimization step. This also makes it that any other solver than gradient descent and LBGFS is not usable in the current implementation with Optim.jl. The reason why we have to interpolate is to make the path equidistant to allow for easy integration needed for the action. Is this the only reason? In case so we could opt for non-equidistant integration to compute the action.
The text was updated successfully, but these errors were encountered:
having equidistant of gMAM is a feature rather than a bug. Otherwise they bunch up. In the gMAM rework #25 the interpolation is not the bottleneck anymore
The current bottleneck in gMAM is the interpolation step which has to be doen every optimization step. This also makes it that any other solver than gradient descent and LBGFS is not usable in the current implementation with Optim.jl. The reason why we have to interpolate is to make the path equidistant to allow for easy integration needed for the action. Is this the only reason? In case so we could opt for non-equidistant integration to compute the action.
The text was updated successfully, but these errors were encountered: