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. 2304.05839
  4. Cited By
Optimal Interpretability-Performance Trade-off of Classification Trees
  with Black-Box Reinforcement Learning

Optimal Interpretability-Performance Trade-off of Classification Trees with Black-Box Reinforcement Learning

11 April 2023
Hector Kohler
R. Akrour
Philippe Preux
    OffRL
ArXiv (abs)PDFHTML

Papers citing "Optimal Interpretability-Performance Trade-off of Classification Trees with Black-Box Reinforcement Learning"

1 / 1 papers shown
Title
Breiman meets Bellman: Non-Greedy Decision Trees with MDPs
Breiman meets Bellman: Non-Greedy Decision Trees with MDPs
Hector Kohler
R. Akrour
Philippe Preux
81
2
0
22 Sep 2023
1