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 View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 16 code samples harvested from 1 repository linked to this paper: 14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 16 samples from 1 repository, 14 ran (13 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

lucasalegre/morl-baselines officialmentioned in papermentioned on GitHubpytorchMITSyntology: 16 samples, 14 ran (1 instrument-failed) · 2 unverified 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 (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
1ran · our draft was wrong
12ran
2unverified

Licence: 3 of the 16 samples are pointer only, meaning Syntology does not serve that copy's text. For 3 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. 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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

lucasalegre/morl-baselines official repository 16 samples, 14 ran (1 instrument-failed) · 2 unverified
batched_strict_pareto_dominates morl_baselines/common/pareto.py ran MIT (permissive) · 1c6e6dfeda5499f4 · report fixture: signature p1:ndarray/1/float, p2:ndarray/2/float · returned ndarray · level recorded 2026-09-24
eval_mo morl_baselines/common/evaluation.py ran MIT (permissive) · b35fb4a0abf9a930 · report fixture: signature agent:MinimalAgent/0/?, env:MinimalMOEnv/0/?, w:ndarray/1/float, scalarization:callable/0/?, render:bool/0/bool · returned tuple · level recorded 2026-09-24
eval_mo_reward_conditioned morl_baselines/common/evaluation.py ran MIT (permissive) · 898a057c41d3020c · report fixture: signature agent:callable/0/?, env:MockMOEnv/0/?, scalarization:callable/0/?, w:ndarray/1/float, render:bool/0/bool · returned tuple · level recorded 2026-09-24
get_grad_norm in 45 papers morl_baselines/common/networks.py ran · honoured contract MIT (permissive) here; the stored copy is pointer only · 8f1ea214cc32f2fb · report fixture: signature params:list/1/Tensor · returned Tensor · level recorded 2026-09-24
huber in 13 papers morl_baselines/common/networks.py ran · our draft was wrong fingerprinted MIT (permissive) here; the stored copy is pointer only · 5f99e218ffb1f571 · report fixture: signature x:Tensor/2/float, min_priority:float/0/float · returned Tensor · level recorded 2026-09-24
hypervolume morl_baselines/common/performance_indicators.py ran MIT (permissive) · 44b557d8a57cc873 · report fixture: signature ref_point:ndarray/1/float, points:list/1/ndarray · returned float · level recorded 2026-09-24
igd morl_baselines/common/performance_indicators.py ran fingerprinted MIT (permissive) · 08aa772fef27e128 · report fixture: signature known_front:list/1/ndarray, current_estimate:list/1/ndarray · returned float · level recorded 2026-09-24
mlp in 108 papers morl_baselines/common/networks.py ran MIT (permissive) here; the stored copy is pointer only · 0be43fb4202eab1d · report fixture: signature input_dim:int/0/int, output_dim:int/0/int, net_arch:list/1/int, activation_fn:callable/0/?, drop_rate:float/0/float, layer_norm:bool/0/bool · returned Sequential · level recorded 2026-09-24
pareto_dominates morl_baselines/common/pareto.py ran MIT (permissive) · bd1833f5de4d0dc3 · report fixture: signature a:ndarray/1/float, b:ndarray/1/float · returned bool · level recorded 2026-09-24
policy_evaluation_mo morl_baselines/common/evaluation.py ran MIT (permissive) · 5919389186ead20d · report fixture: signature agent:SimpleAgent/0/?, env:SimpleEnv/0/?, w:ndarray/1/float, scalarization:callable/0/?, rep:int/0/int · returned tuple · level recorded 2026-09-24
sparsity in 14 papers morl_baselines/common/performance_indicators.py ran MIT (permissive) · 2b2dc8f8136c4aa6 · report fixture: signature front:list/1/ndarray · returned float64 · level recorded 2026-09-24
strict_pareto_dominates morl_baselines/common/pareto.py ran MIT (permissive) · 676343961f252e94 · report fixture: signature a:ndarray/1/float, b:ndarray/1/float · returned bool · level recorded 2026-09-24
termination_fn_false morl_baselines/common/model_based/utils.py ran MIT (permissive) · 588e44b51bd35f8b · report fixture: signature obs:ndarray/2/float, act:ndarray/2/float, next_obs:ndarray/2/float, rew:ndarray/2/float · returned ndarray · level recorded 2026-09-24
termination_fn_mountaincar morl_baselines/common/model_based/utils.py ran MIT (permissive) · f3d4dcab39a7cd0c · report fixture: signature obs:ndarray/2/float, act:ndarray/2/float, next_obs:ndarray/2/float, rew:ndarray/2/float · returned ndarray · level recorded 2026-09-24
crowd_dist morl_baselines/common/diverse_buffer.py unverified MIT (permissive) · a58e028fa09540e2 · report
termination_fn_dst morl_baselines/common/model_based/utils.py 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