Research map / Reinforcement learning / Policy gradient and actor-critic
Time-Consistent Robust Multi-Objective Reinforcement Learning via a Bellman–Isaacs Weight-Adversary Recursion
Mingxi Hu, Meiling Yu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use time-consistent Bellman-Isaacs weight adversary instead of preference-conditioned baselines (CN-DQN, Envelope, PCN, fixed-weight DQN) | proposed method · Timespeed, Timemove, DeepSeaTreasure under BR-K (lambda=1.0) | WRR | Improved |
| evaluate with BR-K (min over K independent best-response adversaries) rather than a single adversary | BR-K protocol · evaluation | robustness estimate | Improved |
| increase switching cost lambda (ablation) | proposed method · MO-Gymnasium benchmarks | DRIFT | Improved |
Closest papers by meaning
- Towards Optimal Adversarial Robust Q-learning with Bellman Infinity-error (ICML 2024 · similarity 0.88)
- Preference Conditioned Multi-Objective Reinforcement Learning: Decomposed, Diversity-Driven Policy Optimization (NeurIPS 2026 · similarity 0.87)
- Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learning (NeurIPS 2025 · similarity 0.87)
- Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations (ICLR 2024 · similarity 0.87)
- Learning to Trust Bellman Updates: Selective State-Adaptive Regularization for Offline RL (ICML 2025 · similarity 0.87)
- Time-Constrained Robust MDPs (NeurIPS 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
