701 search results - page 49 / 141 » Self Bounding Learning Algorithms |
77
Voted
STOC
2005
ACM
16 years 26 days ago
2005
ACM
In this paper, we study the problem of learning phylogenies and hidden Markov models. We call the Markov model nonsingular if all transtion matrices have determinants bounded away...
140
click to vote
KES
1998
Springer
15 years 4 months ago
1998
Springer
An agent must acquire internal representation appropriate for its task, environment, sensors. As a learning algorithm, reinforcement learning is often utilized to acquire the rela...
108
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
Decentralized reinforcement learning (DRL) has been applied to a number of distributed applications. However, one of the main challenges faced by DRL is its convergence. Previous ...
92
Voted
ALT
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We propose a method of unsupervised learning from stationary, vector-valued processes. A low-dimensional subspace is selected on the basis of a criterion which rewards da...
108
Voted
CVPR
2006
IEEE
15 years 6 months ago
2006
IEEE
The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works...