.png){kind=icon}
返回
Adaptive Geometry Based Meta-Learning for Multi-Objective Combinatorial Optimization Problems
.png){kind=icon}
PRE
AI
DOI：10.1177/17248035251388509.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In recent years, neural heuristics leveraging deep reinforcement learning have exhibited considerable promise in addressing multi-objective combinatorial optimization problems (MOCOPs). Nonetheless, challenges persist in attaining both high learning efficiency and optimal solution quality. To address this issue, we propose a novel multi-objective optimization algorithm grounded in information geometry and machine learning principles, which integrates adaptive gradient descent with meta-reinforcement learning techniques to effectively tackle MOCOPs. In this paper, we present a meta-learning framework aimed at enhancing model performance in multi-objective combinatorial optimization through tensor remodeling, preconditioned gradient descent, and entropy regularization strategies. Experimental results demonstrate that the proposed method yields significant performance improvements across several classic multi-objective combinatorial optimization challenges, including the Multi-objective Traveling Salesman Problem (MOTSP), Multi-objective Vehicle Routing Problem (MOCVRP), and Multi-objective Knapsack Problem (MOKP).
Keyword:
Riemannian manifold
meta-learning
deep reinforcement learning
multi-objective combinatorial optimization
期刊
I
IF:
1.4
论文数:
8
被引数:
0
机构
引用论文
Zhongjing: Enhancing the Chinese Medical Capabilities of Large Language Model through Expert Feedback and Real-World Multi-Turn Dialogue仲景: 通过专家反馈和真实世界多回合对话提升大语言模式的中国医疗能力
OAAI
OAAI分享收藏分享收藏Mathematical discoveries from program search with large language models使用大型语言模型进行程序搜索的数学发现.png)
Nature
OAAI
NatureIF0
OAAI分享收藏
查看更多内容