Continuation Path Learning for Homotopy Optimization
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
- 2017Attention Is All You Needcited by 60,361
- 2016HyperNetworkscited by 1,027
- 2015Pointer Networkscited by 895
- 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 765
- 2018Attention, Learn to Solve Routing Problems!cited by 656
- 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
- 2019Scalable Global Optimization via Local Bayesian Optimizationcited by 374
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 359
- 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 348
- 2019An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problemcited by 269
- 2017Automated Curriculum Learning for Neural Networkscited by 257
- 2021Learning to Optimize: A Primer and A Benchmarkcited by 208
28 more
- 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 198
- 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 185
- 2019A Generalized Algorithm for Multi-Objective Reinforcement Learning and Policy Adaptationcited by 177
- 2019Learning Improvement Heuristics for Solving Routing Problemscited by 164
- 2017Non-convex Optimization for Machine Learningcited by 133
- 2020Learning the Pareto Front with Hypernetworkscited by 125
- 2020Sample-Efficient Optimization in the Latent Space of Deep Generative Models via Weighted Retrainingcited by 123
- 2019Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problemcited by 117
- 2021Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformercited by 108
- 2020Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learningcited by 100
- 2020Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problemscited by 100
- 2021Efficient Active Search for Combinatorial Optimization Problemscited by 100
- 2020Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Searchcited by 89
- 2022Pareto Set Learning for Neural Multi-objective Combinatorial Optimizationcited by 56
- 2020Controllable Pareto Multi-Task Learningcited by 51
- 2022Pareto Set Learning for Expensive Multi-Objective Optimizationcited by 51
- 2015On Graduated Optimization for Stochastic Non-Convex Problemscited by 34
- 2022The effect of smooth parametrizations on nonconvex optimization landscapescited by 21
- 2021Learning to Solve Hard Minimal Problemscited by 19
- 2019Automatic Differentiation of Some First-Order Methods in Parametric Optimizationcited by 18
- 2021Guidelines for the Computational Testing of Machine Learning approaches to Vehicle Routing Problemscited by 16
- 2022Single Loop Gaussian Homotopy Method for Non-convex Optimizationcited by 16
- 2022Generalizing Gaussian Smoothing for Random Searchcited by 15
- 2020Learning to Guide Random Searchcited by 13
- 2016Homotopy Analysis for Tensor PCAcited by 12
- 2016Mollifying Networkscited by 10
- 2022Teaching Networks to Solve Optimization Problemscited by 7
- 2020Differentiating the Value Function by using Convex Dualitycited by 3
Built on by
Citing papers per year: 2023: 1; 2024: 5; 2025: 2; 2026: 4.
12 papers.
- 2024Smooth Tchebycheff Scalarization for Multi-Objective Optimizationcited by 54
- 2023Controlling Continuous Relaxation for Combinatorial Optimizationcited by 16
- 2024QuasiSim: Parameterized Quasi-Physical Simulators for Dexterous Manipulations Transfercited by 12
- 2025Learning (Approximately) Equivariant Networks via Constrained Optimizationcited by 10
- 2024Global Optimization with A Power-Transformed Objective and Gaussian Smoothingcited by 4
- 2026Improving Classifier-Free Guidance of Flow Matching via Manifold Projectioncited by 3
- 2024Joint Fine-tuning and Conversion of Pretrained Speech and Language Models towards Linear Complexitycited by 2
- 2026Neural Predictor-Corrector: Solving Homotopy Problems with Reinforcement Learningcited by 2
- 2025Power Homotopy for Zeroth-Order Non-Convex Optimizationscited by 1
- 2024Real-time Hybrid System Identification with Online Deterministic Annealingcited by 0
- 2026Progressive Power Homotopy for Non-convex Optimizationcited by 0
- 2026CalcSeg: Confidence-aware 3D Latent Context Curriculum Learning For Myocardial Scar Segmentation From Single-Stack LGE-CMRscited by 0
- 2026CalcSeg: Confidence-aware 3D Latent Context Curriculum Learning For Myocardial Scar Segmentation From Single-Stack LGE-CMRs20 Aug 2026
- 2026Neural Predictor-Corrector: Solving Homotopy Problems with Reinforcement Learning3 Feb 2026
- 2026Improving Classifier-Free Guidance of Flow Matching via Manifold Projection29 Jan 2026
- 2026Progressive Power Homotopy for Non-convex Optimization22 Jan 2026
- 2025Power Homotopy for Zeroth-Order Non-Convex Optimizations17 Nov 2025
- 2025Learning (Approximately) Equivariant Networks via Constrained Optimization19 May 2025
- 2024Global Optimization with A Power-Transformed Objective and Gaussian Smoothing6 Dec 2024
- 2024Joint Fine-tuning and Conversion of Pretrained Speech and Language Models towards Linear Complexity9 Oct 2024
- 2024Real-time Hybrid System Identification with Online Deterministic Annealing3 Aug 2024
- 2024QuasiSim: Parameterized Quasi-Physical Simulators for Dexterous Manipulations Transfer11 Apr 2024
- 2024Smooth Tchebycheff Scalarization for Multi-Objective Optimization29 Feb 2024
- 2023Controlling Continuous Relaxation for Combinatorial Optimization29 Sep 2023