Sciweavers

509 search results - page 21 / 102
» Using Learning for Approximation in Stochastic Processes
Sort
View
NIPS
2007
13 years 8 months ago
Anytime Induction of Cost-sensitive Trees
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
Saher Esmeir, Shaul Markovitch
IWANN
1999
Springer
13 years 11 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
NIPS
2001
13 years 8 months ago
Linking Motor Learning to Function Approximation: Learning in an Unlearnable Force Field
Reaching movements require the brain to generate motor commands that rely on an internal model of the task's dynamics. Here we consider the errors that subjects make early in...
O. Donchin, Reza Shadmehr
ICML
2008
IEEE
14 years 8 months ago
Gaussian process product models for nonparametric nonstationarity
Stationarity is often an unrealistic prior assumption for Gaussian process regression. One solution is to predefine an explicit nonstationary covariance function, but such covaria...
Ryan Prescott Adams, Oliver Stegle
ISMB
1994
13 years 8 months ago
Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
Hiroshi Mamitsuka, Naoki Abe