Caleb Koch

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 21

Top Topics

Query Complexity

Decision Tree Learning

Certification Exam

Top Venues

Dagstuhl Artifacts Ser.

Publications

Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
A Strong Direct Sum Theorem for Distributional Query Complexity. CoRR (2024)
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
A Strong Direct Sum Theorem for Distributional Query Complexity. CCC (2024)
Amit Sagi, Vipin Asopa, Benjamin Mitchell, Mahalingam Shiyamasundaran, Caleb Koch, Fanuelle Getachew, Irrum Afzal, David Sochart, Richard Field
The digital divide between primary and secondary care: An analysis using SARS-CoV-2 hospital admissions. Health Informatics J. 30 (3) (2024)
Caleb Koch, Carmen Strassle, Li-Yang Tan
The title of the paper. COLT (2024)
Caleb Koch, Carmen Strassle, Li-Yang Tan
Superconstant Inapproximability of Decision Tree Learning. CoRR (2024)
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers. CoRR (2023)
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
A strong composition theorem for junta complexity and the boosting of property testers. FOCS (2023)
Caleb Koch, Carmen Strassle, Li-Yang Tan
Properly Learning Decision Trees with Queries Is NP-Hard. CoRR (2023)
Mark Moeller, Thomas Wiener, Alaia Solko-Breslin, Caleb Koch, Nate Foster, Alexandra Silva
Automata Learning with an Incomplete Teacher (Artifact). Dagstuhl Artifacts Ser. 9 (2) (2023)
Caleb Koch, Carmen Strassle, Li-Yang Tan
Properly learning decision trees with queries is NP-hard. FOCS (2023)
Caleb Koch, Carmen Strassle, Li-Yang Tan
Superpolynomial lower bounds for decision tree learning and testing. SODA (2023)
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
Certification with an NP Oracle. ITCS (2023)
Mark Moeller, Thomas Wiener, Alaia Solko-Breslin, Caleb Koch, Nate Foster, Alexandra Silva
Automata Learning with an Incomplete Teacher. ECOOP (2023)
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
A query-optimal algorithm for finding counterfactuals. ICML (2022)
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
A Query-Optimal Algorithm for Finding Counterfactuals. CoRR (2022)
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
The Query Complexity of Certification. CoRR (2022)
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
Certification with an NP Oracle. CoRR (2022)
Caleb Koch, Carmen Strassle, Li-Yang Tan
Superpolynomial Lower Bounds for Decision Tree Learning and Testing. CoRR (2022)
Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
The query complexity of certification. STOC (2022)
Andrew Crutcher, Caleb Koch, Kyle Coleman, Jon Patman, Flavio Esposito, Prasad Calyam
Hyperprofile-Based Computation Offloading for Mobile Edge Networks. MASS (2017)
Andrew Crutcher, Caleb Koch, Kyle Coleman, Jon Patman, Flavio Esposito, Prasad Calyam
Hyperprofile-based Computation Offloading for Mobile Edge Networks. CoRR (2017)