Learning-Augmented and Randomized Algorithms for Line Aggregation with Delays
Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.
Computer Science > Machine Learning
Title:Learning-Augmented and Randomized Algorithms for Line Aggregation with Delays
Abstract:This paper studies learning-augmented and randomized online aggregation with delays on a line metric. We consider advice given as online suggested service lengths, and evaluate the algorithms in terms of robustness and consistency. For each $\lambda \in (0,1]$, we first propose a deterministic learning-augmented \textsc{Balance} algorithm that is $(4/\lambda+1/\lambda^2)$-robust and $(4+\lambda)$-consistent. We also propose a randomized algorithm for the problem in the classical adversarial model, which is $(e+1)$-competitive against an oblivious adversary, improving over the deterministic $5$-competitive \textsc{Balance} benchmark~\cite{bienkowski2013chain}. Notably, this competitive ratio is even lower than the lower bound of $4$ for deterministic online algorithms. Moreover, we establish a lower bound of $e$ on the competitive ratio of randomized online algorithms, improving the previous lower bound of $e/(e-1)$. Besides, we combine the two ideas and obtain a randomized learning-augmented algorithm that is $(e/\lambda+1/\lambda^2)$-robust and $(e+\lambda)$-consistent. Finally, we conduct numerical experiments to complement our theoretical analysis and evaluate the empirical performance of our algorithms.
| Subjects: | Machine Learning (cs.LG); Computational Complexity (cs.CC) |
| Cite as: | arXiv:2607.27807 [cs.LG] |
| (or arXiv:2607.27807v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2607.27807
arXiv-issued DOI via DataCite (pending registration)
|
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
References & Citations
Bibliographic and Citation Tools
Code, Data and Media Associated with this Article
Demos
Recommenders and Search Tools
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
More from arXiv — Machine Learning
-
Learning Discrete Riemannian Metrics for Physical Fields with Cochain-Frame Equivarianc
Aug 18
-
Forward Pass Domain Adaptation (Without Cross-Layer Backpropagation)
Aug 18
-
Coarse-to-Fine Multi-Resolution Diffusion Models for Trajectory Generation in Urban Systems
Aug 18
-
Geometry Is Not Robustness: A Trajectory-Level Study of PGD Evaluation
Aug 18
Discussion (0)
Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.
Sign in →No comments yet. Sign in and be the first to say something.