Superpolynomial Lower Bounds for Decision Tree Learning and Testing

12 October 2022

Papers citing "Superpolynomial Lower Bounds for Decision Tree Learning and Testing"

8 / 8 papers shown

Title
New Statistical and Computational Results for Learning Junta Distributions Lorenzo Beretta 29 0 0 09 May 2025
Fast decision tree learning solves hard coding-theoretic problems Caleb M. Koch Carmen Strassle Li-Yang Tan 23 0 0 19 Sep 2024
Superconstant Inapproximability of Decision Tree Learning Caleb M. Koch Carmen Strassle Li-Yang Tan 24 0 0 01 Jul 2024
Towards a theory of model distillation Enric Boix-Adserà FedML VLM 44 6 0 14 Mar 2024
Collaborative Learning with Different Labeling Functions Yuyang Deng Mingda Qiao 40 0 0 16 Feb 2024
Properly Learning Decision Trees with Queries Is NP-Hard Caleb M. Koch Carmen Strassle Li-Yang Tan 21 6 0 09 Jul 2023
Efficient Quantum Agnostic Improper Learning of Decision Trees Sagnik Chatterjee Tharrmashastha SAPV Debajyoti Bera 22 1 0 01 Oct 2022
Born-Again Tree Ensembles Thibaut Vidal Toni Pacheco Maximilian Schiffer 59 53 0 24 Mar 2020