Lets say I have a function $f(X) = f(x_1,...,x_N)$ to be integrated. But unlike time discrete methods, my integrator uses quantisation to advance time, that is if $|x - q| > dQ$, with $q$ being the quantised version of $x$ and $dQ$ being the quantum.
To achieve this, the function needs to send $f(X)$, $f'(X)$, and $f''(x)$ to the integrator, which determines the time step, $t = \sqrt[3]{( dQ \frac{3}{f''(x)} )}$, from the 2nd derivative (of the derivative function $f$) and after $t$ units time sends back the updated (integrated) value ($[v,mv,pv]$ ~ value, 1st & 2nd quantized derivative values of $f$).
In the paper, $f'$ is approximated by calculating
$c_j = [ f(X) - f(X^*)]/ (x_j - x^*_j)$ for each updated value $x^*_j$
and then
$f' = \sum( c_j ) \cdot mv$,
But in the reference implementation, they update all values, and then simply calculate
$f' = f(X) - f(X^*) / 10^{-16} $(and so on for the 2nd derivative)
I'm unsure on which way would be preferable, the first approach using $2m$ evaluations, the second one just calls $f$ twice.
Which way would be better for non-linear function approximation?, given that it needs to be accurate only within the quantum bounds (which are generally small,. e.g $0.0001 \cdot |f(X)|$ )
Hint: this is a discrete event method, large jumps might be present.