Sciweavers

10054 search results - page 480 / 2011
» On the Complexity of Function Learning
Sort
View
IWINAC
2007
Springer
15 years 11 months ago
EDNA: Estimation of Dependency Networks Algorithm
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
José A. Gámez, Juan L. Mateo, Jose M...
NIPS
2008
15 years 6 months ago
Non-parametric Regression Between Manifolds
This paper discusses non-parametric regression between Riemannian manifolds. This learning problem arises frequently in many application areas ranging from signal processing, comp...
Florian Steinke, Matthias Hein
BC
2007
79views more  BC 2007»
15 years 5 months ago
Spike-timing-dependent plasticity for neurons with recurrent connections
The dynamics of the learning equation, which describes the evolution of the synaptic weights, is derived in the situation where the network contains recurrent connections. The deri...
Anthony N. Burkitt, Matthieu Gilson, J. Leo van He...
ICRA
2008
IEEE
169views Robotics» more  ICRA 2008»
15 years 11 months ago
Sparse incremental learning for interactive robot control policy estimation
— We are interested in transferring control policies for arbitrary tasks from a human to a robot. Using interactive demonstration via teloperation as our transfer scenario, we ca...
Daniel H. Grollman, Odest Chadwicke Jenkins
IDA
2005
Springer
15 years 10 months ago
Learning from Ambiguously Labeled Examples
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
Eyke Hüllermeier, Jürgen Beringer