Document Open Access Logo

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems

Authors Monika Henzinger , Barna Saha , Martin P. Seybold , Christopher Ye



PDF
Thumbnail PDF

File

LIPIcs.ITCS.2024.62.pdf
  • Filesize: 1.03 MB
  • 25 pages

Document Identifiers

Author Details

Monika Henzinger
  • Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria
Barna Saha
  • University of California San Diego, La Jolla, CA, USA
Martin P. Seybold
  • University of Vienna, Austria
Christopher Ye
  • University of California San Diego, La Jolla, CA, USA

Acknowledgements

We would like to thank Andrea Lincoln for many helpful discussions and insightful comments.

Cite AsGet BibTex

Monika Henzinger, Barna Saha, Martin P. Seybold, and Christopher Ye. On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 62:1-62:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ITCS.2024.62

Abstract

Algorithms with predictions is a new research direction that leverages machine learned predictions for algorithm design. So far a plethora of recent works have incorporated predictions to improve on worst-case bounds for online problems. In this paper, we initiate the study of complexity of dynamic data structures with predictions, including dynamic graph algorithms. Unlike online algorithms, the goal in dynamic data structures is to maintain the solution efficiently with every update. We investigate three natural models of prediction: (1) δ-accurate predictions where each predicted request matches the true request with probability δ, (2) list-accurate predictions where a true request comes from a list of possible requests, and (3) bounded delay predictions where the true requests are a permutation of the predicted requests. We give general reductions among the prediction models, showing that bounded delay is the strongest prediction model, followed by list-accurate, and δ-accurate. Further, we identify two broad problem classes based on lower bounds due to the Online Matrix Vector (OMv) conjecture. Specifically, we show that locally correctable dynamic problems have strong conditional lower bounds for list-accurate predictions that are equivalent to the non-prediction setting, unless list-accurate predictions are perfect. Moreover, we show that locally reducible dynamic problems have time complexity that degrades gracefully with the quality of bounded delay predictions. We categorize problems with known OMv lower bounds accordingly and give several upper bounds in the delay model that show that our lower bounds are almost tight. We note that concurrent work by v.d.Brand et al. [SODA '24] and Liu and Srinivas [arXiv:2307.08890] independently study dynamic graph algorithms with predictions, but their work is mostly focused on showing upper bounds.

Subject Classification

ACM Subject Classification
  • Theory of computation → Dynamic graph algorithms
Keywords
  • Dynamic Graph Algorithms
  • Algorithms with Predictions

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Anders Aamand, Piotr Indyk, and Ali Vakilian. (learned) frequency estimation algorithms under zipfian distribution. CoRR, abs/1908.05198, 2019. URL: https://arxiv.org/abs/1908.05198.
  2. Amir Abboud and Virginia Vassilevska Williams. Popular conjectures imply strong lower bounds for dynamic problems. In Proc. 55th Symposium on Foundations of Computer Science (FOCS'14), pages 434-443, 2014. URL: https://doi.org/10.1109/FOCS.2014.53.
  3. Keerti Anand, Rong Ge, Amit Kumar, and Debmalya Panigrahi. Online algorithms with multiple predictions. In Proc. International Conference on Machine Learning, (ICML'22), pages 582-598, 2022. URL: https://proceedings.mlr.press/v162/anand22a.html.
  4. Antonios Antoniadis, Joan Boyar, Marek Elias, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, and Bertrand Simon. Paging with succinct predictions. In Proc. 40th International Conference on Machine Learning (ICML'23), pages 952-968, 2023. URL: https://proceedings.mlr.press/v202/antoniadis23a/antoniadis23a.pdf.
  5. Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, and Bertrand Simon. Learning-augmented dynamic power management with multiple states via new ski rental bounds. In Proc. Neural Information Processing Systems (NeurIPS'21), pages 16714-16726, 2021. URL: https://proceedings.neurips.cc/paper/2021/hash/8b8388180314a337c9aa3c5aa8e2f37a-Abstract.html.
  6. Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, and Bertrand Simon. Mixing predictions for online metric algorithms. In Proc. International Conference on Machine Learning (ICML'23), pages 969-983, 2023. URL: https://proceedings.mlr.press/v202/antoniadis23b.html.
  7. Antonios Antoniadis, Peyman Jabbarzade Ganje, and Golnoosh Shahkarami. A novel prediction setup for online speed-scaling. In Proc. 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'22), pages 9:1-9:20, 2022. URL: https://doi.org/10.4230/LIPIcs.SWAT.2022.9.
  8. Yossi Azar, Debmalya Panigrahi, and Noam Touitou. Online graph algorithms with predictions. In Proc. Symposium on Discrete Algorithms (SODA'22), pages 35-66, 2022. URL: https://doi.org/10.1137/1.9781611977073.3.
  9. Étienne Bamas, Andreas Maggiori, and Ola Svensson. The primal-dual method for learning augmented algorithms. In Proc. Neural Information Processing Systems (NeurIPS'20), 2020. URL: https://proceedings.neurips.cc/paper/2020/hash/e834cb114d33f729dbc9c7fb0c6bb607-Abstract.html.
  10. Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, and Erik Vee. Learning-augmented weighted paging. In Proc. Symposium on Discrete Algorithms (SODA'22), pages 67-89, 2022. URL: https://doi.org/10.1137/1.9781611977073.4.
  11. Surender Baswana, Manoj Gupta, and Sandeep Sen. Fully dynamic maximal matching in o(log n) update time (corrected version). SIAM J. Comput., 47(3):617-650, 2018. URL: https://doi.org/10.1137/16M1106158.
  12. Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, and Nicole Wein. New techniques and fine-grained hardness for dynamic near-additive spanners. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pages 1836-1855. SIAM, 2021. URL: https://doi.org/10.1137/1.9781611976465.110.
  13. Diptarka Chakraborty, Lior Kamma, and Kasper Green Larsen. Tight cell probe bounds for succinct boolean matrix-vector multiplication. In Proc. of the 50th Symposium on Theory of Computing (STOC'18), pages 1297-1306, 2018. URL: https://doi.org/10.1145/3188745.3188830.
  14. Timothy M. Chan, Mihai Pătraşcu, and Liam Roditty. Dynamic connectivity: Connecting to networks and geometry. SIAM J. Comput., 40(2):333-349, 2011. URL: https://doi.org/10.1137/090751670.
  15. Shiri Chechik. Improved distance oracles and spanners for vertex-labeled graphs. In Proc. 20th Annual European Symposium (ESA'12), pages 325-336, 2012. URL: https://doi.org/10.1007/978-3-642-33090-2_29.
  16. Søren Dahlgaard. On the hardness of partially dynamic graph problems and connections to diameter. In Proc. 43rd International Colloquium on Automata, Languages, and Programming (ICALP'16), pages 48:1-48:14, 2016. URL: https://doi.org/10.4230/LIPIcs.ICALP.2016.48.
  17. Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii. Algorithms with prediction portfolios. In NeurIPS, 2022. URL: http://papers.nips.cc/paper_files/paper/2022/hash/7f9220f90cc85b0da693643add6618e6-Abstract-Conference.html.
  18. Dorit Dor, Shay Halperin, and Uri Zwick. All-pairs almost shortest paths. SIAM J. Comput., 29(5):1740-1759, 2000. URL: https://doi.org/10.1137/S0097539797327908.
  19. Ran Duan. New data structures for subgraph connectivity. In Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proc., Part I, volume 6198 of Lecture Notes in Computer Science, pages 201-212. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-14165-2_18.
  20. Ran Duan and Seth Pettie. Connectivity oracles for failure prone graphs. In Proc. of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pages 465-474. ACM, 2010. URL: https://doi.org/10.1145/1806689.1806754.
  21. Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, and Tal Wagner. Learning-based support estimation in sublinear time. In 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, May 3-7, 2021. OpenReview.net, 2021. URL: https://openreview.net/forum?id=tilovEHA3YS.
  22. Jacob Evald, Viktor Fredslund-Hansen, and Christian Wulff-Nilsen. Near-optimal distance oracles for vertex-labeled planar graphs. In Proc. 32nd International Symposium on Algorithms and Computation (ISAAC'21), pages 23:1-23:14, 2021. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2021.23.
  23. Shimon Even and Yossi Shiloach. An on-line edge-deletion problem. J. ACM, 28(1):1-4, 1981. URL: https://doi.org/10.1145/322234.322235.
  24. Daniele Frigioni and Giuseppe F. Italiano. Dynamically switching vertices in planar graphs. Algorithmica, 28(1):76-103, 2000. URL: https://doi.org/10.1007/s004530010032.
  25. Silvio Frischknecht, Stephan Holzer, and Roger Wattenhofer. Networks cannot compute their diameter in sublinear time. In Proc. of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, pages 1150-1162. SIAM, 2012. URL: https://doi.org/10.1137/1.9781611973099.91.
  26. Gramoz Goranci, Monika Henzinger, and Pan Peng. The power of vertex sparsifiers in dynamic graph algorithms. In 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, volume 87 of LIPIcs, pages 45:1-45:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.ESA.2017.45.
  27. Anupam Gupta, Debmalya Panigrahi, Bernardo Subercaseaux, and Kevin Sun. Augmenting online algorithms with ε-accurate predictions. In Advances in Neural Information Processing Systems, volume 35, pages 2115-2127, 2022. URL: https://proceedings.neurips.cc/paper_files/paper/2022/file/0ea048312aa812b2711fe765a9e9ef05-Paper-Conference.pdf.
  28. Manoj Gupta and Richard Peng. Fully dynamic (1+ e)-approximate matchings. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pages 548-557. IEEE, 2013. Google Scholar
  29. Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proc. of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC, pages 21-30. ACM, 2015. URL: https://doi.org/10.1145/2746539.2746609.
  30. Monika Henzinger, Ami Paz, and Stefan Schmid. On the complexity of weight-dynamic network algorithms. In IFIP Networking Conference, IFIP Networking 2021, Espoo and Helsinki, Finland, June 21-24, 2021, pages 1-9. IEEE, 2021. URL: https://doi.org/10.23919/IFIPNetworking52078.2021.9472803.
  31. Monika Henzinger, Ami Paz, and A. R. Sricharan. Fine-grained complexity lower bounds for families of dynamic graphs. In Proc. 30th European Symposium on Algorithms (ESA'22), volume 244 of LIPIcs, pages 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.ESA.2022.65.
  32. Monika Henzinger, Barna Saha, Martin P. Seybold, and Christopher Ye. On the complexity of algorithms with predictions for dynamic graph problems. CoRR, abs/2307.16771, 2023. URL: https://doi.org/10.48550/arXiv.2307.16771.
  33. Danny Hermelin, Avivit Levy, Oren Weimann, and Raphael Yuster. Distance oracles for vertex-labeled graphs. In Proc. 38th International Colloquium, Automata, Languages and Programming (ICALP'11), pages 490-501, 2011. URL: https://doi.org/10.1007/978-3-642-22012-8_39.
  34. Chen-Yu Hsu, Piotr Indyk, Dina Katabi, and Ali Vakilian. Learning-based frequency estimation algorithms. In 7th International Conference on Learning Representations, ICLR. OpenReview.net, 2019. URL: https://openreview.net/forum?id=r1lohoCqY7.
  35. Sungjin Im, Ravi Kumar, Aditya Petety, and Manish Purohit. Parsimonious learning-augmented caching. In Proc. of the 39th International Conference on Machine Learning, volume 162 of Proc. of Machine Learning Research, pages 9588-9601. PMLR, 17-23 July 2022. URL: https://proceedings.mlr.press/v162/im22a.html.
  36. Bruce M. Kapron, Valerie King, and Ben Mountjoy. Dynamic graph connectivity in polylogarithmic worst case time. In Proc. of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 1131-1142. SIAM, 2013. URL: https://doi.org/10.1137/1.9781611973105.81.
  37. Tsvi Kopelowitz, Seth Pettie, and Ely Porat. Higher lower bounds from the 3sum conjecture. In Proc. of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1272-1287. SIAM, 2016. URL: https://doi.org/10.1137/1.9781611974331.ch89.
  38. Tim Kraska, Alex Beutel, Ed H. Chi, Jeffrey Dean, and Neoklis Polyzotis. The case for learned index structures. In Proc. of the 2018 International Conference on Management of Data, SIGMOD Conference 2018, Houston, TX, USA, June 10-15, 2018, pages 489-504. ACM, 2018. URL: https://doi.org/10.1145/3183713.3196909.
  39. Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, and Anna Zych. The power of dynamic distance oracles: Efficient dynamic algorithms for the steiner tree. In Proc. 47th Symposium on Theory of Computing (STOC'15), pages 11-20, 2015. URL: https://doi.org/10.1145/2746539.2746615.
  40. Kasper Green Larsen and R. Ryan Williams. Faster online matrix-vector multiplication. In Proc. 28th Symposium on Discrete Algorithms (SODA'17), pages 2182-2189, 2017. URL: https://doi.org/10.1137/1.9781611974782.142.
  41. Alexander Lindermayr and Nicole Megow. Non-clairvoyant scheduling with predictions revisited. CoRR, abs/2202.10199, 2022. URL: https://arxiv.org/abs/2202.10199.
  42. Quanquan C. Liu and Vaidehi Srinivas. The predicted-deletion dynamic model: Taking advantage of ML predictions, for free. CoRR, abs/2307.08890, 2023. URL: https://doi.org/10.48550/arXiv.2307.08890.
  43. Thodoris Lykouris and Sergei Vassilvitskii. Competitive caching with machine learned advice. J. ACM, 68(4):24:1-24:25, 2021. URL: https://doi.org/10.1145/3447579.
  44. Aleksander Madry. From graphs to matrices, and back: new techniques for graph algorithms. PhD thesis, Massachusetts Institute of Technology, 2011. Google Scholar
  45. Michael Mitzenmacher and Sergei Vassilvitskii. Algorithms with Predictions, pages 646-662. Cambridge University Press, 2021. URL: https://doi.org/10.1017/9781108637435.037.
  46. Mihai Patrascu. Towards polynomial lower bounds for dynamic problems. In Proc. of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pages 603-610. ACM, 2010. URL: https://doi.org/10.1145/1806689.1806772.
  47. Manish Purohit, Zoya Svitkina, and Ravi Kumar. Improving online algorithms via ML predictions. In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2018, Montréal, Canada, pages 9684-9693, 2018. URL: https://proceedings.neurips.cc/paper/2018/hash/73a427badebe0e32caa2e1fc7530b7f3-Abstract.html.
  48. Liam Roditty and Uri Zwick. On dynamic shortest paths problems. Algorithmica, 61(2):389-401, 2011. URL: https://doi.org/10.1007/s00453-010-9401-5.
  49. Liam Roditty and Uri Zwick. Dynamic approximate all-pairs shortest paths in undirected graphs. SIAM J. Comput., 41(3):670-683, 2012. URL: https://doi.org/10.1137/090776573.
  50. Dhruv Rohatgi. Near-optimal bounds for online caching with machine learned advice. In Proc. of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 1834-1845. SIAM, 2020. URL: https://doi.org/10.1137/1.9781611975994.112.
  51. Yongho Shin, Changyeol Lee, Gukryeol Lee, and Hyung-Chan An. Improved learning-augmented algorithms for the multi-option ski rental problem via best-possible competitive analysis. In Proc. of the 40th International Conference on Machine Learning, pages 31539-31561. PMLR, 2023. URL: https://proceedings.mlr.press/v202/shin23c.html.
  52. Sandeep Silwal, Sara Ahmadian, Andrew Nystrom, Andrew McCallum, Deepak Ramachandran, and Seyed Mehran Kazemi. Kwikbucks: Correlation clustering with cheap-weak and expensive-strong signals. In The Eleventh International Conference on Learning Representations ICLR, 2023. URL: https://openreview.net/pdf?id=p0JSSa1AuV.
  53. Shay Solomon. Fully dynamic maximal matching in constant update time. In IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS, pages 325-334. IEEE Computer Society, 2016. URL: https://doi.org/10.1109/FOCS.2016.43.
  54. Jan van den Brand, Sebastian Forster, Yasamin Nazari, and Adam Polak. On dynamic graph algorithms with predictions. CoRR, abs/2307.09961, 2023. URL: https://doi.org/10.48550/arXiv.2307.09961.
  55. Ryan Williams. Matrix-vector multiplication in sub-quadratic time: (some preprocessing required). In Proc. 18th Symposium on Discrete Algorithms (SODA'07), pages 995-1001, 2007. URL: http://dl.acm.org/citation.cfm?id=1283383.1283490.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail