Our choice to study the frustrated-loop algorithm on a bipartite graph is due to the ease of theoretical analysis, and its direct application to RBM pre-training (see Section ). However, the algorithm can be easily applied to any connected graph that is not acyclic [1]}. One simply has to detect a sufficient number of random cycles on the graph, and generate a frustrated loop on each cycle by setting one of its edges to \(-1\)  and the rest to \(+1\) .
