Robust and adaptive algorithms for online portfolio selection
We present an online approach to portfolio selection. The motivation is within the context of algorithmic trading, which demands fast and recursive updates of portfolio allocations as new data arrives. In particular, we look at two online algorithms: Robust-Exponentially Weighted Least Squares (R-EWRLS) and a regularized Online minimum Variance algorithm (O-VAR). Our methods use simple ideas from signal processing and statistics, which are sometimes overlooked in the empirical financial literature. The two approaches are evaluated against benchmark allocation techniques using four real data sets. Our methods outperform the benchmark allocation techniques in these data sets in terms of both computational demand and financial performance.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 12 (2012)
Issue (Month): 11 (November)
|Contact details of provider:|| Web page: http://www.tandfonline.com/RQUF20|
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/RQUF20|