Minimum-Probability-Flow-Learning
Minimum-Probability-Flow-Learning copied to clipboard
Objective Function for Ising
In the ising-objective, how did from equation (1) where x' is in non data states becomes summation over all bit flips in equation (4). Ideally, we should only consider $n$ such that $x + d(x, n)$ is not in data states.
Am I saying right in this ?