Sciweavers

5109 search results - page 314 / 1022
» On Learning Limiting Programs
Sort
View
ML
2006
ACM
113views Machine Learning» more  ML 2006»
15 years 6 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
UM
2010
Springer
15 years 4 months ago
Inducing Effective Pedagogical Strategies Using Learning Context Features
Effective pedagogical strategies are important for e-learning environments. While it is assumed that an effective learning environment should craft and adapt its actions to the use...
Min Chi, Kurt VanLehn, Diane J. Litman, Pamela W. ...
JMLR
2012
13 years 9 months ago
Deep Learning Made Easier by Linear Transformations in Perceptrons
We transform the outputs of each hidden neuron in a multi-layer perceptron network to have zero output and zero slope on average, and use separate shortcut connections to model th...
Tapani Raiko, Harri Valpola, Yann LeCun
JMLR
2012
13 years 9 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
JMLR
2012
13 years 9 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee