Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

3887751,1631,550 · Jun 202019922001200920172026
48 results for multi-objective reinforcement learning

Proof of convergence for multi-objective optimization using inverse reinforcement learning.

problem Proving convergence in multi-objective optimization problems.
method Wasserstein inverse reinforcement learning with projective subgradient method and gradient descent.
result Convergence of inverse reinforcement learning for multi-objective optimization.

Proof shows imitation of expert's reward and solutions in multi-objective optimization.

problem Multi-objective optimization with reward and solution imitation.
method Wasserstein inverse reinforcement learning.
result Wasserstein inverse reinforcement learning enables imitation of expert's reward and solutions in multi-objective optimization.

This paper introduces a new scalable multi-objective deep reinforcement learning (MODRL) framework based on deep Q-networks. We develop a high-performance MODRL framework that supports both single-policy and multi-policy strategies, as well as both linear and non-linear approaches to action selection. The experimental …

2018-03-08abs ↗pdf ↗

The paper explores a Multi-Objective RL approach for trading that generalizes reward functions.

problem Improving performance in single-asset trading through adaptive reward functions.
method Developed a Multi-Objective Deep Reinforcement Learning algorithm to generalize reward functions and discount factors.
result The Multi-Objective algorithm demonstrates increased predictive stability and better performance in sparse reward scenarios.

Deep learning agent improves pedestrian navigation in urban environments.

problem Autonomous driving among pedestrians in urban areas.
method Multi-objective deep reinforcement learning using a deep Q-learning variant.
result The multi-objective DQN agent outperforms single-objective DQN in various environments.

Paper tackles multi-object reinforcement learning, improving skill extrapolation.

problem Learning robust manipulation tasks in multi-object settings.
method Introduces a linear relation network module to enhance skill generalization.
result Agents can extrapolate and generalize to any new object number, scaling linearly.

Proposes a novel algorithm for multi-objective reinforcement learning.

problem Challenges in setting numerical preferences for objectives in different units and scales.
method Learn action distributions for each objective and use supervised learning to fit a parametric policy.
result Demonstrates effectiveness on robotics tasks, allowing tracing out the space of nondominated solutions.

Develops a new method to improve performance in multi-objective learning problems.

problem Gradient bias in multi-objective learning leading to degraded performance.
method Stochastic Multi-objective gradient Correction (MoCo) method that guarantees convergence without increasing batch size.
result Demonstrates effectiveness of MoCo method in simulations on multi-task learning.

This work overcomes bias in concave multi-objective reinforcement learning.

problem Gradient bias in policy gradient methods for concave scalarized multi-objective reinforcement learning.
method Developed a Natural Policy Gradient (NPG) algorithm with a multi-level Monte Carlo (MLMC) estimator.
result Achieved optimal O~(ε2)\widetilde{\mathcal{O}}(ε^{-2}) sample complexity for computing an εε-optimal policy.

Paper tackles regret bounds and exploration complexity for multi-objective reinforcement learning with picky preferences.

problem Formalizing multi-objective reinforcement learning with adversarial preferences.
method Model-based algorithm with nearly optimal regret bound and preference-free exploration.
result Achieves nearly minimax optimal regret bound and nearly optimal trajectory complexity.

Proposes new stochastic algorithms for multi-objective optimization.

problem Multi-objective optimization in machine learning problems.
method Direction-oriented multi-objective formulation and Stochastic Direction-oriented Multi-objective Gradient descent (SDMGrad).
result Stochastic algorithms converge to Pareto stationary points with improved complexities.

Many real-world decision problems are characterized by multiple conflicting objectives which must be balanced based on their relative importance. In the dynamic weights setting the relative importance changes over time and specialized algorithms that deal with such change, such as a tabular Reinforcement Learning (RL) …

2018-09-20abs ↗pdf ↗

MERLIN tackles multi-objective task scheduling with hierarchical DRL, outperforming existing methods.

problem Optimizing multiple conflicting constraints in multi-objective task scheduling with varying queue sizes.
method Hierarchical deep reinforcement learning approach to manage large queues efficiently.
result MERLIN outperforms existing methods by a large margin (>22%) on multiple queue sizes.

A new multi-objective RL framework improves intrinsic exploration performance.

problem Sub-optimal exploration performance due to ad-hoc handling of intrinsic exploration.
method A multi-objective RL framework where both exploration and exploitation are optimized as separate objectives.
result EMU-Q method outperforms classic and other intrinsic RL methods on benchmarks.

Study optimality in safety-constrained Markov decision processes using asynchronous value iteration and modified Q-learning.

problem Optimality in safety-constrained Markov decision processes with multichain structure.
method Formulated as a zero-sum game, constructed asynchronous value iteration scheme and modified Q-learning algorithm.
result Resolved Bellman's principle of optimality for multichain Markov decision processes and provided learning algorithms.

DPA aligns LLMs with multi-objective rewards for diverse user preferences.

problem Fine-grained control over LLMs for diverse user needs.
method Integrates multi-objective reward modeling and directional preference control.
result DPA offers better performance trade-offs and intuitive user control over LLM generation.

The paper proposes a method to infer multi-objective rewards from preferences.

problem Modeling preferences based on multiple, often competing objectives.
method Modeling priorities lexicographically and inferring multi-objective rewards from observed preferences.
result Lexicographically-ordered rewards provide a better understanding of preferences and improve policies.

