A binary search method that consumes a predicted distribution over key positions achieves O(H(p)+log eta) expected comparisons, with a matching lower bound.
The primal-dual method for learning augmented algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Binary Search with Distributional Predictions
A binary search method that consumes a predicted distribution over key positions achieves O(H(p)+log eta) expected comparisons, with a matching lower bound.