41 search results - page 4 / 9 » Lower Bounds on Learning Random Structures with Statistical ... |
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
ALT
2009
Springer
14 years 4 months ago
2009
Springer
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
JMLR
2012
11 years 10 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...