Universal switching and side information portfolios under transaction costs using factor graphs

Andrew J. Bean, Andrew Carl Singer

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

Abstract

We consider the sequential portfolio investment problem. We demonstrate that the insights of Blum and Kalai's transaction costs algorithm may be used to construct more sophisticated algorithms. In particular, we show that transaction costs can be taken into account in Cover and Ordentlich's side information portfolio and Kozat and Singer's switching portfolio. For these, we present the corresponding universal (low regret) performance bounds for each of these portfolios. We then present factor graph representations of the algorithms and demonstrate that computationally efficient algorithms may be derived from the graphs. Finally, we present results of simulations of one of the derived algorithms and compare it to other portfolios.

Original languageEnglish (US)
Title of host publication2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings
Pages1986-1989
Number of pages4
DOIs
StatePublished - Nov 8 2010
Event2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Dallas, TX, United States
Duration: Mar 14 2010Mar 19 2010

Publication series

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

Other

Other2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010
CountryUnited States
CityDallas, TX
Period3/14/103/19/10

Fingerprint

Costs

Keywords

  • Factor graph
  • Portfolio
  • Sum-product
  • Transaction costs
  • Universal

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Bean, A. J., & Singer, A. C. (2010). Universal switching and side information portfolios under transaction costs using factor graphs. In 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings (pp. 1986-1989). [5495255] (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2010.5495255

Universal switching and side information portfolios under transaction costs using factor graphs. / Bean, Andrew J.; Singer, Andrew Carl.

2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings. 2010. p. 1986-1989 5495255 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).

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

Bean, AJ & Singer, AC 2010, Universal switching and side information portfolios under transaction costs using factor graphs. in 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings., 5495255, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, pp. 1986-1989, 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010, Dallas, TX, United States, 3/14/10. https://doi.org/10.1109/ICASSP.2010.5495255
Bean AJ, Singer AC. Universal switching and side information portfolios under transaction costs using factor graphs. In 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings. 2010. p. 1986-1989. 5495255. (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2010.5495255
Bean, Andrew J. ; Singer, Andrew Carl. / Universal switching and side information portfolios under transaction costs using factor graphs. 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings. 2010. pp. 1986-1989 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).
@inproceedings{0436357e6eeb471499d70048dad55b4d,
title = "Universal switching and side information portfolios under transaction costs using factor graphs",
abstract = "We consider the sequential portfolio investment problem. We demonstrate that the insights of Blum and Kalai's transaction costs algorithm may be used to construct more sophisticated algorithms. In particular, we show that transaction costs can be taken into account in Cover and Ordentlich's side information portfolio and Kozat and Singer's switching portfolio. For these, we present the corresponding universal (low regret) performance bounds for each of these portfolios. We then present factor graph representations of the algorithms and demonstrate that computationally efficient algorithms may be derived from the graphs. Finally, we present results of simulations of one of the derived algorithms and compare it to other portfolios.",
keywords = "Factor graph, Portfolio, Sum-product, Transaction costs, Universal",
author = "Bean, {Andrew J.} and Singer, {Andrew Carl}",
year = "2010",
month = "11",
day = "8",
doi = "10.1109/ICASSP.2010.5495255",
language = "English (US)",
isbn = "9781424442966",
series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",
pages = "1986--1989",
booktitle = "2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings",

}

TY - GEN

T1 - Universal switching and side information portfolios under transaction costs using factor graphs

AU - Bean, Andrew J.

AU - Singer, Andrew Carl

PY - 2010/11/8

Y1 - 2010/11/8

N2 - We consider the sequential portfolio investment problem. We demonstrate that the insights of Blum and Kalai's transaction costs algorithm may be used to construct more sophisticated algorithms. In particular, we show that transaction costs can be taken into account in Cover and Ordentlich's side information portfolio and Kozat and Singer's switching portfolio. For these, we present the corresponding universal (low regret) performance bounds for each of these portfolios. We then present factor graph representations of the algorithms and demonstrate that computationally efficient algorithms may be derived from the graphs. Finally, we present results of simulations of one of the derived algorithms and compare it to other portfolios.

AB - We consider the sequential portfolio investment problem. We demonstrate that the insights of Blum and Kalai's transaction costs algorithm may be used to construct more sophisticated algorithms. In particular, we show that transaction costs can be taken into account in Cover and Ordentlich's side information portfolio and Kozat and Singer's switching portfolio. For these, we present the corresponding universal (low regret) performance bounds for each of these portfolios. We then present factor graph representations of the algorithms and demonstrate that computationally efficient algorithms may be derived from the graphs. Finally, we present results of simulations of one of the derived algorithms and compare it to other portfolios.

KW - Factor graph

KW - Portfolio

KW - Sum-product

KW - Transaction costs

KW - Universal

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

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

U2 - 10.1109/ICASSP.2010.5495255

DO - 10.1109/ICASSP.2010.5495255

M3 - Conference contribution

AN - SCOPUS:78049360413

SN - 9781424442966

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

SP - 1986

EP - 1989

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

ER -