Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization (2302.08224v2)

Published 16 Feb 2023 in cs.LG

Abstract: Neural network-based Combinatorial Optimization (CO) methods have shown promising results in solving various NP-complete (NPC) problems without relying on hand-crafted domain knowledge. This paper broadens the current scope of neural solvers for NPC problems by introducing a new graph-based diffusion framework, namely DIFUSCO. Our framework casts NPC problems as discrete {0, 1}-vector optimization problems and leverages graph-based denoising diffusion models to generate high-quality solutions. We investigate two types of diffusion models with Gaussian and Bernoulli noise, respectively, and devise an effective inference schedule to enhance the solution quality. We evaluate our methods on two well-studied NPC combinatorial optimization problems: Traveling Salesman Problem (TSP) and Maximal Independent Set (MIS). Experimental results show that DIFUSCO strongly outperforms the previous state-of-the-art neural solvers, improving the performance gap between ground-truth and neural solvers from 1.76% to 0.46% on TSP-500, from 2.46% to 1.17% on TSP-1000, and from 3.19% to 2.58% on TSP10000. For the MIS problem, DIFUSCO outperforms the previous state-of-the-art neural solver on the challenging SATLIB benchmark.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (122)
  1. Learning what to defer for maximum independent sets. In International Conference on Machine Learning, pages 134–144. PMLR, 2020.
  2. Fast local search for the maximum independent set problem. Journal of Heuristics, 18(4):525–547, 2012.
  3. Concorde TSP solver. https://www.math.uwaterloo.ca/tsp/concorde/index.html, 2006.
  4. Sanjeev Arora. Polynomial time approximation schemes for euclidean tsp and other geometric problems. In Proceedings of 37th Conference on Foundations of Computer Science, pages 2–11. IEEE, 1996.
  5. Structured denoising diffusion models in discrete state-spaces. Advances in Neural Information Processing Systems, 34:17981–17993, 2021.
  6. Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940, 2016.
  7. Learning generalizable models for vehicle routing problems via knowledge distillation. In Advances in Neural Information Processing Systems, 2022.
  8. What’s wrong with deep learning in tree search for combinatorial optimization. In International Conference on Learning Representations, 2022. URL https://openreview.net/forum?id=mk0HzdqY7i1.
  9. An experimental study of neural networks for variable graphs. 2018.
  10. The transformer network for the traveling salesman problem. arXiv preprint arXiv:2103.03012, 2021.
  11. Language models are few-shot learners. Advances in neural information processing systems, 33:1877–1901, 2020.
  12. A continuous time framework for discrete denoising models. In Alice H. Oh, Alekh Agarwal, Danielle Belgrave, and Kyunghyun Cho, editors, Advances in Neural Information Processing Systems, 2022. URL https://openreview.net/forum?id=DmT862YAieY.
  13. Maskgit: Masked generative image transformer. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 11315–11325, 2022.
  14. Wavegrad: Estimating gradients for waveform generation. In International Conference on Learning Representations, 2020.
  15. Wavegrad 2: Iterative refinement for text-to-speech synthesis. arXiv preprint arXiv:2106.09660, 2021.
  16. Analog bits: Generating discrete data using diffusion models with self-conditioning. arXiv preprint arXiv:2208.04202, 2022.
  17. Learning to perform local rewriting for combinatorial optimization. Advances in Neural Information Processing Systems, 32, 2019.
  18. Simulation-guided beam search for neural combinatorial optimization. In Alice H. Oh, Alekh Agarwal, Danielle Belgrave, and Kyunghyun Cho, editors, Advances in Neural Information Processing Systems, 2022. URL https://openreview.net/forum?id=tYAS1Rpys5.
  19. Georges A Croes. A method for solving traveling-salesman problems. Operations research, 6(6):791–812, 1958.
  20. Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning. In Asian Conference on Machine Learning, pages 465–480. PMLR, 2020.
  21. Learning 2-OPT heuristics for the traveling salesman problem via deep reinforcement learning. arXiv preprint arXiv:2004.01608, 2020.
  22. Learning heuristics for the TSP by policy gradient. In International conference on the integration of constraint programming, artificial intelligence, and operations research, pages 170–181. Springer, 2018.
  23. Diffusion models beat gans on image synthesis. Advances in Neural Information Processing Systems, 34:8780–8794, 2021.
  24. Continuous diffusion for categorical data. arXiv preprint arXiv:2211.15089, 2022.
  25. Learning to solve combinatorial optimization problems on real-world graphs in linear time. In 2020 19th IEEE International Conference on Machine Learning and Applications (ICMLA), pages 19–24. IEEE, 2020.
  26. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci, 5(1):17–60, 1960.
  27. Generalize a small pre-trained model to arbitrarily large tsp instances. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 7474–7482, 2021.
  28. Generalization of neural combinatorial solvers through the lens of adversarial robustness. In International Conference on Learning Representations, 2022. URL https://openreview.net/forum?id=vJZ7dPIjip3.
  29. Neural message passing for quantum chemistry. In International conference on machine learning, pages 1263–1272. PMLR, 2017.
  30. Diffuseq: Sequence to sequence text generation with diffusion models. arXiv preprint arXiv:2210.08933, 2022.
  31. Teofilo F Gonzalez. Handbook of approximation algorithms and metaheuristics. Chapman and Hall/CRC, 2007.
  32. Diffusion models as plug-and-play priors. In Thirty-Sixth Conference on Neural Information Processing Systems, 2022. URL https://arxiv.org/pdf/2206.09012.pdf.
  33. Non-autoregressive neural machine translation. In International Conference on Learning Representations, 2018.
  34. Vector quantized diffusion model for text-to-image synthesis. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 10696–10706, 2022.
  35. LLC Gurobi Optimization. Gurobi optimizer reference manual, 2018.
  36. Inductive representation learning on large graphs. Advances in neural information processing systems, 30, 2017.
  37. Ssd-lm: Semi-autoregressive simplex-based diffusion language model for text generation and modular control. arXiv preprint arXiv:2210.17432, 2022.
  38. Diffusionbert: Improving generative masked language models with diffusion models. arXiv preprint arXiv:2211.15029, 2022.
  39. K. Helsgaun. An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems. Technical report, Roskilde University, 2017.
  40. Denoising diffusion probabilistic models. Advances in Neural Information Processing Systems, 33:6840–6851, 2020.
  41. Imagen video: High definition video generation with diffusion models. arXiv preprint arXiv:2210.02303, 2022a.
  42. Cascaded diffusion models for high fidelity image generation. J. Mach. Learn. Res., 23:47–1, 2022b.
  43. Video diffusion models. arXiv preprint arXiv:2204.03458, 2022c.
  44. Argmax flows and multinomial diffusion: Learning categorical distributions. Advances in Neural Information Processing Systems, 34:12454–12465, 2021.
  45. Equivariant diffusion for molecule generation in 3d. In International Conference on Machine Learning, pages 8867–8887. PMLR, 2022.
  46. SATLIB: An online resource for research on SAT. Sat, 2000:283–292, 2000.
  47. Neural large neighborhood search for the capacitated vehicle routing problem. arXiv preprint arXiv:1911.09539, 2019.
  48. Efficient active search for combinatorial optimization problems. arXiv preprint arXiv:2106.05126, 2021.
  49. Graph neural network guided local search for the traveling salesperson problem. In International Conference on Learning Representations, 2022. URL https://openreview.net/forum?id=ar92oEosBIg.
  50. Capgemini Research Institute. Capgemini research institute, the last-mile delivery challenge, 2023. URL https://www.capgemini.com/wp-content/uploads/2019/01/Report-Digital-–-Last-Mile-Delivery-Challenge1.pdf.
  51. Batch normalization: Accelerating deep network training by reducing internal covariate shift. In International conference on machine learning, pages 448–456. PMLR, 2015.
  52. Beyond in-place corruption: Insertion and deletion in denoising probabilistic models. arXiv preprint arXiv:2107.07675, 2021.
  53. An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227, 2019.
  54. Learning the travelling salesperson problem requires rethinking generalization. Constraints, pages 1–29, 2022.
  55. Erdos goes neural: an unsupervised learning framework for combinatorial optimization on graphs. Advances in Neural Information Processing Systems, 33:6659–6672, 2020.
  56. Elucidating the design space of diffusion-based generative models. arXiv preprint arXiv:2206.00364, 2022.
  57. Learning combinatorial optimization algorithms over graphs. Advances in neural information processing systems, 30, 2017.
  58. Learning collaborative policies to solve NP-hard routing problems. Advances in Neural Information Processing Systems, 34, 2021.
  59. Sym-NCO: Leveraging symmetricity for neural combinatorial optimization. In Alice H. Oh, Alekh Agarwal, Danielle Belgrave, and Kyunghyun Cho, editors, Advances in Neural Information Processing Systems, 2022. URL https://openreview.net/forum?id=kHrE2vi5Rvs.
  60. Variational diffusion models. Advances in neural information processing systems, 34:21696–21707, 2021.
  61. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907, 2016.
  62. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations, 2017. URL https://openreview.net/forum?id=SJU4ayYgl.
  63. Actor-critic algorithms. In Advances in neural information processing systems, pages 1008–1014, 2000.
  64. Attention, learn to solve routing problems! In International Conference on Learning Representations, 2019a.
  65. Buy 4 REINFORCE samples, get a baseline for free! In Deep Reinforcement Learning Meets Structured Prediction, ICLR 2019 Workshop, 2019b.
  66. Convolutional deep belief networks on cifar-10. Unpublished manuscript, 40(7):1–9, 2010.
  67. POMO: Policy optimization with multiple optima for reinforcement learning. arXiv preprint arXiv:2010.16011, 2020.
  68. Matrix encoding networks for neural combinatorial optimization. Advances in Neural Information Processing Systems, 34, 2021.
  69. Diffusion-LM improves controllable text generation. In Alice H. Oh, Alekh Agarwal, Danielle Belgrave, and Kyunghyun Cho, editors, Advances in Neural Information Processing Systems, 2022. URL https://openreview.net/forum?id=3s9IrEsjLyk.
  70. Combinatorial optimization with graph convolutional networks and guided tree search. Advances in neural information processing systems, 31, 2018.
  71. An effective heuristic algorithm for the traveling-salesman problem. Operations research, 21(2):498–516, 1973.
  72. Diffsinger: Singing voice synthesis via shallow diffusion mechanism. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pages 11020–11028, 2022.
  73. Pseudo numerical methods for diffusion models on manifolds. In International Conference on Learning Representations, 2021.
  74. Dpm-solver: A fast ode solver for diffusion probabilistic model sampling in around 10 steps. arXiv preprint arXiv:2206.00927, 2022a.
  75. Dpm-solver++: Fast solver for guided sampling of diffusion probabilistic models. arXiv preprint arXiv:2211.01095, 2022b.
  76. A learning-based iterative method for solving vehicle routing problems. In International Conference on Learning Representations, 2020.
  77. Antigen-specific antibody design and optimization with diffusion-based generative models for protein structures. In Alice H. Oh, Alekh Agarwal, Danielle Belgrave, and Kyunghyun Cho, editors, Advances in Neural Information Processing Systems, 2022. URL https://openreview.net/forum?id=jSorGn2Tjg.
  78. Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning. arXiv preprint arXiv:1911.04936, 2019.
  79. Learning to iteratively solve routing problems with dual-aspect collaborative transformer. Advances in Neural Information Processing Systems, 34:11096–11107, 2021.
  80. Optimistic tree searches for combinatorial black-box optimization. In Alice H. Oh, Alekh Agarwal, Danielle Belgrave, and Kyunghyun Cho, editors, Advances in Neural Information Processing Systems, 2022. URL https://openreview.net/forum?id=JGLW4DvX11F.
  81. Sdedit: Image synthesis and editing with stochastic differential equations. arXiv preprint arXiv:2108.01073, 2021.
  82. Solving mixed integer programs using neural networks. arXiv preprint arXiv:2012.13349, 2020.
  83. Reinforcement learning for solving the vehicle routing problem. Advances in neural information processing systems, 31, 2018.
  84. Glide: Towards photorealistic image generation and editing with text-guided diffusion models. arXiv preprint arXiv:2112.10741, 2021.
  85. Improved denoising diffusion probabilistic models. In International Conference on Machine Learning, pages 8162–8171. PMLR, 2021.
  86. Permutation invariant graph generation via score-based generative modeling. In International Conference on Artificial Intelligence and Statistics, pages 4474–4484. PMLR, 2020.
  87. Improving generalization of deep reinforcement learning-based tsp solvers. arXiv preprint arXiv:2110.02843, 2021.
  88. Combinatorial optimization: algorithms and complexity. Courier Corporation, 1998.
  89. Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning. International Journal of Production Research, 59(11):3360–3377, 2021.
  90. A deep reinforcement learning algorithm using dynamic attention model for vehicle routing problems. In International Symposium on Intelligence Computation and Applications, pages 636–650. Springer, 2019.
  91. pitney bowes. Pitney bowes parcel shipping index, 2023. URL https://www.pitneybowes.com/us/shipping-index.html.
  92. Dimes: A differentiable meta solver for combinatorial optimization problems. In Advances in Neural Information Processing Systems, 2022.
  93. Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125, 2022.
  94. High-resolution image synthesis with latent diffusion models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 10684–10695, 2022.
  95. Palette: Image-to-image diffusion models. In ACM SIGGRAPH 2022 Conference Proceedings, pages 1–10, 2022a.
  96. Photorealistic text-to-image diffusion models with deep language understanding. arXiv preprint arXiv:2205.11487, 2022b.
  97. Paul Shaw. A new local search algorithm providing high quality solutions to vehicle routing problems. APES Group, Dept of Computer Science, University of Strathclyde, Glasgow, Scotland, UK, 46, 1997.
  98. Mastering the game of go with deep neural networks and tree search. nature, 529(7587):484–489, 2016.
  99. Make-a-video: Text-to-video generation without text-video data. arXiv preprint arXiv:2209.14792, 2022.
  100. Deep unsupervised learning using nonequilibrium thermodynamics. In International Conference on Machine Learning, pages 2256–2265. PMLR, 2015.
  101. Denoising diffusion implicit models. In International Conference on Learning Representations, 2021a. URL https://openreview.net/forum?id=St1giarCHLP.
  102. Generative modeling by estimating gradients of the data distribution. Advances in Neural Information Processing Systems, 32, 2019.
  103. Improved techniques for training score-based generative models. Advances in neural information processing systems, 33:12438–12448, 2020.
  104. Score-based generative modeling through stochastic differential equations. In International Conference on Learning Representations, 2021b.
  105. Score-based continuous-time discrete diffusion models. arXiv preprint arXiv:2211.16750, 2022.
  106. Attention is all you need. In Advances in neural information processing systems, pages 5998–6008, 2017.
  107. Graph attention networks. In International Conference on Learning Representations, 2018.
  108. Digress: Discrete denoising diffusion for graph generation. arXiv preprint arXiv:2209.14734, 2022.
  109. A game-theoretic approach for improving generalization ability of TSP solvers. arXiv preprint arXiv:2110.15105, 2021a.
  110. A bi-level framework for learning to solve combinatorial optimization on graphs. arXiv preprint arXiv:2106.04927, 2021b.
  111. Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning, 8(3):229–256, 1992.
  112. Diffusion-based molecule generation with informative prior bridges. arXiv preprint arXiv:2209.00865, 2022.
  113. Learning improvement heuristics for solving routing problems.. IEEE transactions on neural networks and learning systems, 2021.
  114. Multi-decoder attention model with embedding glimpse for solving vehicle routing problems. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 12042–12049, 2021a.
  115. NeuroLKH: Combining deep learning model with Lin–Kernighan–Helsgaun heuristic for solving the traveling salesman problem. Advances in Neural Information Processing Systems, 34, 2021b.
  116. How powerful are graph neural networks? In International Conference on Learning Representations, 2019. URL https://openreview.net/forum?id=ryGs6iA5Km.
  117. Geodiff: A geometric diffusion model for molecular conformation generation. In International Conference on Learning Representations, 2021.
  118. Diffsound: Discrete diffusion model for text-to-sound generation. arXiv preprint arXiv:2207.09983, 2022.
  119. Learning local search heuristics for boolean satisfiability. In NeurIPS, pages 7990–8001, 2019.
  120. Scaling autoregressive models for content-rich text-to-image generation. Transactions on Machine Learning Research.
  121. Magvit: Masked generative video transformer. arXiv preprint arXiv:2212.05199, 2022.
  122. Learning to dispatch for job shop scheduling via deep reinforcement learning. arXiv preprint arXiv:2010.12367, 2020.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Zhiqing Sun (35 papers)
  2. Yiming Yang (151 papers)
Citations (75)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now