Learning and Generalization for Matching Problems

arXiv: Learning, 2019.

Cited by: 0|Bibtex|Views16|Links
EI

Abstract:

We study a classic algorithmic problem through the lens of statistical learning. That is, we consider a matching problem where the input graph is sampled from some distribution. This distribution is unknown to the algorithm; however, an additional graph which is sampled from the same distribution is given during a training phase (preproce...More

Code:

Data:

Your rating :
0

 

Tags
Comments