StruDiCO: Structured Denoising Diffusion with Gradient-free Inference-stage Boosting for Memory and Time Efficient Combinatorial Optimization
Yu Wang, Yang Li, Junchi Yan, Yi Chang
Abstract
Diffusion models have recently emerged as powerful neural solvers for combinatorial optimization (CO). However, existing approaches fail to reveal how variables are progressively determined during inference, making the final solution opaque until the last step. To address this limitation, we propose a structured denoising diffusion model, StruDiCO, which incrementally constructs solutions through step-wise variable selection. This is achieved via a variable-absorption noising model, wherein the forward process simulates gradual variable deactivation, converging to an empty solution, while the reverse process incrementally selects variables to reconstruct the final solution. This design induces structural continuity across intermediate states, enabling interpretable and trajectory-consistent partial solutions throughout inference. To further improve the reliability of reverse inference, we introduce a constrained consistency sampling strategy, which suppresses low-confidence variable selection at each step to stabilize the reverse process. Leveraging the structure-preserving reverse process, we further propose a lightweight, gradient-free, objective-aware refinement framework, which iteratively improves solution quality by applying structure-aware perturbations to the current solution, performing reverse inference through the constraint consistency model, and decoding with an objective-guided scoring scheme. Extensive experiments on two canonical CO tasks, the Traveling Salesman Problem (TSP) and Maximal Independent Set (MIS), show that StruDiCO outperforms state-of-the-art diffusionbased solvers, achieving up to 3.5× faster inference, 70% lower GPU memory usage, and significantly improved solution quality, with up to 37.7% drop reduction on TSP and an average 38.1% improvement on MIS. The codes are publicly available at https://github.com/yuuuuwang/StruDiCO.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1cbd9250-c95b-4ab8-a7b8-43a4597a884fCited by top-tier papers1
Ask how each one uses itBuilds on22
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 35,902 citations
- Consistency ModelsYang Song, Prafulla Dhariwal, Mark Chen, Ilya SutskeverICML 2023 · 1,720 citations
- POMO: Policy Optimization with Multiple Optima for Reinforcement LearningYeong-Dae Kwon, Jinho Choo, Byoungjip Kim, Iljoo Yoon et al.NeurIPS 2020 · 731 citations
- DIFUSCO: Graph-based Diffusion Solvers for Combinatorial OptimizationZhiqing Sun, Yiming YangNeurIPS 2023 · 356 citations
- Generalize a Small Pre-trained Model to Arbitrarily Large TSP InstancesZhang-Hua Fu, Kai-Bin Qiu, Hongyuan ZhaAAAI 2021 · 247 citations
Related papers
- Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial OptimizationYang Li, Jinpei Guo, Runzhong Wang, Hongyuan Zha et al.NeurIPS 2024 · 65 citations
- Generation as Search Operator for Test-Time Scaling of Diffusion-based Combinatorial OptimizationYang Li, Lvda Chen, Haonan Wang, Runzhong Wang et al.NeurIPS 2025 · 13 citations
- From Distribution Learning in Training to Gradient Search in Testing for Combinatorial OptimizationYang Li, Jinpei Guo, Runzhong Wang, Junchi YanNeurIPS 2023 · 115 citations
- Efficient Few-Step Solution Generation via Discrete Flow Matching for Combinatorial OptimizationYuanshu Li, Di Wang, Wei Du, Xuan Wu et al.AAAI 2026 · 1 citation
- An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman ProblemMingzhao Wang, You Zhou, Zhiguang Cao, Yubin Xiao et al.KDD 2025 · 7 citations
