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
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper22
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 被引用 35,902 次
- Consistency ModelsYang Song, Prafulla Dhariwal, Mark Chen, Ilya SutskeverICML 2023 · 被引用 1,720 次
- POMO: Policy Optimization with Multiple Optima for Reinforcement LearningYeong-Dae Kwon, Jinho Choo, Byoungjip Kim, Iljoo Yoon 等NeurIPS 2020 · 被引用 731 次
- DIFUSCO: Graph-based Diffusion Solvers for Combinatorial OptimizationZhiqing Sun, Yiming YangNeurIPS 2023 · 被引用 356 次
- Generalize a Small Pre-trained Model to Arbitrarily Large TSP InstancesZhang-Hua Fu, Kai-Bin Qiu, Hongyuan ZhaAAAI 2021 · 被引用 247 次
相关 Paper
- Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial OptimizationYang Li, Jinpei Guo, Runzhong Wang, Hongyuan Zha 等NeurIPS 2024 · 被引用 65 次
- Generation as Search Operator for Test-Time Scaling of Diffusion-based Combinatorial OptimizationYang Li, Lvda Chen, Haonan Wang, Runzhong Wang 等NeurIPS 2025 · 被引用 13 次
- From Distribution Learning in Training to Gradient Search in Testing for Combinatorial OptimizationYang Li, Jinpei Guo, Runzhong Wang, Junchi YanNeurIPS 2023 · 被引用 115 次
- Efficient Few-Step Solution Generation via Discrete Flow Matching for Combinatorial OptimizationYuanshu Li, Di Wang, Wei Du, Xuan Wu 等AAAI 2026 · 被引用 1 次
- An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman ProblemMingzhao Wang, You Zhou, Zhiguang Cao, Yubin Xiao 等KDD 2025 · 被引用 7 次
