9 citations · 35 across the 19 of their papers we have counts for
20 papers
Hyper Algorithm Design Agent: Evolving Learnable Optimizer from Zero
Zipei Yu, Yue-Jiao Gong, Zeyuan Ma +2
Meta-Black-Box Optimization (MetaBBO) is one of the highlights in the recent AI for Optimization trend. This paradigm's bi-level workflow leverages the learnable algorithm design p…
READY: Reward Discovery for Meta-Black-Box Optimization
Zechuan Huang, Zhiguang Cao, Hongshu Guo +2
Meta-Black-Box Optimization (MetaBBO) is an emerging avenue within Optimization community, where algorithm design policy could be meta-learned by reinforcement learning to enhance…
Evolutionary System 2 Reasoning: An Empirical Proof
Zeyuan Ma, Wenqi Huang, Guo-Huan Song +4
Machine intelligence marks the ultimate dream of making machines' intelligence comparable to human beings. While recent progress in Large Language Models (LLMs) show substantial sp…
Probing Neural Combinatorial Optimization Models
Zhiqin Zhang, Yining Ma, Zhiguang Cao +1
Neural combinatorial optimization (NCO) has achieved remarkable performance, yet its learned model representations and decision rationale remain a black box. This impedes both acad…
Instance Generation for Meta-Black-Box Optimization through Latent Space Reverse Engineering
Chen Wang, Yue-Jiao Gong, Zhiguang Cao +1
To relieve intensive human-expertise required to design optimization algorithms, recent Meta-Black-Box Optimization (MetaBBO) researches leverage generalization strength of meta-le…
SHIELD: Multi-task Multi-distribution Vehicle Routing Solver with Sparsity and Hierarchy
Yong Liang Goh, Zhiguang Cao, Yining Ma +3
Recent advances toward foundation models for routing problems have shown great potential of a unified deep model for various VRP variants. However, they overlook the complex real-w…
Meta-Black-Box-Optimization through Offline Q-function Learning
Zeyuan Ma, Zhiguang Cao, Zhou Jiang +2
Recent progress in Meta-Black-Box-Optimization (MetaBBO) has demonstrated that using RL to learn a meta-level policy for dynamic algorithm configuration (DAC) over an optimization…
Generalizable Heuristic Generation Through LLMs with Meta-Optimization
Yiding Shi, Jianan Zhou, Wen Song +4
Heuristic design with large language models (LLMs) has emerged as a promising approach for tackling combinatorial optimization problems (COPs). However, existing approaches often r…
Surrogate Learning in Meta-Black-Box Optimization: A Preliminary Study
Zeyuan Ma, Zhiyang Huang, Jiacheng Chen +2
Recent Meta-Black-Box Optimization (MetaBBO) approaches have shown possibility of enhancing the optimization performance through learning meta-level policies to dynamically configu…
Diversity Optimization for Travelling Salesman Problem via Deep Reinforcement Learning
Qi Li, Zhiguang Cao, Yining Ma +2
Existing neural methods for the Travelling Salesman Problem (TSP) mostly aim at finding a single optimal solution. To discover diverse yet high-quality solutions for Multi-Solution…
ConfigX: Modular Configuration for Evolutionary Algorithms via Multitask Reinforcement Learning
Hongshu Guo, Zeyuan Ma, Jiacheng Chen +4
Recent advances in Meta-learning for Black-Box Optimization (MetaBBO) have shown the potential of using neural networks to dynamically configure evolutionary algorithms (EAs), enha…
Learning to Handle Complex Constraints for Vehicle Routing Problems
Jieyi Bi, Yining Ma, Jianan Zhou +4
Vehicle Routing Problems (VRPs) can model many real-world scenarios and often involve complex constraints. While recent neural methods excel in constructing solutions based on feas…
Hierarchical Neural Constructive Solver for Real-world TSP Scenarios
Yong Liang Goh, Zhiguang Cao, Yining Ma +3
Existing neural constructive solvers for routing problems have predominantly employed transformer architectures, conceptualizing the route construction as a set-to-sequence learnin…
MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts
Jianan Zhou, Zhiguang Cao, Yaoxin Wu +4
Learning to solve vehicle routing problems (VRPs) has garnered much attention. However, most neural solvers are only structured and trained independently on a specific problem, mak…
Deep Reinforcement Learning for Dynamic Algorithm Selection: A Proof-of-Principle Study on Differential Evolution
Hongshu Guo, Yining Ma, Zeyuan Ma +5
Evolutionary algorithms, such as Differential Evolution, excel in solving real-parameter optimization challenges. However, the effectiveness of a single algorithm varies across dif…
LLaMoCo: Instruction Tuning of Large Language Models for Optimization Code Generation
Zeyuan Ma, Hongshu Guo, Jiacheng Chen +4
Recent research explores optimization using large language models (LLMs) by either iteratively seeking next-step solutions from LLMs or directly prompting LLMs for an optimizer. Ho…
Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt
Yining Ma, Zhiguang Cao, Yeow Meng Chee
In this paper, we present Neural k-Opt (NeuOpt), a novel learning-to-search (L2S) solver for routing problems. It learns to perform flexible k-opt exchanges based on a tailored act…
MetaBox: A Benchmark Platform for Meta-Black-Box Optimization with Reinforcement Learning
Zeyuan Ma, Hongshu Guo, Jiacheng Chen +5
Recently, Meta-Black-Box Optimization with Reinforcement Learning (MetaBBO-RL) has showcased the power of leveraging RL at the meta-level to mitigate manual fine-tuning of low-leve…
Efficient Meta Neural Heuristic for Multi-Objective Combinatorial Optimization
Jinbiao Chen, Jiahai Wang, Zizhen Zhang +3
Recently, neural heuristics based on deep reinforcement learning have exhibited promise in solving multi-objective combinatorial optimization problems (MOCOPs). However, they are s…
Neural Multi-Objective Combinatorial Optimization with Diversity Enhancement
Jinbiao Chen, Zizhen Zhang, Zhiguang Cao +4
Most of existing neural methods for multi-objective combinatorial optimization (MOCO) problems solely rely on decomposition, which often leads to repetitive solutions for the respe…