Local dimensionality reduction for locally weighted learning

S. Vijayakumar, S. Schaal

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Incremental learning of sensorimotor transformations in high dimensional spaces is one of the basic prerequisites for the success of autonomous robot devices as well as biological movement systems. So far, due to sparsity of data in high dimensional spaces, learning in such settings requires a significant amount of prior knowledge about the learning task, usually provided by a human expert. In this paper we suggest a partial revision of the view. Based on empirical studies, it can been observed that, despite being globally high dimensional and sparse, data distributions from physical movement systems are locally low dimensional and dense. Under this assumption, we derive a learning algorithm, locally adaptive subspace regression, that exploits this property by combining a dynamically growing local dimensionality reduction as a preprocessing step with a nonparametric learning technique, locally weighted regression. The usefulness of the algorithm and the validity of its assumptions are illustrated for a synthetic data set and data of the inverse dynamics of an actual 7 degree-of-freedom anthropomorphic robot arm.
Original languageEnglish
Title of host publicationComputational Intelligence in Robotics and Automation, 1997. CIRA'97., Proceedings., 1997 IEEE International Symposium on
Number of pages6
Publication statusPublished - 1997


Dive into the research topics of 'Local dimensionality reduction for locally weighted learning'. Together they form a unique fingerprint.

Cite this