• DocumentCode
    2468751
  • Title

    Online learning of sparse pseudo-input Gaussian Process

  • Author

    Suk, Heung-Il ; Wang, Yuzhuo ; Lee, Seong-Whan

  • Author_Institution
    Dept. of Brain & Cognitive Eng., Korea Univ., Seoul, South Korea
  • fYear
    2012
  • fDate
    14-17 Oct. 2012
  • Firstpage
    1357
  • Lastpage
    1360
  • Abstract
    In this paper, we propose a novel method of online learning of sparse pseudo-data, representative of the whole training data, for Gaussian Process (GP) regressions. We call the proposed method Incremental Sparse Pseudo-input Gaussian Process (ISPGP) regression. The proposed ISPGP algorithm allows for training from either a huge amount of training data by scanning through it only once or an online incremental training dataset. Thanks to the nature of the incremental learning algorithm, the proposed ISPGP algorithm can theoretically work with infinite data to which the conventional GP or SPGP algorithm is not applicable. From our experimental results on the KIN40K dataset, we can see that the proposed ISPGP algorithm is comparable to the conventional GP algorithm using the same number of training data. Although the proposed ISPGP algorithm performs slightly worse than Snelson and Ghahramani´s SPGP algorithm, the level of performance degradation is acceptable.
  • Keywords
    Gaussian processes; data analysis; learning (artificial intelligence); regression analysis; KIN40K dataset; incremental learning algorithm; incremental sparse pseudo-input Gaussian process regression; online incremental training dataset; online learning; performance degradation; Gaussian processes; Optimization; Prediction algorithms; Presses; Random variables; Training; Training data; Gaussian process regression; incremental learning; pseudo-input;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man, and Cybernetics (SMC), 2012 IEEE International Conference on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4673-1713-9
  • Electronic_ISBN
    978-1-4673-1712-2
  • Type

    conf

  • DOI
    10.1109/ICSMC.2012.6377922
  • Filename
    6377922