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.
Chi, Jeffrey Dean, and Neoklis Polyzotis
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Proves that conditional residual answer entropy sets the query-time scale under a routed atom-budgeted certified-repair learned-index architecture.
AutoPilot uses decentralized reinforcement learning to continuously adjust BFT protocol parameters online, achieving 49.8% lower end-to-end latency than static defaults in dynamic environments.
An experimental evaluation of learned spatial indexes derives a decision tree for index selection under varying data skew, query selectivity, and storage conditions, validated on real point sets.
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.
-
Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
Proves that conditional residual answer entropy sets the query-time scale under a routed atom-budgeted certified-repair learned-index architecture.