near-optimal policy

DPO Meets PPO: Reinforced Token Optimization for RLHF ICML 2025 Learning Policy Committees for Effective Personalization in MDPs with Diverse Tasks ICML 2025 Proto Successor Measure: Representing the Behavior Space of an RL Agent ICML 2025 Provable Zero-Shot Generalization in Offline Reinforcement Learning ICML 2025 Sample and Oracle Efficient Reinforcement Learning for MDPs with Linearly-Realizable Value Functions COLT 2025 Switching the Loss Reduces the Cost in Batch Reinforcement Learning ICML 2024 Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-Free RL ICLR 2023 Instance-Dependent Near-Optimal Policy Identification in Linear MDPs via Online Experiment Design NeurIPS 2022 Sample-Efficient Reinforcement Learning in the Presence of Exogenous Information COLT 2022 Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality ICLR 2022 Tractable Optimality in Episodic Latent MABs NeurIPS 2022 Efficient PAC Reinforcement Learning in Regular Decision Processes IJCAI 2021 Near Optimal Reward-Free Reinforcement Learning ICML 2021 Sample Complexity of Reinforcement Learning using Linearly Combined Model Ensembles AISTATS 2020 Explicit Explore-Exploit Algorithms in Continuous State Spaces NeurIPS 2019 Adaptive Elicitation of Preferences under Uncertainty in Sequential Decision Making Problems IJCAI 2017 Only H is left: Near-tight Episodic PAC RL NeurIPS 2016 Transferring Expectations in Model-based Reinforcement Learning NeurIPS 2012 MDPs with Non-Deterministic Policies NeurIPS 2008 ε-MDPs: Learning in Varying Environments JMLR 2002