27

Mixed integer programming formulation of unsupervised learning

Abstract

A novel formulation and training procedure for full Boltzmann machines in terms of a mixed binary quadratic feasibility problem is given. As a proof of concept, the theory is analytically and numerically tested on XOR patterns.

View on arXiv
Comments on this paper