We propose a new propagation algorithm for the minimization of the Bethe free energy for a generic lattice model with pair interactions. The algorithm turns out to be more stable than belief propagation, as it reaches a fixed point also for highly frustrated systems such as spin glasses, and faster than the provably convergent double loop algorithms.
Stable propagation algorithm for the minimization of the Bethe free energy
Pretti M;
2003
Abstract
We propose a new propagation algorithm for the minimization of the Bethe free energy for a generic lattice model with pair interactions. The algorithm turns out to be more stable than belief propagation, as it reaches a fixed point also for highly frustrated systems such as spin glasses, and faster than the provably convergent double loop algorithms.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
