Online metric algorithms with untrusted predictions

A Antoniadis, C Coester, M Eliáš, A Polak… - ACM transactions on …, 2023 - dl.acm.org
Machine-learned predictors, although achieving very good results for inputs resembling
training data, cannot possibly provide perfect predictions in all situations. Still, decision …

Randomized strategic facility location with predictions

E Balkanski, V Gkatzelis… - Advances in Neural …, 2025 - proceedings.neurips.cc
In the strategic facility location problem, a set of agents report their locations in a metric
space and the goal is to use these reports to open a new facility, minimizing an aggregate …

Baleen:{ML} admission & prefetching for flash caches

DLK Wong, H Wu, C Molder, S Gunasekar… - … USENIX Conference on …, 2024 - usenix.org
Flash caches are used to reduce peak backend load for throughput-constrained data center
services, reducing the total number of backend servers required. Bulk storage systems are a …

Robust learning for smoothed online convex optimization with feedback delay

P Li, J Yang, A Wierman, S Ren - Advances in Neural …, 2023 - proceedings.neurips.cc
We study a general form of Smoothed Online Convex Optimization, aka SOCO, including
multi-step switching costs and feedback delay. We propose a novel machine learning (ML) …

Raven: belady-guided, predictive (deep) learning for in-memory and content caching

X Hu, E Ramadan, W Ye, F Tian, ZL Zhang - Proceedings of the 18th …, 2022 - dl.acm.org
Performance of caching algorithms not only determines the quality of experience for users,
but also affects the operating and capital expenditures for cloud service providers. Today's …

Learning-augmented maximum independent set

V Braverman, P Dharangutte, V Shah… - arxiv preprint arxiv …, 2024 - arxiv.org
We study the Maximum Independent Set (MIS) problem on general graphs within the
framework of learning-augmented algorithms. The MIS problem is known to be NP-hard and …

Learning for edge-weighted online bipartite matching with robustness guarantees

P Li, J Yang, S Ren - International Conference on Machine …, 2023 - proceedings.mlr.press
Many problems, such as online ad display, can be formulated as online bipartite matching.
The crucial challenge lies in the nature of sequentially-revealed online item information …

A survey on AI for storage

Y Liu, H Wang, K Zhou, CH Li, R Wu - CCF Transactions on High …, 2022 - Springer
Storage, as a core function and fundamental component of computers, provides services for
saving and reading digital data. The increasing complexity of data operations and storage …

Robustified learning for online optimization with memory costs

P Li, J Yang, S Ren - IEEE INFOCOM 2023-IEEE Conference …, 2023 - ieeexplore.ieee.org
Online optimization with memory costs has many real-world applications, where sequential
actions are made without knowing the future input. Nonetheless, the memory cost couples …

Algorithms for Caching and MTS with reduced number of predictions

KA Sadek, M Elias - arxiv preprint arxiv:2404.06280, 2024 - arxiv.org
ML-augmented algorithms utilize predictions to achieve performance beyond their worst-
case bounds. Producing these predictions might be a costly operation--this motivated Im et …