Learning symmetric k-juntas in time n^o(k)

Details Learning symmetric k-juntas in time n^o(k) Learning symmetric k-juntas in time n^o(k)

2005-04-12

arxiv.org/abs/math/0504246v1

Mathematics

Combinatorics

Scientific paper

We give an algorithm for learning symmetric k-juntas (boolean functions of $n$ boolean variables which depend only on an unknown set of $k$ of these variables) in the PAC model under the uniform distribution, which runs in time n^{O(k/\log k)}. Our bound is obtained by proving the following result: Every symmetric boolean function on k variables, except for the parity and the constant functions, has a non-zero Fourier coefficient of order at least 1 and at most O(k/\log k). This improves the previously best known bound of (3/31)k, and provides the first n^{o(k)} time algorithm for learning symmetric juntas.

Affiliated with

Also associated with

No associations

Rating

Learning symmetric k-juntas in time n^o(k) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Learning symmetric k-juntas in time n^o(k), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning symmetric k-juntas in time n^o(k) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-350588