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. 1803.06521
  4. Cited By
Beyond the Low-Degree Algorithm: Mixtures of Subcubes and Their
  Applications

Beyond the Low-Degree Algorithm: Mixtures of Subcubes and Their Applications

17 March 2018
Sitan Chen
Ankur Moitra
ArXivPDFHTML

Papers citing "Beyond the Low-Degree Algorithm: Mixtures of Subcubes and Their Applications"

22 / 22 papers shown
Title
Superconstant Inapproximability of Decision Tree Learning
Superconstant Inapproximability of Decision Tree Learning
Caleb M. Koch
Carmen Strassle
Li-Yang Tan
29
1
0
01 Jul 2024
Causal Discovery under Latent Class Confounding
Causal Discovery under Latent Class Confounding
Bijan Mazaheri
Spencer Gordon
Y. Rabani
Leonard J. Schulman
CML
36
2
0
13 Nov 2023
Identification of Mixtures of Discrete Product Distributions in
  Near-Optimal Sample and Time Complexity
Identification of Mixtures of Discrete Product Distributions in Near-Optimal Sample and Time Complexity
Spencer Gordon
Erik Jahn
Bijan Mazaheri
Y. Rabani
Leonard J. Schulman
CoGe
17
3
0
25 Sep 2023
Lifting uniform learners via distributional decomposition
Lifting uniform learners via distributional decomposition
Guy Blanc
Jane Lange
Ali Malik
Li-Yang Tan
FedML
11
4
0
27 Mar 2023
Moment Estimation for Nonparametric Mixture Models Through Implicit
  Tensor Decomposition
Moment Estimation for Nonparametric Mixture Models Through Implicit Tensor Decomposition
Yifan Zhang
Joe Kileel
24
3
0
25 Oct 2022
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
34
8
0
12 Oct 2022
Reward-Mixing MDPs with a Few Latent Contexts are Learnable
Reward-Mixing MDPs with a Few Latent Contexts are Learnable
Jeongyeol Kwon
Yonathan Efroni
C. Caramanis
Shie Mannor
31
5
0
05 Oct 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
17
3
0
17 Jun 2022
Causal Inference Despite Limited Global Confounding via Mixture Models
Causal Inference Despite Limited Global Confounding via Mixture Models
Spencer Gordon
Bijan Mazaheri
Y. Rabani
Leonard J. Schulman
CML
36
7
0
22 Dec 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
13
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
17
7
0
02 Jul 2021
Learning stochastic decision trees
Learning stochastic decision trees
Guy Blanc
Jane Lange
Li-Yang Tan
14
3
0
08 May 2021
Hadamard Extensions and the Identification of Mixtures of Product
  Distributions
Hadamard Extensions and the Identification of Mixtures of Product Distributions
Spencer Gordon
Leonard J. Schulman
14
10
0
27 Jan 2021
Source Identification for Mixtures of Product Distributions
Source Identification for Mixtures of Product Distributions
Spencer Gordon
Bijan Mazaheri
Y. Rabani
Leonard J. Schulman
8
21
0
29 Dec 2020
Reconstructing decision trees
Reconstructing decision trees
Guy Blanc
Jane Lange
Li-Yang Tan
20
1
0
16 Dec 2020
Universal guarantees for decision tree induction via a higher-order
  splitting criterion
Universal guarantees for decision tree induction via a higher-order splitting criterion
Guy Blanc
Neha Gupta
Jane Lange
Li-Yang Tan
14
10
0
16 Oct 2020
The Sparse Hausdorff Moment Problem, with Application to Topic Models
The Sparse Hausdorff Moment Problem, with Application to Topic Models
Spencer Gordon
Bijan Mazaheri
Leonard J. Schulman
Y. Rabani
14
9
0
16 Jul 2020
Top-down induction of decision trees: rigorous guarantees and inherent
  limitations
Top-down induction of decision trees: rigorous guarantees and inherent limitations
Guy Blanc
Jane Lange
Li-Yang Tan
11
25
0
18 Nov 2019
Interaction is necessary for distributed learning with privacy or
  communication constraints
Interaction is necessary for distributed learning with privacy or communication constraints
Y. Dagan
Vitaly Feldman
17
12
0
11 Nov 2019
Efficiently Learning Structured Distributions from Untrusted Batches
Efficiently Learning Structured Distributions from Untrusted Batches
Sitan Chen
Jingkai Li
Ankur Moitra
OOD
FedML
31
16
0
05 Nov 2019
On the Optimality of Trees Generated by ID3
On the Optimality of Trees Generated by ID3
Alon Brutzkus
Amit Daniely
Eran Malach
17
10
0
11 Jul 2019
ID3 Learns Juntas for Smoothed Product Distributions
ID3 Learns Juntas for Smoothed Product Distributions
Alon Brutzkus
Amit Daniely
Eran Malach
25
20
0
20 Jun 2019
1