Real-time model learning using Incremental Sparse Spectrum Gaussian Process Regression

被引:75
作者
Gijsberts, Arjan [1 ]
Metta, Giorgio [1 ]
机构
[1] Ist Italian Tecnol, Dept Robot Brain & Cognit Sci, I-16163 Genoa, Italy
关键词
Incremental learning; Online learning; Function approximation; Real-time; Robotics; ONLINE; ROBOT;
D O I
10.1016/j.neunet.2012.08.011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Novel applications in unstructured and non-stationary human environments require robots that learn from experience and adapt autonomously to changing conditions. Predictive models therefore not only need to be accurate, but should also be updated incrementally in real-time and require minimal human intervention. Incremental Sparse Spectrum Gaussian Process Regression is an algorithm that is targeted specifically for use in this context. Rather than developing a novel algorithm from the ground up, the method is based on the thoroughly studied Gaussian Process Regression algorithm, therefore ensuring a solid theoretical foundation. Non-linearity and a bounded update complexity are achieved simultaneously by means of a finite dimensional random feature mapping that approximates a kernel function. As a result, the computational cost for each update remains constant over time. Finally, algorithmic simplicity and support for automated hyperparameter optimization ensures convenience when employed in practice. Empirical validation on a number of synthetic and real-life learning problems confirms that the performance of Incremental Sparse Spectrum Gaussian Process Regression is superior with respect to the popular Locally Weighted Projection Regression, while computational requirements are found to be significantly lower. The method is therefore particularly suited for learning with real-time constraints or when computational resources are limited. (c) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:59 / 69
页数:11
相关论文
共 48 条
  • [1] [Anonymous], 2012, PROC ROBOTICA
  • [2] [Anonymous], 2004, KERNEL METHODS PATTE
  • [3] [Anonymous], 1999, INT C SOFT COMP SOFT
  • [4] [Anonymous], 2005, ALGORITHMIC LEARNING, DOI DOI 10.1007/B106715
  • [5] [Anonymous], 1979, LINPACK Users' Guide
  • [6] [Anonymous], NUMERICAL METHODS FO
  • [7] Monotonic functions, Stieltjes integrals and harmonic analyses.
    Bochner, S
    [J]. MATHEMATISCHE ANNALEN, 1933, 108 : 378 - 410
  • [8] Bordes A, 2005, J MACH LEARN RES, V6, P1579
  • [9] Cauwenberghs G, 2001, ADV NEUR IN, V13, P409
  • [10] Tracking the best hyperplane with a simple budget Perceptron
    Cavallanti, Giovanni
    Cesa-Bianchi, Nicolo
    Gentile, Claudio
    [J]. MACHINE LEARNING, 2007, 69 (2-3) : 143 - 167