We consider the problem of using a stochastic approximation algorithm to perform online tracking in a non-stationary environment characterised by abrupt "regime changes". The primary contribution of this paper is a new approach for adaptive stepsize selection that is suitable for this type of non-stationarity. Our approach is pre-emptive rather than reactive, and is based on a strategy of maximising the rate of adaptation, subject to a constraint on the probability that the iterates fall outside a pre-determined range of acceptable error. The basis for our approach is provided by the theory of weak convergence for stochastic approximation algorithms. Crown Copyright (C) 2007 Published by Elsevier Ltd. All rights reserved.
机构:
Nankai Univ, LPMC, Tianjin 300071, Peoples R China
Nankai Univ, Sch Math Sci, Tianjin 300071, Peoples R ChinaRenmin Univ China, Sch Business, Beijing 100872, Peoples R China
Zhang, Xin
论文数: 引用数:
h-index:
机构:
Siu, Tak Kuen
Meng, Qingbin
论文数: 0引用数: 0
h-index: 0
机构:
Renmin Univ China, Sch Business, Beijing 100872, Peoples R ChinaRenmin Univ China, Sch Business, Beijing 100872, Peoples R China
机构:
Fraunhofer Inst Ind Math ITWM, Dept Financial Math, Kaiserslautern, GermanyFraunhofer Inst Ind Math ITWM, Dept Financial Math, Kaiserslautern, Germany
Erlwein, Christina
Mueller, Marlene
论文数: 0引用数: 0
h-index: 0
机构:
Beuth Univ Appl Sci, Dept Math Phys & Chem, Berlin, GermanyFraunhofer Inst Ind Math ITWM, Dept Financial Math, Kaiserslautern, Germany