Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Online Computation with Untrusted Advice (1905.05655v4)

Published 14 May 2019 in cs.DS

Abstract: We study a generalization of the advice complexity model of online computation in which the advice is provided by an untrusted source. Our objective is to quantify the impact of untrusted advice so as to design and analyze online algorithms that are robust if the advice is adversarial, and efficient is the advice is foolproof. We focus on four well-studied online problems, namely ski rental, online bidding, bin packing and list update. For ski rental and online bidding, we show how to obtain algorithms that are Pareto-optimal with respect to the competitive ratios achieved, whereas for bin packing and list update, we give online algorithms with worst-case tradeoffs in their competitiveness, depending on whether the advice is trusted or adversarial. More importantly, we demonstrate how to prove lower bounds, within this model, on the tradeoff between the number of advice bits and the competitiveness of any online algorithm.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (34)
  1. S. Albers. Improved randomized on-line algorithms for the list update problem. SIAM J. Comput., 27:682–693, 1998.
  2. Online bin packing with advice of small size. Theory Comput. Syst., 62(8):2006–2034, 2018.
  3. S. Angelopoulos and S. Kamali. Contract scheduling with predictions. J. Artif. Intell. Res., 77:395–426, 2023.
  4. Online bin packing with predictions. J. Artif. Intell. Res., 78:1111–1141, 2023.
  5. Online search with best-price and query-based predictions. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, pages 9652–9660. AAAI Press, 2022.
  6. A new and improved algorithm for online bin packing. In Proceedings of the 26th Annual European Symposium on Algorithms (ESA), pages 5:1–5:14, 2018.
  7. A new lower bound for classic online bin packing. Algorithmica, 83(7):2047–2062, 2021.
  8. On the advice complexity of online problems. In Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC), pages 331–340, 2009.
  9. Online algorithms with advice: A survey. SIGACT News, 47(3):93–129, 2016.
  10. Advice complexity for a class of online problems. In Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science (STACS), 2015.
  11. On the list update problem with advice. Information and Computation, 253:411–423, 2016.
  12. Online bin packing with advice. Algorithmica, 74(1):507–527, 2016.
  13. M. Chrobak and C. Kenyon. Competitiveness via doubling. SIGACT News, pages 115–126, 2006.
  14. Bin packing approximation algorithms: survey and classification. In P. M. Pardalos, D.-Z. Du, and R. L. Graham, editors, Handbook of Combinatorial Optimization, pages 455–531. Springer, 2013.
  15. Measuring the problem-relevant information in input. RAIRO Inform. Theor. Appl., 43(3):585–613, 2009.
  16. Online computation with advice. Theoret. Comput. Sci., 412(24):2642 – 2656, 2011.
  17. S. Irani. Two results on the list update problem. Inform. Process. Lett., 38:301–306, 1991.
  18. D. S. Johnson. Near-optimal bin packing algorithms. PhD thesis, MIT, Cambridge, MA, 1973.
  19. D. S. Johnson. Bin packing. In Encyclopedia of Algorithms, pages 207–211. 2016.
  20. S. Kamali and A. López-Ortiz. Better compression through better list update algorithms. In Data Compression Conference (DCC), pages 372–381, 2014.
  21. Competitive snoopy caching. Algorithmica, 3:79–119, 1988.
  22. Dynamic TCP acknowledgment and other stories about e/(e - 1). Algorithmica, 36:209–224, 2003.
  23. Optimal scheduling of contract algorithms for anytime problems. Journal of Artificial Intelligence Research, 51:533–554, 2014.
  24. T. Lykouris and S. Vassilvitskii. Competitive caching with machine learned advice. J. ACM, 68(4):24:1–24:25, 2021.
  25. A. Mazumdar and B. Saha. Clustering with noisy queries. In Annual Conference on Neural Information Processing Systems (NIPS), volume 30, pages 5788–5799. 2017.
  26. A. Meyerson. The parking permit problem. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 274–284, 2005.
  27. J. Mikkelsen. Randomization can be as helpful as a glimpse of the future in online computation. In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP), pages 39:1–39:14, 2016.
  28. M. Mitzenmacher and S. Vassilvitskii. Algorithms with predictions. In Beyond the Worst-Case Analysis of Algorithms, pages 646–662. Cambridge University Press, 2020.
  29. Improving online algorithms via ML predictions. In Proceedings of the 32nd Conference on Advances in Neural Information Processing Systems (NeurIPS), volume 31, pages 9661–9670, 2018.
  30. Online algorithms with advice for bin packing and scheduling problems. Theor. Comput. Sci., 600:155–170, 2015.
  31. S. J. Russell and S. Zilberstein. Composing real-time systems. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI), pages 212–217, 1991.
  32. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Commun. ACM, 28:202–208, 1985.
  33. Self-adjusting binary search trees. Jour. of the ACM, 32:652–686, 1985.
  34. A. Wei and F. Zhang. Optimal robustness-consistency trade-offs for learning-augmented online algorithms. arXiv preprint arXiv:2010.11443, 2020.
Citations (65)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets