Robo-advising: Learning Investors' Risk Preferences via Portfolio Choices

Authors: Humoud Alsabah, Agostino Capponi, Octavio Ruiz Lacedelli, Matt Stern

Results of the summarizing process for the arXiv paper: 1911.02067v2

  • Comprehensive Summary
  • Key points
  • Layman's Summary
  • Blog article
The paper "Robo-advising: Learning Investors' Risk Preferences via Portfolio Choices" by Humoud Alsabah, Agostino Capponi, Octavio Ruiz Lacedelli, and Matt Stern introduces a reinforcement learning framework for retail robo-advising. The authors address the main challenge of robo-advisors not initially knowing an investor's risk preference. However, through observing portfolio choices in different market environments over time, the robo-advisor can learn this preference. To tackle this problem, the authors develop an exploration-exploitation algorithm that balances costly solicitations from the investor with autonomous trading decisions based on stale estimates of their risk aversion. This algorithm aims to converge to the optimal value function of an omniscient robo-advisor within a polynomial number of periods in both state and action space. The key contribution of this research is demonstrating that by correcting for investor mistakes, the robo-advisor can potentially outperform a stand-alone investor regardless of opportunity cost. Overall, this study presents a novel approach to addressing the challenge of learning investors' risk preferences in retail robo-advising by leveraging reinforcement learning techniques and developing an effective exploration-exploitation algorithm.
AI-generated keywords: Robo-advising Reinforcement learning Risk preferences Portfolio choices Retail

AI-generated Key Points

  • Reinforcement learning framework for retail robo-advising
  • Main challenge: robo-advisors not knowing investor's risk preference initially
  • Learning investor's risk preference through observing portfolio choices over time
  • Exploration-exploitation algorithm to balance solicitations and autonomous trading decisions
  • Aims to converge to optimal value function within a polynomial number of periods
  • Correcting for investor mistakes can potentially outperform stand-alone investor
  • Novel approach using reinforcement learning techniques in retail robo-advising
Also access our AI generated: Comprehensive summary, Lay summary, Blog-like article; or ask questions about this paper to our AI assistant.

Abstract: We introduce a reinforcement learning framework for retail robo-advising. The robo-advisor does not know the investor's risk preference, but learns it over time by observing her portfolio choices in different market environments. We develop an exploration-exploitation algorithm which trades off costly solicitations of portfolio choices by the investor with autonomous trading decisions based on stale estimates of investor's risk aversion. We show that the algorithm's value function converges to the optimal value function of an omniscient robo-advisor over a number of periods that is polynomial in the state and action space. By correcting for the investor's mistakes, the robo-advisor may outperform a stand-alone investor, regardless of the investor's opportunity cost for making portfolio decisions.

Submitted to arXiv on 05 Nov. 2019

Tools for this paper

Explain it differently 3 free rewrites left today
Export BibTeX · RIS (Zotero, Mendeley, EndNote) · Markdown (Notion, Obsidian) · Premium
Citation alerts Premium
Journal club Slides to present it Premium
For journalists Press kit and hype check Premium

Ask questions about this paper to our AI assistant

You can also chat with multiple papers at once here.

⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Assess the quality of the AI-generated content by voting

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.