Breiman meets Bellman: Non-Greedy Decision Trees with MDPs

Documenti analoghi

• Limits of Actor-Critic Algorithms for Decision Tree Policies Learning in IBMDPs
  di: Kohler, Hector, et al.
  Pubblicazione: (2023)
• Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning
  di: Kohler, Hector, et al.
  Pubblicazione: (2024)
• Evaluating Interpretable Reinforcement Learning by Distilling Policies into Programs
  di: Kohler, Hector, et al.
  Pubblicazione: (2025)
• When (and How) to Trust the Expert: Diagnosing Query-Time Expert-Guided Reinforcement Learning
  di: Berthelot, Yann, et al.
  Pubblicazione: (2026)
• PB$^2$: Preference Space Exploration via Population-Based Methods in Preference-Based Reinforcement Learning
  di: Driss, Brahim, et al.
  Pubblicazione: (2025)