Online Learning of Facility Locations

In this paper, we provide a rigorous theoretical investigation of an online learning version of the Facility Location problem which is motivated by emerging problems in real-world applications. In our formulation, we are given a set of sites and an online sequence of user requests. At each trial, the learner selects a subset of sites and then incurs a cost for each selected site and an additional cost which is the price of the user's connection to the nearest site in the selected subset. The problem may be solved by an application of the well-known Hedge algorithm. This would, however, require time and space exponential in the number of the given sites, which motivates our design of a novel quasi-linear time algorithm for this problem, with good theoretical guarantees on its performance.

[1]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[2]  Sudipto Guha,et al.  Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[3]  Mark Herbster,et al.  Tracking the Best Linear Predictor , 2001, J. Mach. Learn. Res..

[4]  M. Herbster,et al.  Service Placement with Provable Guarantees in Heterogeneous Edge Computing Systems , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[5]  Mark Herbster,et al.  MaxHedge: Maximising a Maximum Online , 2018 .

[6]  Mark Herbster,et al.  MaxHedge: Maximizing a Maximum Online , 2019, AISTATS.

[7]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[8]  Azer Bestavros,et al.  Distributed Placement of Service Facilities in Large-Scale Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[9]  Éva Tardos,et al.  Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.

[10]  Peter Auer,et al.  The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..

[11]  Santosh S. Vempala,et al.  Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..

[12]  Kin K. Leung,et al.  Dynamic Service Placement for Mobile Micro-Clouds with Predicted Future Costs , 2015, IEEE Transactions on Parallel and Distributed Systems.

[13]  Wei Hu,et al.  Online Improper Learning with an Approximation Oracle , 2018, NeurIPS.

[14]  Mark Herbster,et al.  Mistake Bounds for Binary Matrix Completion , 2016, NIPS.

[15]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[16]  Max Mühlhäuser,et al.  Service Entity Placement for Social Virtual Reality Applications in Edge Computing , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.

[17]  Mohit Singh,et al.  Structured Robust Submodular Maximization: Offline and Online Algorithms , 2017, AISTATS.

[18]  Piotr Sankowski,et al.  Online Facility Location with Deletions , 2018, ESA.

[19]  Dimitris Fotakis,et al.  Online and incremental algorithms for facility location , 2011, SIGA.

[20]  Manfred K. Warmuth,et al.  Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..

[21]  Kin K. Leung,et al.  Dynamic Service Migration in Mobile Edge Computing Based on Markov Decision Process , 2019, IEEE/ACM Transactions on Networking.

[22]  Adam Meyerson,et al.  Online facility location , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[23]  Praneeth Netrapalli,et al.  Online Non-Convex Learning: Following the Perturbed Leader is Optimal , 2019, ALT.

[24]  Adam Tauman Kalai,et al.  Playing games with approximation algorithms , 2007, STOC '07.

[25]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[26]  David Steurer,et al.  Analytical approach to parallel repetition , 2013, STOC.

[27]  Tim Roughgarden,et al.  An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization , 2018, COLT.

[28]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[29]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[30]  Takahiro Fujita,et al.  Combinatorial Online Prediction via Metarounding , 2013, ALT.

[31]  Alon Gonen,et al.  Learning in Non-convex Games with an Optimization Oracle , 2018, COLT.

[32]  H. Robbins.  Some aspects of the sequential design of experiments , 1952 .