Universal constant rebalanced portfolios with switching

Suleyman S. Kozat, Andrew Carl Singer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we consider online (sequential) portfolio selection in a competitive algorithm framework. We construct a sequential algorithm for portfolio investment that asymptotically achieves the wealth of the best piecewise constant rebalanced portfolio tuned to the underlying individual sequence of price relative vectors. Without knowledge of the investment duration, the algorithm can perform as well as the best investment algorithm that can choose both the partitioning of the sequence of the price relative vectors as well as the best constant rebalanced portfolio within each segment based on knowledge of the sequence of price relative vectors in advance. We use a transition diagram similar to that in [1] to compete with an exponential number of switching investment strategies, using only linear complexity in the data length for combination. The regret with respect to the best piecewise constant strategy is at most O(ln(n)) in the exponent, where n is the investment duration. This method is also extended in [2] to switching among a finite collection of candidate algorithms, including the case where such transitions are represented by an arbitrary side-information sequence.

Original languageEnglish (US)
Title of host publication2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07
DOIs
StatePublished - Aug 6 2007
Event2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07 - Honolulu, HI, United States
Duration: Apr 15 2007Apr 20 2007

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume3
ISSN (Print)1520-6149

Other

Other2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07
CountryUnited States
CityHonolulu, HI
Period4/15/074/20/07

Fingerprint

diagrams
exponents

Keywords

  • Adaptive signal processing
  • Bayes procedures
  • Finance

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Kozat, S. S., & Singer, A. C. (2007). Universal constant rebalanced portfolios with switching. In 2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07 [4217913] (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings; Vol. 3). https://doi.org/10.1109/ICASSP.2007.366883

Universal constant rebalanced portfolios with switching. / Kozat, Suleyman S.; Singer, Andrew Carl.

2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07. 2007. 4217913 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings; Vol. 3).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kozat, SS & Singer, AC 2007, Universal constant rebalanced portfolios with switching. in 2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07., 4217913, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, vol. 3, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07, Honolulu, HI, United States, 4/15/07. https://doi.org/10.1109/ICASSP.2007.366883
Kozat SS, Singer AC. Universal constant rebalanced portfolios with switching. In 2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07. 2007. 4217913. (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2007.366883
Kozat, Suleyman S. ; Singer, Andrew Carl. / Universal constant rebalanced portfolios with switching. 2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07. 2007. (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).
@inproceedings{eb10ef4a130d4b87a599a9a01b91b087,
title = "Universal constant rebalanced portfolios with switching",
abstract = "In this paper, we consider online (sequential) portfolio selection in a competitive algorithm framework. We construct a sequential algorithm for portfolio investment that asymptotically achieves the wealth of the best piecewise constant rebalanced portfolio tuned to the underlying individual sequence of price relative vectors. Without knowledge of the investment duration, the algorithm can perform as well as the best investment algorithm that can choose both the partitioning of the sequence of the price relative vectors as well as the best constant rebalanced portfolio within each segment based on knowledge of the sequence of price relative vectors in advance. We use a transition diagram similar to that in [1] to compete with an exponential number of switching investment strategies, using only linear complexity in the data length for combination. The regret with respect to the best piecewise constant strategy is at most O(ln(n)) in the exponent, where n is the investment duration. This method is also extended in [2] to switching among a finite collection of candidate algorithms, including the case where such transitions are represented by an arbitrary side-information sequence.",
keywords = "Adaptive signal processing, Bayes procedures, Finance",
author = "Kozat, {Suleyman S.} and Singer, {Andrew Carl}",
year = "2007",
month = "8",
day = "6",
doi = "10.1109/ICASSP.2007.366883",
language = "English (US)",
isbn = "1424407281",
series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",
booktitle = "2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07",

}

TY - GEN

T1 - Universal constant rebalanced portfolios with switching

AU - Kozat, Suleyman S.

AU - Singer, Andrew Carl

PY - 2007/8/6

Y1 - 2007/8/6

N2 - In this paper, we consider online (sequential) portfolio selection in a competitive algorithm framework. We construct a sequential algorithm for portfolio investment that asymptotically achieves the wealth of the best piecewise constant rebalanced portfolio tuned to the underlying individual sequence of price relative vectors. Without knowledge of the investment duration, the algorithm can perform as well as the best investment algorithm that can choose both the partitioning of the sequence of the price relative vectors as well as the best constant rebalanced portfolio within each segment based on knowledge of the sequence of price relative vectors in advance. We use a transition diagram similar to that in [1] to compete with an exponential number of switching investment strategies, using only linear complexity in the data length for combination. The regret with respect to the best piecewise constant strategy is at most O(ln(n)) in the exponent, where n is the investment duration. This method is also extended in [2] to switching among a finite collection of candidate algorithms, including the case where such transitions are represented by an arbitrary side-information sequence.

AB - In this paper, we consider online (sequential) portfolio selection in a competitive algorithm framework. We construct a sequential algorithm for portfolio investment that asymptotically achieves the wealth of the best piecewise constant rebalanced portfolio tuned to the underlying individual sequence of price relative vectors. Without knowledge of the investment duration, the algorithm can perform as well as the best investment algorithm that can choose both the partitioning of the sequence of the price relative vectors as well as the best constant rebalanced portfolio within each segment based on knowledge of the sequence of price relative vectors in advance. We use a transition diagram similar to that in [1] to compete with an exponential number of switching investment strategies, using only linear complexity in the data length for combination. The regret with respect to the best piecewise constant strategy is at most O(ln(n)) in the exponent, where n is the investment duration. This method is also extended in [2] to switching among a finite collection of candidate algorithms, including the case where such transitions are represented by an arbitrary side-information sequence.

KW - Adaptive signal processing

KW - Bayes procedures

KW - Finance

UR - http://www.scopus.com/inward/record.url?scp=34547530371&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547530371&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2007.366883

DO - 10.1109/ICASSP.2007.366883

M3 - Conference contribution

AN - SCOPUS:34547530371

SN - 1424407281

SN - 9781424407286

T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

BT - 2007 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '07

ER -