Sciweavers

3643 search results - page 120 / 729
» Learning Submodular Functions
Sort
View
123
Voted
SIGIR
2010
ACM
15 years 6 months ago
Learning more powerful test statistics for click-based retrieval evaluation
Interleaving experiments are an attractive methodology for evaluating retrieval functions through implicit feedback. Designed as a blind and unbiased test for eliciting a preferen...
Yisong Yue, Yue Gao, Olivier Chapelle, Ya Zhang, T...
IJON
2002
85views more  IJON 2002»
15 years 2 months ago
Learning statistically efficient features for speaker recognition
We apply independent component analysis (ICA) for extracting an optimal basis to the problem of finding efficient features for a speaker. The basis functions learned by the algori...
Gil-Jin Jang, Te-Won Lee, Yung-Hwan Oh
114
Voted
JMLR
2010
125views more  JMLR 2010»
14 years 9 months ago
Stochastic Complexity and Generalization Error of a Restricted Boltzmann Machine in Bayesian Estimation
In this paper, we consider the asymptotic form of the generalization error for the restricted Boltzmann machine in Bayesian estimation. It has been shown that obtaining the maximu...
Miki Aoyagi
ATAL
2005
Springer
15 years 8 months ago
Behavior transfer for value-function-based reinforcement learning
Temporal difference (TD) learning methods [22] have become popular reinforcement learning techniques in recent years. TD methods have had some experimental successes and have been...
Matthew E. Taylor, Peter Stone
UIST
1994
ACM
15 years 6 months ago
Evolutionary Learning of Graph Layout Constraints from Examples
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...
Toshiyuki Masui