arXiv:2504.10865
Understanding the theoretical properties of projected Bellman equation, linear Q-learning, and approximate value iteration
원문 초록
In this paper, we study the theoretical properties of the projected Bellman equation (PBE) and two algorithms to solve this equation: linear Q-learning and approximate value iteration (AVI). We consider two sufficient conditions for the existence of a solution to PBE : strictly negatively row dominating diagonal (SNRDD) assumption and a condition motivated by the convergence of AVI. The SNRDD assumption also ensures the convergence of linear Q-learning, and its relationship with the convergence of AVI is examined. Lastly, several interesting observations on the solution of PBE are provided when using $\epsilon$-greedy policy.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Q-Learning under Finite Model Uncertainty
Personalized Exercise Recommendation with Semantically-Grounded Knowledge Tracing
ADDQ: Adaptive Distributional Double Q-Learning
Inverse Q-Learning Done Right: Offline Imitation Learning in $Q^π$-Realizable MDPs
Distributionally Robust Deep Q-Learning
A critical assessment of reinforcement learning methods for microswimmer navigation in complex flows
토론
이 논문과 연결된 포럼 글이 아직 없습니다.