3250 search results - page 69 / 650 » Parameterized Learning Complexity |
126
click to vote
DLOG
1998
15 years 3 months ago
1998
This paper introduces YAYA1, a Description Logic system focused towards learning complex interrelations among objects. YAYA Concept Language (YCL) is quite restricted; although it...
109
Voted
EUROCOLT
1999
Springer
15 years 6 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
122
click to vote
NIPS
2004
15 years 3 months ago
2004
Log-concavity is an important property in the context of optimization, Laplace approximation, and sampling; Bayesian methods based on Gaussian process priors have become quite pop...
133
click to vote
COLT
2010
Springer
15 years 7 days ago
2010
Springer
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
124
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the -adapted-dimension, which...