Co-occurring keywords · papers mentioning both
Papers
Minimax Optimal Regret Bound for Reinforcement Learning with Trajectory Feedback
ICML 2025
Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
ICML 2025
Quantum Algorithms for Finite-horizon Markov Decision Processes
ICML 2025
Beyond Stationarity: Convergence Analysis of Stochastic Softmax Policy Gradient Methods
ICLR 2024
Efficient Model-Based Concave Utility Reinforcement Learning through Greedy Mirror Descent
AISTATS 2024
Safe Reinforcement Learning using Finite-Horizon Gradient-based Estimation
ICML 2024
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path
ALT 2023
A Sample-Efficient Algorithm for Episodic Finite-Horizon MDP with Constraints
AAAI 2021
On the Relationship Between Satisfiability and Markov Decision Processes
UAI 2019
A Generalization Error for Q-Learning
JMLR 2005