Koch, Caleb

1. A Query-Optimal Algorithm for Finding Counterfactuals
   2022/07/14 by Blanc, Guy, Koch, Caleb, Lange, Jane +1 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG)
2. A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers
   2023/07/08 by Blanc, Guy, Koch, Caleb, Strassle, Carmen +1 · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
3. Properly Learning Decision Trees with Queries Is NP-Hard
   2023/07/09 by Koch, Caleb, Strassle, Carmen, Tan, Li-Yang · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG)
4. The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
   2024/09/17 by Guy Blanc, Alexandre Hayderi, Blanc, Guy +5 · 1 citation
   Computer Science · #Advanced Algebra and Logic #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Rough Sets and Fuzzy Logic
5. Superconstant Inapproximability of Decision Tree Learning
   2024/07/01 by Koch, Caleb, Strassle, Carmen, Tan, Li-Yang · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG)