ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2109.00637
  4. Cited By
Properly learning decision trees in almost polynomial time
v1v2 (latest)

Properly learning decision trees in almost polynomial time

1 September 2021
Guy Blanc
Jane Lange
Mingda Qiao
Li-Yang Tan
ArXiv (abs)PDFHTML

Papers citing "Properly learning decision trees in almost polynomial time"

15 / 15 papers shown
Title
Modifying Final Splits of Classification Tree for Fine-tuning Subpopulation Target in Policy Making
Modifying Final Splits of Classification Tree for Fine-tuning Subpopulation Target in Policy Making
Lei Bill Wang
Zhenbang Jiao
Fangyi Wang
99
0
0
24 Feb 2025
Discovering Data Structures: Nearest Neighbor Search and Beyond
Discovering Data Structures: Nearest Neighbor Search and Beyond
Omar Salemohamed
Laurent Charlin
Shivam Garg
Vatsal Sharan
Gregory Valiant
FedML
124
0
0
05 Nov 2024
Fast decision tree learning solves hard coding-theoretic problems
Fast decision tree learning solves hard coding-theoretic problems
Caleb M. Koch
Carmen Strassle
Li-Yang Tan
50
1
0
19 Sep 2024
On the Computational Landscape of Replicable Learning
On the Computational Landscape of Replicable Learning
Alkis Kalavasis
Amin Karbasi
Grigoris Velegkas
Felix Y. Zhou
85
3
0
24 May 2024
Towards a theory of model distillation
Towards a theory of model distillation
Enric Boix-Adserà
FedMLVLM
80
8
0
14 Mar 2024
Agnostically Learning Multi-index Models with Queries
Agnostically Learning Multi-index Models with Queries
Ilias Diakonikolas
Daniel M. Kane
Vasilis Kontonis
Christos Tzamos
Nikos Zarifis
69
4
0
27 Dec 2023
Harnessing the Power of Choices in Decision Tree Learning
Harnessing the Power of Choices in Decision Tree Learning
Guy Blanc
Jane Lange
Chirag Pabbaraju
Colin D. Sullivan
Li-Yang Tan
Mo Tiwari
41
1
0
02 Oct 2023
Properly Learning Decision Trees with Queries Is NP-Hard
Properly Learning Decision Trees with Queries Is NP-Hard
Caleb M. Koch
Carmen Strassle
Li-Yang Tan
73
7
0
09 Jul 2023
Agnostic proper learning of monotone functions: beyond the black-box
  correction barrier
Agnostic proper learning of monotone functions: beyond the black-box correction barrier
Jane Lange
Arsen Vasilyan
81
5
0
05 Apr 2023
Lifting uniform learners via distributional decomposition
Lifting uniform learners via distributional decomposition
Guy Blanc
Jane Lange
Ali Malik
Li-Yang Tan
FedML
59
5
0
27 Mar 2023
Superpolynomial Lower Bounds for Decision Tree Learning and Testing
Superpolynomial Lower Bounds for Decision Tree Learning and Testing
Caleb M. Koch
Carmen Strassle
Li-Yang Tan
91
8
0
12 Oct 2022
Efficient Quantum Agnostic Improper Learning of Decision Trees
Efficient Quantum Agnostic Improper Learning of Decision Trees
Sagnik Chatterjee
Tharrmashastha SAPV
Debajyoti Bera
72
1
0
01 Oct 2022
Open Problem: Properly learning decision trees in polynomial time?
Open Problem: Properly learning decision trees in polynomial time?
Guy Blanc
Jane Lange
Mingda Qiao
Li-Yang Tan
24
0
0
29 Jun 2022
Popular decision tree algorithms are provably noise tolerant
Popular decision tree algorithms are provably noise tolerant
Guy Blanc
Jane Lange
Ali Malik
Li-Yang Tan
NoLa
63
5
0
17 Jun 2022
Reconstructing decision trees
Reconstructing decision trees
Guy Blanc
Jane Lange
Li-Yang Tan
58
1
0
16 Dec 2020
1