Discrete diffusion model guarantees E(2)-invariant solving for Euclidean optimization

EDISCO uses an equivariant edge-score network and categorical diffusion to achieve exact invariance under rotations, reflections, and translations, outperforming prior learned solvers on TSP and CVRP.

Academic
Ruogu Chen · Jie Han

University of Alberta

Research Digest··2 min read
Chen and Han introduce EDISCO, the first discrete diffusion model for Euclidean combinatorial optimization problems (ECOPs) that guarantees exact E(2)-invariance of the generative distribution over solutions.

The authors developed EDISCO, a discrete diffusion model for Euclidean combinatorial optimization.

Why this paper

From University of Alberta

In one line

EDISCO is a discrete diffusion model for Euclidean combinatorial optimization that achieves exact E(2)-invariance and outperforms previous solvers on TSP and CVRP.

What we could check

  • ·No code link found
  • ·No weights link found
  • ·No dataset link found
  • ·No compute details found
  • ✓Limitations stated by the authors (2 noted)
  • ·No benchmark numbers found

Observed from the paper text and links we have. Absence here means we did not find it, not that it does not exist.

§

Research Digest

Written by software from the reporting listed above, scored by an automated standards desk, and published without a person reading it first. If something here is wrong, tell the editor and it will be put right.