More Like this

1. Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes

   Wagenmaker, Andrew J; Chen, Yifang; Simchowitz, Max; Du, Simon; Jamieson, Kevin (January 2022, Proceedings of Machine Learning Research)
2. Inverse Preference Learning: Preference-based RL without a Reward Function

   Hejna, Joey; Sadigh, Dorsa (December 2023, Conference on Neural Information Processing Systems (NeurIPS))
3. Inverse Preference Learning: Preference-based RL without a Reward Function

   Hejna, Joey; Sadigh, Dorsa (December 2023, Conference on Neural Information Processing Systems (NeurIPS))
4. RL for Consistency Models: Faster Reward Guided Text-to-Image Generation

   Oertell, Owen; Chang, Jonathan; Zhang, Yiyi; Brantley, Kiante; Sun, Wen (July 2024, Reinforcement Learning Conference)
5. Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-Free RL

   Huang, R.; Yang, J.; Liang, Y. (January 2023, International Conference on Learning Representations)