在线投资组合选择的风险调整指数梯度策略

IF 0.9 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Combinatorial Optimization Pub Date : 2024-07-28 DOI:10.1007/s10878-024-01187-x
Jin’an He, Fangping Peng, Xiuying Xie
{"title":"在线投资组合选择的风险调整指数梯度策略","authors":"Jin’an He, Fangping Peng, Xiuying Xie","doi":"10.1007/s10878-024-01187-x","DOIUrl":null,"url":null,"abstract":"<p>This paper concerns online portfolio selection problem whose main feature is with no any statistical assumption on future asset prices. Since online portfolio selection aims to maximize the cumulative wealth, most existing online portfolio strategies do not consider risk factors into the model. To enrich the research on online portfolio selection, we introduce the risk factors into the model and propose two novel risk-adjusted online portfolio strategies. More specifically, we first choose several <i>exponential</i> <i>gradient</i> (<span>\\(\\text {EG}(\\eta )\\)</span>) with different values of parameter <span>\\(\\eta \\)</span> to build an expert pool. Later, we construct two risk methods to measure performance of each expert. Finally, we calculate the portfolio by the weighted average over all expert advice. We present theoretical and experimental results respectively to analyze the performance of the proposed strategies. Theoretical results show that the proposed strategies not only track the expert with the lowest risk, but also are universal, i.e., they exhibit the same asymptotic average logarithmic growth rate as <i>best</i> <i>constant</i> <i>rebalanced</i> <i>portfolio</i> (BCRP) determined in hindsight. We conduct extensive experiments by using daily stock data collected from the American and Chinese stock markets. Experimental results show the proposed strategies outperform existing online portfolio in terms of the return and risk metrics in most cases.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"43 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Risk-adjusted exponential gradient strategies for online portfolio selection\",\"authors\":\"Jin’an He, Fangping Peng, Xiuying Xie\",\"doi\":\"10.1007/s10878-024-01187-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>This paper concerns online portfolio selection problem whose main feature is with no any statistical assumption on future asset prices. Since online portfolio selection aims to maximize the cumulative wealth, most existing online portfolio strategies do not consider risk factors into the model. To enrich the research on online portfolio selection, we introduce the risk factors into the model and propose two novel risk-adjusted online portfolio strategies. More specifically, we first choose several <i>exponential</i> <i>gradient</i> (<span>\\\\(\\\\text {EG}(\\\\eta )\\\\)</span>) with different values of parameter <span>\\\\(\\\\eta \\\\)</span> to build an expert pool. Later, we construct two risk methods to measure performance of each expert. Finally, we calculate the portfolio by the weighted average over all expert advice. We present theoretical and experimental results respectively to analyze the performance of the proposed strategies. Theoretical results show that the proposed strategies not only track the expert with the lowest risk, but also are universal, i.e., they exhibit the same asymptotic average logarithmic growth rate as <i>best</i> <i>constant</i> <i>rebalanced</i> <i>portfolio</i> (BCRP) determined in hindsight. We conduct extensive experiments by using daily stock data collected from the American and Chinese stock markets. Experimental results show the proposed strategies outperform existing online portfolio in terms of the return and risk metrics in most cases.</p>\",\"PeriodicalId\":50231,\"journal\":{\"name\":\"Journal of Combinatorial Optimization\",\"volume\":\"43 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10878-024-01187-x\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01187-x","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

本文涉及在线投资组合选择问题,其主要特点是对未来资产价格不做任何统计假设。由于在线投资组合选择以累计财富最大化为目标,现有的在线投资组合策略大多没有将风险因素纳入模型。为了丰富在线投资组合选择的研究,我们在模型中引入了风险因素,并提出了两种新颖的风险调整在线投资组合策略。更具体地说,我们首先选择了几个指数梯度(text {EG}(\eta )\),用不同的参数值(text {EG}(\eta \))来建立专家库。之后,我们构建两种风险方法来衡量每位专家的绩效。最后,我们通过对所有专家建议的加权平均来计算投资组合。我们分别给出了理论和实验结果,以分析所提策略的性能。理论结果表明,所提出的策略不仅能跟踪风险最低的专家,而且具有普适性,即它们与事后确定的最佳恒定再平衡投资组合(BCRP)表现出相同的渐近平均对数增长率。我们利用从美国和中国股市收集的每日股票数据进行了大量实验。实验结果表明,在大多数情况下,所提出的策略在收益和风险指标上都优于现有的在线投资组合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Risk-adjusted exponential gradient strategies for online portfolio selection

This paper concerns online portfolio selection problem whose main feature is with no any statistical assumption on future asset prices. Since online portfolio selection aims to maximize the cumulative wealth, most existing online portfolio strategies do not consider risk factors into the model. To enrich the research on online portfolio selection, we introduce the risk factors into the model and propose two novel risk-adjusted online portfolio strategies. More specifically, we first choose several exponential gradient (\(\text {EG}(\eta )\)) with different values of parameter \(\eta \) to build an expert pool. Later, we construct two risk methods to measure performance of each expert. Finally, we calculate the portfolio by the weighted average over all expert advice. We present theoretical and experimental results respectively to analyze the performance of the proposed strategies. Theoretical results show that the proposed strategies not only track the expert with the lowest risk, but also are universal, i.e., they exhibit the same asymptotic average logarithmic growth rate as best constant rebalanced portfolio (BCRP) determined in hindsight. We conduct extensive experiments by using daily stock data collected from the American and Chinese stock markets. Experimental results show the proposed strategies outperform existing online portfolio in terms of the return and risk metrics in most cases.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
期刊最新文献
Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity A novel arctic fox survival strategy inspired optimization algorithm Dynamic time window based full-view coverage maximization in CSNs Different due-window assignment scheduling with deterioration effects An upper bound for neighbor-connectivity of graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1