REVIEW 2 cited by
Learning-Augmented Priority Queues
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Priority queues are one of the most fundamental and widely used data structures in computer science. Their primary objective is to efficiently support the insertion of new elements with assigned priorities and the extraction of the highest priority element. In this study, we investigate the design of priority queues within the learning-augmented framework, where algorithms use potentially inaccurate predictions to enhance their worst-case performance. We examine three prediction models spanning different use cases, and show how the predictions can be leveraged to enhance the performance of priority queue operations. Moreover, we demonstrate the optimality of our solution and discuss some possible applications.
Forward citations
Cited by 2 Pith papers
-
Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
The paper constructs a deterministic one-max-search algorithm that simultaneously achieves the best possible consistency-robustness trade-off and the best possible smoothness for prediction errors, for both multiplica...
-
On Tradeoffs in Learning-Augmented Algorithms
For line search, one-max search, and ski rental, the paper proves new tradeoffs between consistency, robustness, smoothness, and average-case performance, and gives randomized algorithms to tune them.
Discussion (0). Continue with ORCID to comment.