Learning-Augmented Algorithms for $k$-median via Online Learning

Amit Kumar (Indian Institute of Technology Delhi) · Anish Hebbar (Duke University) · Rong Ge (Duke University) · Debmalya Panigrahi (Duke University)

$k$-median clusteringalgorithm adaptation algorithmic framework approximationaverage performancedynamically changing sequenceefficient learning algorithmempirical performancefixed $k$-median solutionlearning-augmented algorithmsmachine learning techniquesonline learning optimal solutionperformance measurementproblem-solvingsequence of instances

The field of learning-augmented algorithms seeks to use ML techniques on past instances of a problem to inform an algorithm designed for a future instance. In this paper, we introduce a novel model for learning-augmented algorithms inspired by online learning. In this model, we are given a sequence of instances of a problem and the goal of the learning-augmented algorithm is to use prior instances to propose a solution to a future instance of the problem. The performance of the algorithm is measured by its average performance across all the instances, where the performance on a single instance is the ratio between the cost of the algorithm's solution and that of an optimal solution for that instance. We apply this framework to the classic $k$-median clustering problem, and give an efficient learning algorithm that can approximately match the average performance of the best fixed $k$-median solution in hindsight across all the instances. We also experimentally evaluate our algorithm and show that its empirical performance is close to optimal, and also that it automatically adapts the solution to a dynamically changing sequence.