# Dynamic Preference Multi-Objective Reinforcement Learning for Internet Network Management

arXiv: https://arxiv.org/abs/2506.13153 · HTML: https://mlsanity.com/paper/2506.13153/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Placed in RL for games and combinatorial optimization, one of 15 directions in Deep reinforcement learning methods.
- Builds on 9 of its 16 references that are in the map.
- First posted on arXiv 16 Jun 2025.

## Placed in

- Deep reinforcement learning methods / [RL for games and combinatorial optimization](https://mlsanity.com/deeprl/rl-for-games-and-combinatorial-optimization/)

## Builds on (most cited first, 9 of 9)

- [Proximal Policy Optimization Algorithms](https://mlsanity.com/paper/1707.06347/) (2017)
- [Efficient Estimation of Word Representations in Vector Space](https://mlsanity.com/paper/1301.3781/) (2013)
- [Gated Graph Sequence Neural Networks](https://mlsanity.com/paper/1511.05493/) (2015)
- [A Generalized Algorithm for Multi-Objective Reinforcement Learning and Policy Adaptation](https://mlsanity.com/paper/1908.08342/) (2019)
- [Network Function Virtualization: State-of-the-art and Research Challenges](https://mlsanity.com/paper/1509.07675/) (2015)
- [Graph Neural Network based Service Function Chaining for Automatic Network Control](https://mlsanity.com/paper/2009.05240/) (2020)
- [On Orchestrating Virtual Network Functions in NFV](https://mlsanity.com/paper/1503.06377/) (2015)
- [Reinforcement Learning of Graph Neural Networks for Service Function Chaining](https://mlsanity.com/paper/2011.08406/) (2020)
- [Sequential Deep Learning Architectures for Anomaly Detection in Virtual Network Function Chains](https://mlsanity.com/paper/2109.14276/) (2021)

## Built on by (most cited first, 1 of 1)

- [Preference-Conditioned Reinforcement Learning for Space-Time Efficient Online 3D Bin Packing](https://mlsanity.com/paper/2603.07800/) (2026)

## Abstract (arXiv)

An internet network service provider manages its network with multiple objectives, such as high quality of service (QoS) and minimum computing resource usage. To achieve these objectives, a reinforcement learning-based (RL) algorithm has been proposed to train its network management agent. Usually, their algorithms optimize their agents with respect to a single static reward formulation consisting of multiple objectives with fixed importance factors, which we call preferences. However, in practice, the preference could vary according to network status, external concerns and so on. For example, when a server shuts down and it can cause other servers' traffic overloads leading to additional shutdowns, it is plausible to reduce the preference of QoS while increasing the preference of minimum computing resource usages. In this paper, we propose new RL-based network management agents that can select actions based on both states and preferences. With our proposed approach, we expect a single agent to generalize on various states and preferences. Furthermore, we propose a numerical method that can estimate the distribution of preference that is advantageous for unbiased training. Our experiment results show that the RL agents trained based on our proposed approach significantly generalize better with various preferences than the previous RL approaches, which assume static preference during training. Moreover, we demonstrate several analyses that show the advantages of our numerical estimation method.