72 citations · 94 across the 3 of their papers we have counts for
4 papers
Every decision tree has an influential variable
Ryan O'Donnell, Michael Saks, Oded Schramm +1
We prove that for any decision tree calculating a boolean function , \[ \Var[f] \le \sum_{i=1}^n δ_i \Inf_i(f), \] where is the probability that the…
Improved Bounds on Quantum Learning Algorithms
Alp Atici, Rocco A. Servedio
In this article we give several new results on the complexity of algorithms that learn Boolean functions from quantum queries and quantum examples. Hunziker et al. conjectured that…
Toward Attribute Efficient Learning Algorithms
Adam R. Klivans, Rocco A. Servedio
We make progress on two important problems regarding attribute efficient learnability. First, we give an algorithm for learning decision lists of length over variables usin…
Quantum versus Classical Learnability
Rocco A. Servedio, Steven J. Gortler
We consider quantum versions of two well-studied classical learning models: Angluin's model of exact learning from membership queries and Valiant's Probably Approximately Correct (…