Sciweavers

3694 search results - page 27 / 739
» Stochastic complexity in learning
Sort
View
FOCM
2006
50views more  FOCM 2006»
13 years 7 months ago
Online Learning Algorithms
In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHS) and general Hilbert spaces. We present a general form of the stochastic gradient m...
Steve Smale, Yuan Yao
ICML
2006
IEEE
14 years 8 months ago
Accelerated training of conditional random fields with stochastic gradient methods
We apply Stochastic Meta-Descent (SMD), a stochastic gradient optimization method with gain vector adaptation, to the training of Conditional Random Fields (CRFs). On several larg...
S. V. N. Vishwanathan, Nicol N. Schraudolph, Mark ...
COLING
2000
13 years 9 months ago
Learning Word Clusters from Data Types
The paper illustrates a linguistic knowledge acquisition model making use of data types, innite memory, and an inferential mechanism for inducing new information from known data. ...
Paolo Allegrini, Simonetta Montemagni, Vito Pirrel...
TIT
1998
123views more  TIT 1998»
13 years 7 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu
AAAI
2000
13 years 9 months ago
Localizing Search in Reinforcement Learning
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
Gregory Z. Grudic, Lyle H. Ungar