AdaSwitch: An Adaptive Switching Meta-Algorithm for Learning-Augmented Bounded-Influence Problems
Read the original on arXiv Machine Learning →The paper introduces AdaSwitch, a meta‑algorithm for history‑dependent online problems where predictions of future requests may be inaccurate. It operates within a bounded‑influence framework, where past decisions only affect future optimal values by a limited amount, and it adaptively switches between offline and online oracles. AdaSwitch guarantees expected performance that improves as prediction error shrinks or the offline optimum grows, while maintaining a near‑optimal worst‑case bound under arbitrary predictions. The authors demonstrate its applicability to online lead‑time quotation, k‑server and caching, and online reusable resource allocation for both reward maximization and cost minimization.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.