Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 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

Risk-Sensitive Online Algorithms (2405.09859v2)

Published 16 May 2024 in cs.DS

Abstract: We study the design of risk-sensitive online algorithms, in which risk measures are used in the competitive analysis of randomized online algorithms. We introduce the CVaR$_\delta$-competitive ratio ($\delta$-CR) using the conditional value-at-risk of an algorithm's cost, which measures the expectation of the $(1-\delta)$-fraction of worst outcomes against the offline optimal cost, and use this measure to study three online optimization problems: continuous-time ski rental, discrete-time ski rental, and one-max search. The structure of the optimal $\delta$-CR and algorithm varies significantly between problems: we prove that the optimal $\delta$-CR for continuous-time ski rental is $2-2{-\Theta(\frac{1}{1-\delta})}$, obtained by an algorithm described by a delay differential equation. In contrast, in discrete-time ski rental with buying cost $B$, there is an abrupt phase transition at $\delta = 1 - \Theta(\frac{1}{\log B})$, after which the classic deterministic strategy is optimal. Similarly, one-max search exhibits a phase transition at $\delta = \frac{1}{2}$, after which the classic deterministic strategy is optimal; we also obtain an algorithm that is asymptotically optimal as $\delta \downarrow 0$ that arises as the solution to a delay differential equation.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (59)
  1. On the coherence of expected shortfall. Journal of Banking & Finance, 26(7):1487–1503, July 2002. ISSN 0378-4266. doi: 10.1016/S0378-4266(02)00283-2.
  2. Risk-Averse Control via CVaR Barrier Functions: Application to Bipedal Robot Locomotion. IEEE Control Systems Letters, 6:878–883, 2022. ISSN 2475-1456. doi: 10.1109/LCSYS.2021.3086854.
  3. Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. In Advances in Neural Information Processing Systems, volume 34, pages 16714–16726. Curran Associates, Inc., 2021.
  4. Coherent Measures of Risk. Mathematical Finance, 9(3):203–228, July 1999. ISSN 0960-1627, 1467-9965. doi: 10.1111/1467-9965.00068.
  5. Robert J. Aumann. Mixed and behavior strategies in infinite extensive games. In Melvin Dresher, Lloyd S. Shapley, and Albert William Tucker, editors, Advances in Game Theory (AM-52), pages 627–650. Princeton University Press, Princeton, NJ, 1964.
  6. A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. In Naveen Garg, Klaus Jansen, Anup Rao, and José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015), volume 40 of Leibniz International Proceedings in Informatics (LIPIcs), pages 96–109, Dagstuhl, Germany, 2015. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. ISBN 978-3-939897-89-7. doi: 10.4230/LIPIcs.APPROX-RANDOM.2015.96.
  7. Optimal Thompson Sampling strategies for support-aware CVaR bandits. In Proceedings of the 38th International Conference on Machine Learning, pages 716–726. PMLR, July 2021.
  8. Differential-Difference Equations. RAND Corporation, Santa Monica, CA, 1963.
  9. On-line learning and the metrical task system problem. In Proceedings of the Tenth Annual Conference on Computational Learning Theory - COLT ’97, pages 45–53, Nashville, Tennessee, United States, 1997. ACM Press. ISBN 978-0-89791-891-6. doi: 10.1145/267460.267475.
  10. Online algorithms with advice: The tape model. Information and Computation, 254:59–83, June 2017. ISSN 0890-5401. doi: 10.1016/j.ic.2017.03.001.
  11. An optimal on-line algorithm for metrical task system. Journal of the ACM, 39(4):745–763, October 1992. ISSN 0004-5411, 1557-735X. doi: 10.1145/146585.146588.
  12. Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing. SIAM Journal on Computing, 50(3):909–923, January 2021. ISSN 0097-5397, 1095-7111. doi: 10.1137/19M1237879.
  13. Unified Algorithms for Online Learning and Competitive Analysis. In Proceedings of the 25th Annual Conference on Learning Theory, pages 5.1–5.18. JMLR Workshop and Conference Proceedings, June 2012.
  14. Optimal Reinsurance under VaR and CVaR Risk Measures: A Simplified Approach. ASTIN Bulletin: The Journal of the IAA, 41(2):487–509, November 2011. ISSN 0515-0361, 1783-1350. doi: 10.2143/AST.41.2.2136986.
  15. Algorithms for CVaR Optimization in MDPs. In Advances in Neural Information Processing Systems, volume 27. Curran Associates, Inc., 2014.
  16. Risk-Sensitive and Robust Decision-Making: A CVaR Optimization Approach. In Advances in Neural Information Processing Systems, volume 28. Curran Associates, Inc., 2015.
  17. Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems. In Proceedings of The 26th International Conference on Artificial Intelligence and Statistics, pages 9377–9399. PMLR, April 2023.
  18. On the Lambert W function. Advances in Computational Mathematics, 5(1):329–359, December 1996. ISSN 1019-7168, 1572-9044. doi: 10.1007/BF02124750.
  19. Competitive ratio vs regret minimization: Achieving the best of both worlds. In Proceedings of the 30th International Conference on Algorithmic Learning Theory, pages 333–368. PMLR, March 2019.
  20. Controlling Tail Risk in Online Ski-Rental. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4247–4263, 2024. doi: 10.1137/1.9781611977912.147.
  21. Learning models with uniform performance via distributionally robust optimization. The Annals of Statistics, 49(3), June 2021. ISSN 0090-5364. doi: 10.1214/20-AOS2004.
  22. Optimal Search and One-Way Trading Online Algorithms. Algorithmica, 30(1):101–139, May 2001. ISSN 1432-0541. doi: 10.1007/s00453-001-0003-0.
  23. Online computation with advice. Theoretical Computer Science, 412(24):2642–2656, May 2011. ISSN 0304-3975. doi: 10.1016/j.tcs.2010.08.007.
  24. Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. In 23rd Annual Conference on Learning Theory, 2010.
  25. Smoothed Analysis with Adaptive Adversaries. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 942–953, February 2022. doi: 10.1109/FOCS52979.2021.00095.
  26. Risk-Aware Motion Planning and Control Using CVaR-Constrained Optimization. IEEE Robotics and Automation Letters, 4(4):3924–3931, October 2019. ISSN 2377-3766, 2377-3774. doi: 10.1109/LRA.2019.2929980.
  27. Dan Hathaway. Using Continuity Induction. The College Mathematics Journal, 42(3):229–231, May 2011. ISSN 0746-8342, 1931-1346. doi: 10.4169/college.math.j.42.3.229.
  28. A Standard Measure of Risk and Risk-Value Models. Management Science, 42(12):1691–1705, 1996. ISSN 0025-1909.
  29. Competitive randomized algorithms for nonuniform problems. Algorithmica, 11(6):542–571, June 1994. ISSN 0178-4617, 1432-0541. doi: 10.1007/BF01189993.
  30. Competitive snoopy caching. Algorithmica, 3(1):79–119, November 1988. ISSN 1432-0541. doi: 10.1007/BF01762111.
  31. Dynamic TCP acknowledgement and other stories about e/(e-1). In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC ’01, pages 502–509, New York, NY, USA, July 2001. Association for Computing Machinery. ISBN 978-1-58113-349-3. doi: 10.1145/380752.380845.
  32. Being Optimistic to Be Conservative: Quickly Learning a CVaR Policy. Proceedings of the AAAI Conference on Artificial Intelligence, 34(04):4436–4443, April 2020. ISSN 2374-3468, 2159-5399. doi: 10.1609/aaai.v34i04.5870.
  33. Randomized Online Computation with High Probability Guarantees. Algorithmica, 84(5):1357–1384, May 2022. ISSN 1432-0541. doi: 10.1007/s00453-022-00925-z.
  34. Portfolio optimization with conditional value-at-risk objective and constraints. The Journal of Risk, 4(2):43–68, March 2001. ISSN 14651211. doi: 10.21314/JOR.2002.057.
  35. Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms, January 2024. arXiv:2310.20598.
  36. Competitive Online Optimization under Inventory Constraints. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 3(1):10:1–10:28, March 2019. doi: 10.1145/3322205.3311081.
  37. Optimal Algorithms for k-Search with Application in Option Pricing. Algorithmica, 55(2):311–328, October 2009. ISSN 1432-0541. doi: 10.1007/s00453-008-9217-8.
  38. Competitive Caching with Machine Learned Advice. In Proceedings of the 35th International Conference on Machine Learning, pages 3296–3305. PMLR, July 2018.
  39. Risk-Based Hosting Capacity Analysis in Distribution Systems. IEEE Transactions on Power Systems, 39(1):355–365, January 2024. ISSN 1558-0679. doi: 10.1109/TPWRS.2023.3238846.
  40. Estimation and asymptotics for buffered probability of exceedance. European Journal of Operational Research, 270(3):826–836, November 2018. ISSN 03772217. doi: 10.1016/j.ejor.2018.01.021.
  41. Harry M. Markowitz. Portfolio Selection: Efficient Diversification of Investments. Yale University Press, 1959. ISBN 978-0-300-01372-6.
  42. Claire Mathieu. Online algorithms: Ski rental. https://cs.brown.edu/~claire/Talks/skirental.pdf.
  43. Classical and New Inequalities in Analysis. Springer Netherlands, Dordrecht, 1993. ISBN 978-90-481-4225-5 978-94-017-1043-5. doi: 10.1007/978-94-017-1043-5.
  44. Pricing Conditional Value at Risk-Sensitive Economic Dispatch. In 2021 IEEE Power & Energy Society General Meeting (PESGM), pages 01–05, Washington, DC, USA, July 2021. IEEE. ISBN 978-1-66540-507-2. doi: 10.1109/PESGM46819.2021.9637845.
  45. John W. Pratt. Risk Aversion in the Small and in the Large. Econometrica, 32(1/2):122–136, 1964. ISSN 0012-9682. doi: 10.2307/1913738.
  46. Improving Online Algorithms via ML Predictions. In Advances in Neural Information Processing Systems, volume 31. Curran Associates, Inc., 2018.
  47. Optimization of conditional value-at-risk. The Journal of Risk, 2(3):21–41, 2000. ISSN 14651211. doi: 10.21314/JOR.2000.038.
  48. Conditional value-at-risk for general loss distributions. Journal of Banking & Finance, 26(7):1443–1471, July 2002. ISSN 0378-4266. doi: 10.1016/S0378-4266(02)00271-6.
  49. Value-at-Risk vs. Conditional Value-at-Risk in Risk Management and Optimization. In Zhi-Long Chen, S. Raghavan, Paul Gray, and Harvey J. Greenberg, editors, State-of-the-Art Decision-Making Tools in the Information-Intensive Age, pages 270–294. INFORMS, September 2008. ISBN 978-1-877640-23-0. doi: 10.1287/educ.1080.0052.
  50. Topology Matters: Smoothed Competitiveness of Metrical Task Systems. In Volker Diekert and Michel Habib, editors, STACS 2004, Lecture Notes in Computer Science, pages 489–500, Berlin, Heidelberg, 2004. Springer. ISBN 978-3-540-24749-4. doi: 10.1007/978-3-540-24749-4˙43.
  51. Lectures on Stochastic Programming: Modeling and Theory. Society for Industrial and Applied Mathematics, January 2009. ISBN 978-0-89871-687-0 978-0-89871-875-1. doi: 10.1137/1.9780898718751.
  52. Online risk-averse submodular maximization. Annals of Operations Research, 320(1):393–414, January 2023. ISSN 1572-9338. doi: 10.1007/s10479-022-04835-9.
  53. Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 4(3):1–32, November 2020. ISSN 2476-1249. doi: 10.1145/3428336.
  54. Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems. In Advances in Neural Information Processing Systems, volume 34, pages 10339–10350. Curran Associates, Inc., 2021.
  55. Giorgio Szegö. Measures of risk. Journal of Banking & Finance, 26(7):1253–1272, July 2002. ISSN 0378-4266. doi: 10.1016/S0378-4266(02)00262-5.
  56. Distributionally-Aware Exploration for CVaR Bandits. In NeurIPS 2019 Workshop on Safety and Robustness on Decision Making, 2019.
  57. Growth-Optimal Portfolio Selection under CVaR Constraints. In Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics, pages 48–57. PMLR, March 2018.
  58. Hermann Witting. Mathematische Statistik I. Vieweg+Teubner Verlag, Wiesbaden, 1985. ISBN 978-3-322-90151-4 978-3-322-90150-7. doi: 10.1007/978-3-322-90150-7.
  59. Combinatorial Ski Rental and Online Bipartite Matching. In Proceedings of the 21st ACM Conference on Economics and Computation, pages 879–910, Virtual Event Hungary, July 2020. ACM. ISBN 978-1-4503-7975-5. doi: 10.1145/3391403.3399470.

Summary

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

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