paper-with-me

홈 › Papers

AETDICE: Unified Framework and Offline Optimization for Nonlinear Multi-Objective RL

2026-06-30 · Woosung Kim, Youngjun Suh, Jinho Lee, Jongmin Lee, Byung-Jun Lee arxiv

Optimizing nonlinear preferences in multi-objective reinforcement learning (MORL) is essential for capturing complex trade-offs like risk aversion or fairness. However, such non-linearity has historically bifurcated nonlinear MORL objectives into two distinct paradigms: Scalarized Expected Return (SER) and Expected Scalarized Return (ESR). While SER requires global-level optimization and ESR requires non-Markovian policies, leading to fragmented optimization strategies, we bridge this divide through the Aggregation-Expectation-Transformation (AET) framework. By unifying both criteria through a tripartite decomposition of scalarization, AET provides a principled foundation for general nonlinear MORL. Building on this framework, we propose AETDICE, a tractable offline RL algorithm for AET objectives. By utilizing DICE-style density-ratio estimation in an augmented state space, AETDICE enables sample-based optimization from static datasets. Our framework resolves long-standing barriers and captures respective trade-offs induced by AET framework, which existing methods fail to address.

📄 PDF Abstract BibTeX arXiv:2606.31178

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement LearningOffline RL

Similar Papers 제목 키워드 기반

FairDICE: Fairness-Driven Offline Multi-Objective Reinforcement Learning

2025-06-09 · Woosung Kim, Jinho Lee, Jongmin Lee, Byung-Jun Lee

Multi-objective reinforcement learning (MORL) aims to optimize policies in the presence of conflicting objectives, where linear scalarization is commonly used to reduce vector-valued returns into scalar signals. While ef…

FairnessMulti-Objective Reinforcement Learningreinforcement-learningReinforcement Learning

Generalized Preference Optimization: A Unified Approach to Offline Alignment

2024-02-08 · Yunhao Tang, Zhaohan Daniel Guo, Zeyu Zheng, Daniele Calandriello 외

Offline preference optimization allows fine-tuning large models directly from offline data, and has proved effective in recent alignment practices. We propose generalized preference optimization (GPO), a family of offlin…

An Adaptive Data-Enabled Policy Optimization Approach for Autonomous Bicycle Control

2025-02-19 · Niklas Persson, Feiran Zhao, Mojtaba Kaheni, Florian Dörfler 외

This paper presents a unified control framework that integrates a Feedback Linearization (FL) controller in the inner loop with an adaptive Data-Enabled Policy Optimization (DeePO) controller in the outer loop to balance…

On the Learnability of Offline Model-Based Optimization: A Ranking Perspective

2026-03-04 · Shen-Huan Lyu, Rong-Xi Tan, Ke Xue, Yi-Xiao He 외 arxiv

Offline model-based optimization (MBO) seeks to discover high-performing designs using only a fixed dataset of past evaluations. Most existing methods rely on learning a surrogate model via regression and implicitly assu…

Value prediction

Online learning for min-max discrete problems

2019-07-12 · Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Nguyen Kim Thang

We study various discrete nonlinear combinatorial optimization problems in an online learning framework. In the first part, we address the question of whether there are negative results showing that getting a vanishing (…

Combinatorial Optimization