Sciweavers

733 search results - page 65 / 147
» Learning Riemannian Metrics
Sort
View
CVPR
2006
IEEE
14 years 10 months ago
Dimensionality Reduction by Learning an Invariant Mapping
Dimensionality reduction involves mapping a set of high dimensional input points onto a low dimensional manifold so that "similar" points in input space are mapped to ne...
Raia Hadsell, Sumit Chopra, Yann LeCun
IWANN
1999
Springer
14 years 1 months ago
The Capacity and Attractor Basins of Associative Memory Models
The performance characteristics of five variants of the Hopfield network are examined. Two performance metrics are used: memory capacity, and a measure of the size of basins of att...
Neil Davey, S. P. Hunt
AI
1998
Springer
14 years 1 months ago
A Hybrid Convergent Method for Learning Probabilistic Networks
During past few years, a variety of methods have been developed for learning probabilistic networks from data, among which the heuristic single link forward or backward searches ar...
Jun Liu, Kuo-Chu Chang, Jing Zhou
IROS
2007
IEEE
123views Robotics» more  IROS 2007»
14 years 3 months ago
Learning humanoid reaching tasks in dynamic environments
— A central challenging problem in humanoid robotics is to plan and execute dynamic tasks in dynamic environments. Given that the environment is known, sampling-based online moti...
Xiaoxi Jiang, Marcelo Kallmann
DAGM
2011
Springer
12 years 8 months ago
Relaxed Exponential Kernels for Unsupervised Learning
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
Karim T. Abou-Moustafa, Mohak Shah, Fernando De la...