Noisy predictions only marginally better than random guessing suffice to provably reduce the search space in exact exponential algorithms for subset selection problems, with runtime speedup scaling smoothly with prediction quality under pairwise independence or no accuracy knowledge.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Learning Augmented Exact Exponential Algorithms
Noisy predictions only marginally better than random guessing suffice to provably reduce the search space in exact exponential algorithms for subset selection problems, with runtime speedup scaling smoothly with prediction quality under pairwise independence or no accuracy knowledge.