Multiple Random Oracles Are Better Than One

Details Multiple Random Oracles Are Better Than One Multiple Random Oracles Are Better Than One

2008-04-23

arxiv.org/abs/0804.3817v1

Computer Science

Learning

17 pages

Scientific paper

We study the problem of learning k-juntas given access to examples drawn from a number of different product distributions. Thus we wish to learn a function f : {-1,1}^n -> {-1,1} that depends on k (unknown) coordinates. While the best known algorithms for the general problem of learning a k-junta require running time of n^k * poly(n,2^k), we show that given access to k different product distributions with biases separated by \gamma>0, the functions may be learned in time poly(n,2^k,\gamma^{-k}). More generally, given access to t <= k different product distributions, the functions may be learned in time n^{k/t} * poly(n,2^k,\gamma^{-k}). Our techniques involve novel results in Fourier analysis relating Fourier expansions with respect to different biases and a generalization of Russo's formula.

Affiliated with

Also associated with

No associations

Rating

Multiple Random Oracles Are Better Than One 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 Multiple Random Oracles Are Better Than One, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple Random Oracles Are Better Than One will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-504348