Mixed integer programming formulation of unsupervised learning

01/20/2020
by   Arturo Berrones-Santos, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2021

The Graphical Traveling Salesperson Problem has no Integer Programming Formulation in the Original Space

The Graphical Traveling Salesperson Problem (GTSP) is the problem of ass...
research
05/28/2012

A Mixed Integer Programming Model Formulation for Solving the Lot-Sizing Problem

This paper addresses a mixed integer programming (MIP) formulation for t...
research
03/07/2018

A Bayesian framework for molecular strain identification from mixed diagnostic samples

We provide a mathematical formulation and develop a computational framew...
research
09/30/2020

Optimal Control of Industrial Assembly Lines

This paper discusses the problem of assembly line control and introduces...
research
09/12/2019

New Formulation of Mixed-Integer Conic Programming for Globally Optimal Grasp Planning

We present a two-level branch-and-bound (BB) algorithm to compute the gl...
research
02/15/2023

Variable Selection for Kernel Two-Sample Tests

We consider the variable selection problem for two-sample tests, aiming ...
research
07/01/2023

Solving break minimization problems in mirrored double round-robin tournament with QUBO solver

The break minimization problem is a fundamental problem in sports schedu...

Please sign up or login with your details

Forgot password? Click here to reset