Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising

05/09/2020
by   Xiaotian Hao, et al.
0

Bipartite b-matching is fundamental in algorithm design, and has been widely applied into economic markets, labor markets, etc. These practical problems usually exhibit two distinct features: large-scale and dynamic, which requires the matching algorithm to be repeatedly executed at regular intervals. However, existing exact and approximate algorithms usually fail in such settings due to either requiring intolerable running time or too much computation resource. To address this issue, we propose NeuSearcher which leverages the knowledge learned from previously instances to solve new problem instances. Specifically, we design a multichannel graph neural network to predict the threshold of the matched edges weights, by which the search region could be significantly reduced. We further propose a parallel heuristic search algorithm to iteratively improve the solution quality until convergence. Experiments on both open and industrial datasets demonstrate that NeuSearcher can speed up 2 to 3 times while achieving exactly the same matching solution compared with the state-of-the-art approximation approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

page 7

research
06/04/2014

Cascading A*: a Parallel Approach to Approximate Heuristic Search

In this paper, we proposed a new approximate heuristic search algorithm:...
research
05/22/2020

Neural Bipartite Matching

Graph neural networks have found application for learning in the space o...
research
01/30/2018

A distributed-memory approximation algorithm for maximum weight perfect bipartite matching

We design and implement an efficient parallel approximation algorithm fo...
research
03/05/2023

Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale

The problem of packing equal circles in a circle is a classic and famous...
research
04/20/2022

Scalable Motif Counting for Large-scale Temporal Graphs

One fundamental problem in temporal graph analysis is to count the occur...
research
08/09/2023

A Hierarchical Destroy and Repair Approach for Solving Very Large-Scale Travelling Salesman Problem

For prohibitively large-scale Travelling Salesman Problems (TSPs), exist...
research
09/07/2019

Algorithms for Optimal Diverse Matching

Bipartite b-matching, where agents on one side of a market are matched t...

Please sign up or login with your details

Forgot password? Click here to reset