Parameterized Learnability of k -Juntas and Related Problems

@inproceedings{Arvind2007ParameterizedLO,
  title={Parameterized Learnability of k -Juntas and Related Problems},
  author={Vikraman Arvind and Johannes K{\"o}bler and Wolfgang Lindner},
  booktitle={ALT},
  year={2007}
}
We study the parameterized complexity of learning k-juntas and some variations of juntas. We show the hardness of learning k-juntas and subclasses of k-juntas in the PAC model by reductions from a W[2]complete problem. On the other hand, as a consequence of a more general result we show that k-juntas are exactly learnable with improper equivalence queries and access to a W[P] oracle. Subject Classification: Learning theory, computational complexity. 
BETA

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES

My favorite open problems (and a few results)

  • A. Blum
  • Talk given at NeuroCOLT Alpine Workshop on…
  • 2001
Highly Influential
2 Excerpts

Similar Papers

Loading similar papers…