Picture for Caleb Koch

Caleb Koch

The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem

Add code
Sep 17, 2024
Viaarxiv icon

Superconstant Inapproximability of Decision Tree Learning

Add code
Jul 01, 2024
Viaarxiv icon

Properly Learning Decision Trees with Queries Is NP-Hard

Add code
Jul 09, 2023
Viaarxiv icon

Superpolynomial Lower Bounds for Decision Tree Learning and Testing

Add code
Oct 12, 2022
Figure 1 for Superpolynomial Lower Bounds for Decision Tree Learning and Testing
Figure 2 for Superpolynomial Lower Bounds for Decision Tree Learning and Testing
Figure 3 for Superpolynomial Lower Bounds for Decision Tree Learning and Testing
Figure 4 for Superpolynomial Lower Bounds for Decision Tree Learning and Testing
Viaarxiv icon

A Query-Optimal Algorithm for Finding Counterfactuals

Add code
Jul 14, 2022
Figure 1 for A Query-Optimal Algorithm for Finding Counterfactuals
Figure 2 for A Query-Optimal Algorithm for Finding Counterfactuals
Figure 3 for A Query-Optimal Algorithm for Finding Counterfactuals
Viaarxiv icon

Hyperprofile-based Computation Offloading for Mobile Edge Networks

Add code
Jul 28, 2017
Figure 1 for Hyperprofile-based Computation Offloading for Mobile Edge Networks
Figure 2 for Hyperprofile-based Computation Offloading for Mobile Edge Networks
Figure 3 for Hyperprofile-based Computation Offloading for Mobile Edge Networks
Figure 4 for Hyperprofile-based Computation Offloading for Mobile Edge Networks
Viaarxiv icon