Learning to Cover Locally: Graph Neural Combinatorial Optimization under a Hard Information Horizon
This story is from 2026-10-02. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2610.00422v1 Announce Type: new Abstract: Neural combinatorial optimization typically assumes a centralized solver that reads the whole instance. We study the opposite: combinatorial optimization under a hard information horizon, where every node commits to its share of a global solution seei…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-10-02 04:00 · arXiv stat.ML
Learning to Cover Locally: Graph Neural Combinatorial Optimization under a Hard Information Horizon