Papers › Multi-Objective Reinforcement Learning Based on Decomposition: A Taxonomy and Framework

Multi-Objective Reinforcement Learning Based on Decomposition: A Taxonomy and Framework

21 Nov 2023arXiv:2311.12495archive 2025-07-28

Florian Felten, El-Ghazali Talbi, Grégoire Danoy

Multi-objective reinforcement learning (MORL) extends traditional RL by seeking policies making different compromises among conflicting objectives. The recent surge of interest in MORL has led to diverse studies and solving methods, often drawing from existing knowledge in multi-objective optimization based on decomposition (MOO/D). Yet, a clear categorization based on both RL and MOO/D is lacking in the existing literature. Consequently, MORL researchers face difficulties when trying to classify contributions within a broader context due to the absence of a standardized taxonomy. To tackle such an issue, this paper introduces multi-objective reinforcement learning based on decomposition (MORL/D), a novel methodology bridging the literature of RL and MOO. A comprehensive taxonomy for MORL/D is presented, providing a structured foundation for categorizing existing and potential MORL works. The introduced taxonomy is then used to scrutinize MORL research, enhancing clarity and conciseness through well-defined categorization. Moreover, a flexible framework derived from the taxonomy is introduced. This framework accommodates diverse instantiations using tools from both RL and MOO/D. Its versatility is demonstrated by implementing it in different configurations and assessing it on contrasting benchmark problems. Results indicate MORL/D instantiations achieve comparable performance to current state-of-the-art approaches on the studied problems. By presenting the taxonomy and framework, this paper offers a comprehensive perspective and a unified vocabulary for MORL. This not only facilitates the identification of algorithmic contributions but also lays the groundwork for novel research avenues in MORL.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2311.12495")

Code

Syntology Ran 14 of 16 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 14 ran with no contract checked.

By repository: official repository: 16 samples from 1 repository, 14 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

lucasalegre/morl-baselines officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

16 samples harvested; 14 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

14ran
2unverified

Licence: 0 of the 16 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from lucasalegre/morl-baselines. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

batched_strict_pareto_dominates lucasalegre/morl-baselines/morl_baselines/common/pareto.py official repository ran MIT (permissive) · 1c6e6dfeda5499f4 · report
eval_mo lucasalegre/morl-baselines/morl_baselines/common/evaluation.py official repository ran MIT (permissive) · b35fb4a0abf9a930 · report
eval_mo_reward_conditioned lucasalegre/morl-baselines/morl_baselines/common/evaluation.py official repository ran MIT (permissive) · 898a057c41d3020c · report
get_grad_norm lucasalegre/morl-baselines/morl_baselines/common/networks.py official repository ran MIT (permissive) · 8f1ea214cc32f2fb · report
huber lucasalegre/morl-baselines/morl_baselines/common/networks.py official repository ran fingerprinted MIT (permissive) · 5f99e218ffb1f571 · report
hypervolume lucasalegre/morl-baselines/morl_baselines/common/performance_indicators.py official repository ran MIT (permissive) · 44b557d8a57cc873 · report
igd lucasalegre/morl-baselines/morl_baselines/common/performance_indicators.py official repository ran MIT (permissive) · 08aa772fef27e128 · report
mlp lucasalegre/morl-baselines/morl_baselines/common/networks.py official repository ran MIT (permissive) · 0be43fb4202eab1d · report
pareto_dominates lucasalegre/morl-baselines/morl_baselines/common/pareto.py official repository ran MIT (permissive) · bd1833f5de4d0dc3 · report
policy_evaluation_mo lucasalegre/morl-baselines/morl_baselines/common/evaluation.py official repository ran MIT (permissive) · 5919389186ead20d · report
sparsity lucasalegre/morl-baselines/morl_baselines/common/performance_indicators.py official repository ran MIT (permissive) · 2b2dc8f8136c4aa6 · report
strict_pareto_dominates lucasalegre/morl-baselines/morl_baselines/common/pareto.py official repository ran MIT (permissive) · 676343961f252e94 · report
termination_fn_false lucasalegre/morl-baselines/morl_baselines/common/model_based/utils.py official repository ran MIT (permissive) · 588e44b51bd35f8b · report
termination_fn_mountaincar lucasalegre/morl-baselines/morl_baselines/common/model_based/utils.py official repository ran MIT (permissive) · f3d4dcab39a7cd0c · report
crowd_dist lucasalegre/morl-baselines/morl_baselines/common/diverse_buffer.py official repository unverified MIT (permissive) · a58e028fa09540e2 · report
termination_fn_dst lucasalegre/morl-baselines/morl_baselines/common/model_based/utils.py official repository unverified MIT (permissive) · 2d6f81daef1c364d · report

Tasks

Multi-Objective Reinforcement Learningreinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections