3694 search results - page 41 / 739 » Stochastic complexity in learning |
COLT
2007
Springer
15 years 3 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
ALT
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
RECOMB
2000
Springer
15 years 1 months ago
2000
Springer
DNA hybridization arrays simultaneously measure the expression level for thousands of genes. These measurements provide a "snapshot" of transcription levels within the c...
COLT
2008
Springer
14 years 11 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
103
click to vote
ML
2007
ACM
14 years 9 months ago
2007
ACM
We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...