Solving Normalized Cut Problem with Constrained Action Space

Reinforcement Learning (RL) has emerged as an important paradigm to solve combinatorial optimization problems primarily due to its ability to learn heuristics that can generalize across problem instances. However, integrating external knowledge that will steer combinatorial optimization problem solutions towards domain appropriate outcomes remains an extremely challenging task. In this paper, we propose the first RL solution that uses constrained action spaces to guide the normalized cut problem towards pre-defined template instances. Using transportation networks as an example domain, we create a Wedge and Ring Transformer that results in graph partitions that are shaped in form of Wedges and Rings and which are likely to be closer to natural optimal partitions. However, our approach is general as it is based on principles that can be generalized to other domains.

@article{jiang2025_2505.13986,
  title={ Solving Normalized Cut Problem with Constrained Action Space },
  author={ Qize Jiang and Linsey Pang and Alice Gatti and Mahima Aggarwa and Giovanna Vantin and Xiaosong Ma and Weiwei Sun and Sanjay Chawla },
  journal={arXiv preprint arXiv:2505.13986},
  year={ 2025 }
}