On learning embedded midbit functions
Author: Rocco A. Servedio
Theoretical Computer Science Vol. 350, Issue 1,
January 2006, pp. 13-23
A midbit function on
To motivate this problem, we first point out that a result of Green et al. implies that a polynomial time learning algorithm for the class of embedded midbit functions would immediately yield a fairly efficient (quasipolynomial time) (PAC) learning algorithm for the entire complexity class ACC. We then give two different subexponential learning algorithms, each of which learns embedded midbit functions under any probability distribution in 2√n log n time. Finally, we give a polynomial time algorithm for learning embedded midbit functions under the uniform distribution.
©Copyright 2005 Elsevier Science B.V.