Open Access. Powered by Scholars. Published by Universities.®

Theory and Algorithms Commons

Open Access. Powered by Scholars. Published by Universities.®

2012

Research Collection School Of Computing and Information Systems

Empirical performance

Articles 1 - 2 of 2

Full-Text Articles in Theory and Algorithms

On-Line Portfolio Selection With Moving Average Reversion, Bin Li, Steven C. H. Hoi Jul 2012

On-Line Portfolio Selection With Moving Average Reversion, Bin Li, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

On-line portfolio selection has attracted increasing interests in machine learning and AI communities recently. Empirical evidences show that stock's high and low prices are temporary and stock price relatives are likely to follow the mean reversion phenomenon. While the existing mean reversion strategies are shown to achieve good empirical performance on many real datasets, they often make the single-period mean reversion assumption, which is not always satisfied in some real datasets, leading to poor performance when the assumption does not hold. To overcome the limitation, this article proposes a multiple-period mean reversion, or so-called Moving Average Reversion (MAR), and a …


Fast Bounded Online Gradient Descent Algorithms For Scalable Kernel-Based Online Learning, Peilin Zhao, Jialei Wang, Pengcheng Wu, Rong Jin, Steven C. H. Hoi Jul 2012

Fast Bounded Online Gradient Descent Algorithms For Scalable Kernel-Based Online Learning, Peilin Zhao, Jialei Wang, Pengcheng Wu, Rong Jin, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Kernel-based online learning has often shown state-of-the-art performance for many online learning tasks. It, however, suffers from a major shortcoming, that is, the unbounded number of support vectors, making it non-scalable and unsuitable for applications with large-scale datasets. In this work, we study the problem of bounded kernel-based online learning that aims to constrain the number of support vectors by a predefined budget. Although several algorithms have been proposed in literature, they are neither computationally efficient due to their intensive budget maintenance strategy nor effective due to the use of simple Perceptron algorithm. To overcome these limitations, we propose a …