Research map / Reinforcement learning / Policy gradient and actor-critic
User-Oriented Robust Reinforcement Learning
Haoyi You, Beichen Yu, Haiming Jin, Zhaoxing Yang, Jiahui Sun
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 |
|---|---|---|---|
| Optimize the user-weighted UOR objective with the known environment distribution (DB-UOR-RL) | UOR-RL · MuJoCo tasks | UOR E₁ (k=1): DB-UOR-RL is best in each environment | Improved |
| Optimize the user-weighted UOR objective without a known environment distribution (DF-UOR-RL) | UOR-RL · MuJoCo tasks | UOR E₁ (k=1): 13.63 ± 0.59 vs 12.57± 0.59 (Reacher); 3213 ± 399.13 vs 2307 ± 192.94 (Ant) | Improved |
| Use UOR-RL with preference parameter k=0, equivalent to average-return optimization | UOR-RL · MuJoCo tasks | Average return: 19.97 ± 1.11 vs 19.28 ± 1.21 (Reacher); 2910 ± 135.06 vs 2652 ± 125.13 (Half Cheetah) | Mixed |
| Set robustness degree k=21, weighting poor-performing trajectories more strongly | UOR-RL · MuJoCo tasks | Worst 10% trajectory average return: 3.82 ± 0.85 vs -0.14± 1.79 (Reacher); 2497 ± 404.51 vs 2523 ± 195.72 (Half Cheetah) | Mixed |
| Increase preference parameter k, shifting emphasis toward lower-performing trajectories (ablation) | DB-UOR-RL and DF-UOR-RL · Half Cheetah | Average return of trajectories by sorted group | Mixed |
| Use the known environment-parameter distribution to evaluate UOR rather than estimating it distribution-free | UOR-RL · MuJoCo tasks | UOR E₁ (k=1): 14.38 ± 0.86 vs 13.63 ± 0.59 (Reacher); 3212 ± 187.34 vs 3213 ± 399.13 (Ant) | Mixed |
Closest papers by meaning
- Robust Gymnasium: A Unified Modular Benchmark for Robust Reinforcement Learning (ICLR 2025 · similarity 0.91)
- Robust Reinforcement Learning from Corrupted Human Feedback (NeurIPS 2024 · similarity 0.90)
- Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms (NeurIPS 2024 · similarity 0.90)
- Robust Reinforcement Learning with General Utility (NeurIPS 2024 · similarity 0.89)
- Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations (ICLR 2024 · similarity 0.89)
- Adversarial Diffusion for Robust Reinforcement Learning (NeurIPS 2025 · similarity 0.89)
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.
