2875 search results - page 78 / 575 » Distributed Reactive Machines |
COLT
1992
Springer
15 years 4 months ago
1992
Springer
We consider PAC-learning where the distribution is known to the student. The problem addressed here is characterizing when learnability with respect to distribution D1 implies lea...
124
Voted
ALT
2005
Springer
15 years 9 months ago
2005
Springer
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
82
Voted
ALT
2010
Springer
15 years 2 months ago
2010
Springer
We further develop the idea that the PAC-Bayes prior can be informed by the data-generating distribution. We prove sharp bounds for an existing framework of Gibbs algorithms, and ...
97
Voted
COLT
2007
Springer
15 years 6 months ago
2007
Springer
We consider on-line density estimation with the multivariate Gaussian distribution. In each of a sequence of trials, the learner must posit a mean µ and covariance Σ; the learner...
98
Voted
COLT
2008
Springer
15 years 2 months ago
2008
Springer
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...