Mixed integer programming formulation of unsupervised learning
arXiv:2001.07278
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.