Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon

11/15/2018
by   Yoshua Bengio, et al.
0

This paper surveys the recent attempts, both from the machine learning and operations research communities, at leveraging machine learning to solve combinatorial optimization problems. Given the hard nature of these problems, state-of-the-art methodologies involve algorithmic decisions that either require too much computing time or are not mathematically well defined. Thus, machine learning looks like a promising candidate to effectively deal with those decisions. We advocate for pushing further the integration of machine learning and combinatorial optimization and detail methodology to do so. A main point of the paper is seeing generic optimization problems as data points and inquiring what is the relevant distribution of problems to use for learning on a given task.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/22/2020

Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networking

Existing approaches to solving combinatorial optimization problems on gr...
research
09/06/2023

A Josephson Parametric Oscillator-Based Ising Machine

Ising machines have emerged as a promising solution for rapidly solving ...
research
03/01/2012

Statistical Approach for Selecting Elite Ants

Applications of ACO algorithms to obtain better solutions for combinator...
research
06/21/2021

Matrix Encoding Networks for Neural Combinatorial Optimization

Machine Learning (ML) can help solve combinatorial optimization (CO) pro...
research
11/18/2020

Distributed Injection-Locking in Analog Ising Machines to Solve Combinatorial Optimizations

The oscillator-based Ising machine (OIM) is a network of coupled CMOS os...
research
09/09/2019

Combining Learned Representations for Combinatorial Optimization

We propose a new approach to combine Restricted Boltzmann Machines (RBMs...

Please sign up or login with your details

Forgot password? Click here to reset