ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1809.01843
  4. Cited By
How to Combine Tree-Search Methods in Reinforcement Learning

How to Combine Tree-Search Methods in Reinforcement Learning

6 September 2018
Yonathan Efroni
Gal Dalal
B. Scherrer
Shie Mannor
ArXivPDFHTML

Papers citing "How to Combine Tree-Search Methods in Reinforcement Learning"

9 / 9 papers shown
Title
Policy Mirror Descent with Lookahead
Policy Mirror Descent with Lookahead
Kimon Protopapas
Anas Barakat
36
1
0
21 Mar 2024
A New Policy Iteration Algorithm For Reinforcement Learning in Zero-Sum
  Markov Games
A New Policy Iteration Algorithm For Reinforcement Learning in Zero-Sum Markov Games
Anna Winnicki
R. Srikant
46
1
0
17 Mar 2023
SoftTreeMax: Exponential Variance Reduction in Policy Gradient via Tree
  Search
SoftTreeMax: Exponential Variance Reduction in Policy Gradient via Tree Search
Gal Dalal
Assaf Hallak
Gugan Thoppe
Shie Mannor
Gal Chechik
39
3
0
30 Jan 2023
On The Convergence Of Policy Iteration-Based Reinforcement Learning With
  Monte Carlo Policy Evaluation
On The Convergence Of Policy Iteration-Based Reinforcement Learning With Monte Carlo Policy Evaluation
Anna Winnicki
R. Srikant
24
9
0
23 Jan 2023
Planning and Learning with Adaptive Lookahead
Planning and Learning with Adaptive Lookahead
Aviv A. Rosenberg
Assaf Hallak
Shie Mannor
Gal Chechik
Gal Dalal
32
7
0
28 Jan 2022
The Role of Lookahead and Approximate Policy Evaluation in Reinforcement
  Learning with Linear Value Function Approximation
The Role of Lookahead and Approximate Policy Evaluation in Reinforcement Learning with Linear Value Function Approximation
Anna Winnicki
Joseph Lubars
Michael Livesay
R. Srikant
36
3
0
28 Sep 2021
Improve Agents without Retraining: Parallel Tree Search with Off-Policy
  Correction
Improve Agents without Retraining: Parallel Tree Search with Off-Policy Correction
Assaf Hallak
Gal Dalal
Steven Dalton
I. Frosio
Shie Mannor
Gal Chechik
OffRL
OnRL
40
9
0
04 Jul 2021
Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy
  Policies
Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies
Yonathan Efroni
Nadav Merlis
Mohammad Ghavamzadeh
Shie Mannor
OffRL
24
68
0
27 May 2019
Beyond the One Step Greedy Approach in Reinforcement Learning
Beyond the One Step Greedy Approach in Reinforcement Learning
Yonathan Efroni
Gal Dalal
B. Scherrer
Shie Mannor
OffRL
68
48
0
10 Feb 2018
1