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. 2010.08633
  4. Cited By
Universal guarantees for decision tree induction via a higher-order
  splitting criterion

Universal guarantees for decision tree induction via a higher-order splitting criterion

16 October 2020
Guy Blanc
Neha Gupta
Jane Lange
Li-Yang Tan
ArXivPDFHTML

Papers citing "Universal guarantees for decision tree induction via a higher-order splitting criterion"

4 / 4 papers shown
Title
Efficient Quantum Agnostic Improper Learning of Decision Trees
Efficient Quantum Agnostic Improper Learning of Decision Trees
Sagnik Chatterjee
Tharrmashastha SAPV
Debajyoti Bera
32
1
0
01 Oct 2022
Provably efficient, succinct, and precise explanations
Provably efficient, succinct, and precise explanations
Guy Blanc
Jane Lange
Li-Yang Tan
FAtt
37
35
0
01 Nov 2021
Properly learning decision trees in almost polynomial time
Properly learning decision trees in almost polynomial time
Guy Blanc
Jane Lange
Mingda Qiao
Li-Yang Tan
16
20
0
01 Sep 2021
Decision tree heuristics can fail, even in the smoothed setting
Decision tree heuristics can fail, even in the smoothed setting
Guy Blanc
Jane Lange
Mingda Qiao
Li-Yang Tan
20
7
0
02 Jul 2021
1