Guided Discrete Diffusion for Constraint Satisfaction Problems
arXiv:2512.14765v1
Originality Synthesis-oriented
AI Analysis
This addresses constraint satisfaction problems for researchers in AI and optimization, but appears incremental as it applies diffusion methods to a specific domain.
The authors tackled constraint satisfaction problems by proposing discrete diffusion guidance, demonstrating its ability to solve Sudoku puzzles without supervision.
We propose discrete diffusion guidance for constraint satisfaction problems (CSPs) and demonstrate its ability to solve Sudoku puzzles without supervision.