Sciweavers

52 search results - page 3 / 11
» Learning Polynomials with Queries: The Highly Noisy Case
Sort
View
ALT
2003
Springer
14 years 4 months ago
Learning a Subclass of Regular Patterns in Polynomial Time
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
John Case, Sanjay Jain, Rüdiger Reischuk, Fra...
COLT
1993
Springer
13 years 11 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
JMLR
2002
140views more  JMLR 2002»
13 years 7 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
ICML
2009
IEEE
14 years 8 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
STOC
2010
ACM
195views Algorithms» more  STOC 2010»
13 years 11 months ago
Efficiently Learning Mixtures of Two Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
Adam Tauman Kalai, Ankur Moitra, and Gregory Valia...