Lipschitz learning is a graph-based semi-supervised method where one extends labels from labeled to an unlabeled data set by solving the infinity Laplace equation on weighted graph. In this work we prove uniform convergence rates for solutions of graph as number vertices grows infinity. Their continuum limits are absolutely minimizing extensions with respect geodesic metric domain sampled from....