Value Alignment inside a Defended Transition Ambiguity Set

Authors

  • Simon Campbell Author
  • Jack Porter Author
  • Ethan Sanders Author

Abstract

Heterogeneous offline values may require alignment before robust Bellman updates become interpretable. Evaluation should distinguish value compatibility, behavior support, and ambiguity scale. Independent policy outcomes under declared shifts assess the complete action. A faster robust calculation solves its defined optimization problem without establishing that incompatible stored values or excluded dynamics were repaired. This focused synthesis develops an empirical comparison that preserves the terminal action, observation process, and total verification cost. Its proposed tests are prospective; no new simulation run, model-training result, or intervention effect is reported.

References

  1. Z. Qiao, J. Lyu, C. Bai, P. Wang, S. Gao, and S. Qiu, “Unifying Value Alignment and Assignment in Cross-Domain Offline Reinforcement Learning with Heterogeneous Datasets,” Proceedings of the 2026 International Conference on Machine Learning, 2026.
  2. Z. Yu, L. Dai, S. Xu, S. Gao, and C. Ho, “Fast Bellman Updates for Wasserstein Distributionally Robust MDPs,” Advances in Neural Information Processing Systems, pp. 30554–30578, 2023.
  3. Li, Yuanhao, Mingshan Liu, Hongbo Wang, Yiding Zhang, Yifei Ma, and Wei Tan. “DRAFT-RL: Multi-Agent Chain-of-Draft Reasoning for Reinforcement Learning-Enhanced LLMs.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 40, no. 35, 2026, pp. 29530-29537. https://doi.org/10.1609/aaai.v40i35.40195.
  4. Rasmussen, Carl Edward, and Christopher K. I. Williams. Gaussian Processes for Machine Learning. MIT Press, 2006. https://gaussianprocess.org/gpml/.
  5. Hu, Edward J., et al. “LoRA: Low-Rank Adaptation of Large Language Models.” International Conference on Learning Representations, 2022. https://openreview.net/forum?id=nZeVKeeFYf9.
  6. Guo, Chuan, Geoff Pleiss, Yu Sun, and Kilian Q. Weinberger. “On Calibration of Modern Neural Networks.” Proceedings of the 34th International Conference on Machine Learning, PMLR, vol. 70, 2017, pp. 1321–1330. https://proceedings.mlr.press/v70/guo17a.html.
  7. Sutton, Richard S., and Andrew G. Barto. Reinforcement Learning: An Introduction. 2nd ed., MIT Press, 2018. http://incompleteideas.net/book/the-book-2nd.html.
  8. Levine, Sergey, Aviral Kumar, George Tucker, and Justin Fu. “Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems.” arXiv, 2020, arXiv:2005.01643. https://arxiv.org/abs/2005.01643.
  9. Kumar, Aviral, Aurick Zhou, George Tucker, and Sergey Levine. “Conservative Q-Learning for Offline Reinforcement Learning.” Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 1179–1191. https://arxiv.org/abs/2006.04779.
  10. Lewis, Patrick, et al. “Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks.” Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 9459–9474. https://arxiv.org/abs/2005.11401.
  11. Geifman, Yonatan, and Ran El-Yaniv. “Selective Classification for Deep Neural Networks.” Advances in Neural Information Processing Systems, vol. 30, 2017. https://arxiv.org/abs/1705.08500.

Downloads

Published

2025-10-21

Versions

Issue

Vol. 1 No. 10 (2025): October 2025

Section

Articles