This paper analyzes MORL and proposes efficient algorithms to learn Pareto optimal policies.

problem Understanding and efficiently learning Pareto optimal policies in multi-objective reinforcement learning.
method Systematic analysis of optimization targets, reformulation of Tchebycheff scalarization, online UCB-based algorithm, preference-free framework.
result Identification of Tchebycheff scalarization as a favorable method and efficient algorithms for learning Pareto optimal policies.

Unified framework for multi-objective curriculum learning in robotics.

problem Improving sample efficiency and final performance in robotic policy learning.
method Unified automatic curriculum learning framework with multi-task hyper-net and flexible memory mechanism.
result Superior performance compared to state-of-the-art methods in robotic manipulation tasks.

We present a framework, which we call Molecule Deep QQ-Networks (MolDQN), for molecule optimization by combining domain knowledge of chemistry and state-of-the-art reinforcement learning techniques (double QQ-learning and randomized value functions). We directly define modifications on molecules, thereby ensuring 100…

2018-10-19abs ↗pdf ↗

SAMBA improves safe reinforcement learning with active exploration metrics.

problem Safe reinforcement learning in dynamic systems.
method Combines probabilistic modelling, information theory, and statistics. Uses novel metrics for out-of-sample Gaussian process evaluation.
result Orders of magnitude reduction in samples and violations compared to state-of-the-art methods.

The standard reinforcement learning (RL) formulation considers the expectation of the (discounted) cumulative reward. This is limiting in applications where we are concerned with not only the expected performance, but also the distribution of the performance. In this paper, we introduce micro-objective reinforcement le…

2019-05-24abs ↗pdf ↗

Optimizes mobile notifications for multiple objectives using reinforcement learning.

problem Optimizing mobile notification systems for multiple objectives.
method End-to-end offline reinforcement learning with Double Deep Q-network and Conservative Q-learning.
result Demonstrates improved performance and benefits of the proposed approach.

PRISM integrates diverse rewards in MORL, improving sample efficiency and Pareto coverage.

problem Heterogeneous MORL where dense objectives dominate, leading to poor sample efficiency.
method PRISM uses reflectional symmetry and ReSymNet to reconcile temporal-frequency mismatches and accelerate exploration.
result PRISM consistently outperforms sparse-reward baselines and oracles, achieving significant Pareto gains.

Generative thermal design learns optimal shapes using multi-agent reinforcement learning.

problem Complex thermal design challenges due to convection-diffusion equation and boundary interactions.
method Cooperative multi-agent deep reinforcement learning with continuous geometric representation.
result Framework learns optimal design strategies without shape derivation or differentiable objectives.

The paper tackles scalarization issues in A2C RL algorithms, proposing methods to avoid gradient overlap and noise.

problem Scalarization issues in A2C RL algorithms leading to gradient overlap and uncontrolled noise.
method Proposes techniques to avoid gradient overlap and noise in A2C RL algorithms.
result Pilot experiments show the proposed method speeds up training in A2C RL algorithms.

Fairness is essential for human society, contributing to stability and productivity. Similarly, fairness is also the key for many multi-agent systems. Taking fairness into multi-agent learning could help multi-agent systems become both efficient and stable. However, learning efficiency and fairness simultaneously is a …

2019-10-31abs ↗pdf ↗

This paper surveys gradient-based multi-objective deep learning methods.

problem Balancing multiple conflicting objectives in deep learning models.
method Gradient-based techniques adapted from Multi-Objective Optimization.
result Comprehensive survey of gradient-based multi-objective deep learning algorithms.

New algorithms for multivariate RL improve decision-making in complex systems.

problem Complex multi-objective decision-making in reinforcement learning.
method Oracle-free and computationally-tractable algorithms for multivariate distributional RL.
result Convergence rates match scalar reward settings and provide insights into reward dimensionality.

In statistical modelling the biggest threat is concept drift which makes the model gradually showing deteriorating performance over time. There are state of the art methodologies to detect the impact of concept drift, however general strategy considered to overcome the issue in performance is to rebuild or re-calibrate…

2018-10-07abs ↗pdf ↗

This work fills the gap in understanding multi-objective learning generalization.

problem Lack of statistical learning theory insights into multi-objective learning generalization.
method Established generalization bounds and excess bounds for multi-objective learning.
result Showed that all Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa.

This paper introduces multi-objective hyperparameter optimization in machine learning.

problem Optimizing machine learning pipelines for multiple objectives, not just accuracy.
method Survey of optimization strategies and applications in multi-objective hyperparameter optimization.
result The importance and utility of multi-objective hyperparameter optimization in applied machine learning.

A new method for diverse Pareto solutions in multi-objective learning.

problem Maximizing diversity while maximizing hypervolume in Pareto solutions.
method Annealed Stein Variational Gradient Descent (SVGD) with diverse gradient directions.
result SVH-MOL achieves superior performance in multi-objective and multi-task learning.

Bayesian optimization improves DRL for ESG portfolio management.

problem Optimizing hyperparameters of DRL agents for ESG metrics.
method Bayesian optimization for noisy, expensive-to-evaluate functions.
result Multi-objective optimization yields optimal Pareto set of portfolios.