Faster Matchings via Learned Duals

07/20/2021
by   Michael Dinitz, et al.
0

A recent line of research investigates how algorithms can be augmented with machine-learned predictions to overcome worst case lower bounds. This area has revealed interesting algorithmic insights into problems, with particular success in the design of competitive online algorithms. However, the question of improving algorithm running times with predictions has largely been unexplored. We take a first step in this direction by combining the idea of machine-learned predictions with the idea of "warm-starting" primal-dual algorithms. We consider one of the most important primitives in combinatorial optimization: weighted bipartite matching and its generalization to b-matching. We identify three key challenges when using learned dual variables in a primal-dual algorithm. First, predicted duals may be infeasible, so we give an algorithm that efficiently maps predicted infeasible duals to nearby feasible solutions. Second, once the duals are feasible, they may not be optimal, so we show that they can be used to quickly find an optimal solution. Finally, such predictions are useful only if they can be learned, so we show that the problem of learning duals for matching has low sample complexity. We validate our theoretical findings through experiments on both real and synthetic data. As a result we give a rigorous, practical, and empirically effective method to compute bipartite matchings.

READ FULL TEXT

page 17

page 27

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
10/22/2020

The Primal-Dual method for Learning Augmented Algorithms

The extension of classical online algorithms when provided with predicti...
research
03/01/2023

Predictive Flows for Faster Ford-Fulkerson

Recent work has shown that leveraging learned predictions can improve th...
research
04/26/2022

Faster Fundamental Graph Algorithms via Learned Predictions

We consider the question of speeding up classic graph algorithms with ma...
research
10/01/2021

Online Primal-Dual Algorithms with Predictions for Packing Problems

The domain of online algorithms with predictions has been extensively st...
research
06/02/2021

Using Predicted Weights for Ad Delivery

We study the performance of a proportional weights algorithm for online ...

Please sign up or login with your details

Forgot password? Click here to reset