mlsanityData to 14 Oct 2026

Continuation Path Learning for Homotopy Optimization

arXiv 2307.12551 ↗First posted 24 Jul 2023cs.LG cs.AI cs.NEcited by 12

Not on the map. Why?

Abstract (arXiv)

Homotopy optimization is a traditional method to deal with a complicated optimization problem by solving a sequence of easy-to-hard surrogate subproblems. However, this method can be very sensitive to the continuation schedule design and might lead to a suboptimal solution to the original problem. In addition, the intermediate solutions, often ignored by classic homotopy optimization, could be useful for many real-world applications. In this work, we propose a novel model-based approach to learn the whole continuation path for homotopy optimization, which contains infinite intermediate solutions for any surrogate subproblems. Rather than the classic unidirectional easy-to-hard optimization, our method can simultaneously optimize the original problem and all surrogate subproblems in a collaborative manner. The proposed model also supports real-time generation of any intermediate solution, which could be desirable for many applications. Experimental studies on different problems show that our proposed method can significantly improve the performance of homotopy optimization and provide extra helpful information to support better decision-making.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 40 of its 91 references that are in the map. First posted on arXiv 24 Jul 2023.

Builds on

40 of 91 references.

References · 40

  1. 2017Attention Is All You Needcited by 60,361
  2. 2016HyperNetworkscited by 1,027
  3. 2015Pointer Networkscited by 895
  4. 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 765
  5. 2018Attention, Learn to Solve Routing Problems!cited by 656
  6. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
  7. 2019Scalable Global Optimization via Local Bayesian Optimizationcited by 374
  8. 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 359
  9. 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 348
  10. 2019An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problemcited by 269
  11. 2017Automated Curriculum Learning for Neural Networkscited by 257
  12. 2021Learning to Optimize: A Primer and A Benchmarkcited by 208
28 more
  1. 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 198
  2. 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 185
  3. 2019A Generalized Algorithm for Multi-Objective Reinforcement Learning and Policy Adaptationcited by 177
  4. 2019Learning Improvement Heuristics for Solving Routing Problemscited by 164
  5. 2017Non-convex Optimization for Machine Learningcited by 133
  6. 2020Learning the Pareto Front with Hypernetworkscited by 125
  7. 2020Sample-Efficient Optimization in the Latent Space of Deep Generative Models via Weighted Retrainingcited by 123
  8. 2019Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problemcited by 117
  9. 2021Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformercited by 108
  10. 2020Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learningcited by 100
  11. 2020Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problemscited by 100
  12. 2021Efficient Active Search for Combinatorial Optimization Problemscited by 100
  13. 2020Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Searchcited by 89
  14. 2022Pareto Set Learning for Neural Multi-objective Combinatorial Optimizationcited by 56
  15. 2020Controllable Pareto Multi-Task Learningcited by 51
  16. 2022Pareto Set Learning for Expensive Multi-Objective Optimizationcited by 51
  17. 2015On Graduated Optimization for Stochastic Non-Convex Problemscited by 34
  18. 2022The effect of smooth parametrizations on nonconvex optimization landscapescited by 21
  19. 2021Learning to Solve Hard Minimal Problemscited by 19
  20. 2019Automatic Differentiation of Some First-Order Methods in Parametric Optimizationcited by 18
  21. 2021Guidelines for the Computational Testing of Machine Learning approaches to Vehicle Routing Problemscited by 16
  22. 2022Single Loop Gaussian Homotopy Method for Non-convex Optimizationcited by 16
  23. 2022Generalizing Gaussian Smoothing for Random Searchcited by 15
  24. 2020Learning to Guide Random Searchcited by 13
  25. 2016Homotopy Analysis for Tensor PCAcited by 12
  26. 2016Mollifying Networkscited by 10
  27. 2022Teaching Networks to Solve Optimization Problemscited by 7
  28. 2020Differentiating the Value Function by using Convex Dualitycited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 5; 2025: 2; 2026: 4.

12 papers.