Faster Fundamental Graph Algorithms via Learned Predictions

04/26/2022
by   Justin Y. Chen, et al.
0

We consider the question of speeding up classic graph algorithms with machine-learned predictions. In this model, algorithms are furnished with extra advice learned from past or similar instances. Given the additional information, we aim to improve upon the traditional worst-case run-time guarantees. Our contributions are the following: (i) We give a faster algorithm for minimum-weight bipartite matching via learned duals, improving the recent result by Dinitz, Im, Lavastida, Moseley and Vassilvitskii (NeurIPS, 2021); (ii) We extend the learned dual approach to the single-source shortest path problem (with negative edge lengths), achieving an almost linear runtime given sufficiently accurate predictions which improves upon the classic fastest algorithm due to Goldberg (SIAM J. Comput., 1995); (iii) We provide a general reduction-based framework for learning-based graph algorithms, leading to new algorithms for degree-constrained subgraph and minimum-cost 0-1 flow, based on reductions to bipartite matching and the shortest path problem. Finally, we give a set of general learnability theorems, showing that the predictions required by our algorithms can be efficiently learned in a PAC fashion.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2019

Faster Parallel Algorithm for Approximate Shortest Path

We present the first m polylog(n) work, polylog(n) time algorithm in the...
research
03/10/2020

Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs

We present an m^11/8+o(1)log W-time algorithm for solving the minimum co...
research
05/22/2020

Neural Bipartite Matching

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

Bounded Dijkstra (BD): Search Space Reduction for Expediting Shortest Path Subroutines

The shortest path (SP) and shortest paths tree (SPT) problems arise both...
research
05/20/2022

Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions

Augmenting algorithms with learned predictions is a promising approach f...
research
07/20/2021

Faster Matchings via Learned Duals

A recent line of research investigates how algorithms can be augmented w...
research
08/10/2023

Shortest path or random walks? A framework for path weights in network meta-analysis

Quantifying the contributions, or weights, of comparisons or single stud...

Please sign up or login with your details

Forgot password? Click here to reset