skip to main content


Title: Decision analysis and reinforcement learning in surgical decision-making
Award ID(s):
1750192
NSF-PAR ID:
10213915
Author(s) / Creator(s):
; ; ; ; ; ; ; ; ; ;
Date Published:
Journal Name:
Surgery
Volume:
168
Issue:
2
ISSN:
0039-6060
Page Range / eLocation ID:
253 to 266
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We give the first reconstruction algorithm for decision trees: given queries to a function f that is opt-close to a size-s decision tree, our algorithm provides query access to a decision tree T where: - T has size S := s^O((log s)²/ε³); - dist(f,T) ≤ O(opt)+ε; - Every query to T is answered with poly((log s)/ε)⋅ log n queries to f and in poly((log s)/ε)⋅ n log n time. This yields a tolerant tester that distinguishes functions that are close to size-s decision trees from those that are far from size-S decision trees. The polylogarithmic dependence on s in the efficiency of our tester is exponentially smaller than that of existing testers. Since decision tree complexity is well known to be related to numerous other boolean function properties, our results also provide a new algorithm for reconstructing and testing these properties. 
    more » « less
  2. null (Ed.)