.png){kind=icon}
返回
Dynamic preference inference network: Improving sample efficiency for multi-objective reinforcement learning by preference estimation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2024.112512.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-objective reinforcement learning (MORL) addresses the challenge of optimizing policies in environments with multiple conflicting objectives. Traditional approaches often rely on scalar utility functions, which require predefined preference weights, limiting their adaptability and efficiency. To overcome this, we propose the Dynamic Preference Inference Network (DPIN), a novel method designed to enhance sample efficiency by dynamically estimating the trajectory decision preference of the agent. DPIN leverages a neural network to predict the most favorable preference distribution for each trajectory, enabling more effective policy updates and improving overall performance in complex MORL tasks. Extensive experiments in various benchmark environments demonstrate that DPIN significantly outperforms existing state-of-the-art methods, achieving higher scalarized returns and hypervolume. Our findings highlight DPIN's ability to adapt to varying preferences, reduce sample complexity, and provide robust solutions in multi-objective settings.
Keyword:
Multi-objective reinforcement learning
Sample efficiency
Reinforcement learning
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
分享收藏
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints使用基于参考点的非支配排序方法的进化多目标优化算法，第一部分: 解决框约束问题
PREAI
分享收藏
查看更多内容