Learning What to Defer for Maximum Independent Sets

06/17/2020
by   Sungsoo Ahn, et al.
0

Designing efficient algorithms for combinatorial optimization appears ubiquitously in various scientific fields. Recently, deep reinforcement learning (DRL) frameworks have gained considerable attention as a new approach: they can automate the design of a solver while relying less on sophisticated domain knowledge of the target problem. However, the existing DRL solvers determine the solution using a number of stages proportional to the size of the solution, which severely limits their applicability to large-scale graphs. In this paper, we seek to resolve this issue by proposing a novel DRL scheme where the agent adaptively shrinks or stretch the number of stages by learning to defer the determination of the solution at each stage. We apply the proposed framework, coined Learning what to Defer (LwD), to the maximum independent set (MIS) problem, and demonstrate its significant improvement over the current state-of-the-art DRL scheme. We also show that LwD can outperform the conventional MIS solvers on large-scale graphs having millions of vertices, under a limited time budget.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/08/2022

DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems

Recently, deep reinforcement learning (DRL) models have shown promising ...
research
06/02/2023

Symmetric Exploration in Combinatorial Optimization is Free!

Recently, deep reinforcement learning (DRL) has shown promise in solving...
research
10/14/2022

ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning

Online social platforms have become more and more popular, and the disse...
research
09/27/2021

DRL-based Slice Placement under Realistic Network Load Conditions

We propose to demonstrate a network slice placement optimization solutio...
research
08/09/2023

Correlation-diversified portfolio construction by finding maximum independent set in large-scale market graph

Correlation-diversified portfolios can be constructed by finding the max...
research
09/09/2021

DAN: Decentralized Attention-based Neural Network to Solve the MinMax Multiple Traveling Salesman Problem

The multiple traveling salesman problem (mTSP) is a well-known NP-hard p...
research
03/21/2021

Robust Multi-Modal Policies for Industrial Assembly via Reinforcement Learning and Demonstrations: A Large-Scale Study

Over the past several years there has been a considerable research inves...

Please sign up or login with your details

Forgot password? Click here to reset