LoRe adaptively budgets per-step interaction evaluations in iterative graph solvers via dynamic routing, delivering 8-15x speedups and 12-44x memory reductions on MIS and TSP while preserving solution quality.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
LoRe: Adaptive Interaction-Evaluation Routing with Per-Step Interaction Budgets for Iterative Graph Solvers
LoRe adaptively budgets per-step interaction evaluations in iterative graph solvers via dynamic routing, delivering 8-15x speedups and 12-44x memory reductions on MIS and TSP while preserving solution quality.