Experience-based Optimization: A Coevolutionary Approach

by   Shengcai Liu, et al.

This paper studies improving solvers based on their past solving experiences, and focuses on improving solvers by offline training. Specifically, the key issues of offline training methods are discussed, and research belonging to this category but from different areas are reviewed in a unified framework. Existing training methods generally adopt a two-stage strategy in which selecting the training instances and training instances are treated in two independent phases. This paper proposes a new training method, dubbed LiangYi, which addresses these two issues simultaneously. LiangYi includes a training module for a population-based solver and an instance sampling module for updating the training instances. The idea behind LiangYi is to promote the population-based solver by training it (with the training module) to improve its performance on those instances (discovered by the sampling module) on which it performs badly, while keeping the good performances obtained by it on previous instances. An instantiation of LiangYi on the Travelling Salesman Problem is also proposed. Empirical results on a huge testing set containing 10000 instances showed LiangYi could train solvers that perform significantly better than the solvers trained by other state-of-the-art training method. Moreover, empirical investigation of the behaviours of LiangYi confirmed it was able to continuously improve the solver through training.


page 1

page 2

page 3

page 4


Automatic Construction of Parallel Portfolios via Explicit Instance Grouping

Simultaneously utilizing several complementary solvers is a simple yet e...

DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability

The most successful parallel SAT and MaxSAT solvers follow a portfolio a...

Occam Learning Meets Synthesis Through Unification

The generalizability of PBE solvers is the key to the empirical synthesi...

An Enhanced Features Extractor for a Portfolio of Constraint Solvers

Recent research has shown that a single arbitrarily efficient solver can...

Core Challenge 2022: Solver and Graph Descriptions

This paper collects all descriptions of solvers and ISR instances submit...

Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem

In this work we focus on the well-known Euclidean Traveling Salesperson ...

Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization

We consider the maximum-a-posteriori inference problem in discrete graph...

Please sign up or login with your details

Forgot password? Click here to reset