Communications of the ACM
NP is as easy as detecting unique solutions
Theoretical Computer Science
Information Processing Letters
Learning regular sets from queries and counterexamples
Information and Computation
Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
Artificial Intelligence
Computational limitations on learning from examples
Journal of the ACM (JACM)
Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
Parameterized learning complexity
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Learning Boolean concepts in the presence of many irrelevant features
Artificial Intelligence
An introduction to computational learning theory
An introduction to computational learning theory
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Fast learning of k-term DNF formulas with queries
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
Fixed-Parameter Complexity and Cryptography
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Parameterized Complexity
Hi-index | 0.00 |
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.