Reinforcement Learning applied to Insurance Portfolio Pursuit

• URL: http://arxiv.org/abs/2408.00713v2
• Date: Fri, 2 Aug 2024 14:40:19 GMT
• Title: Reinforcement Learning applied to Insurance Portfolio Pursuit
• Authors: Edward James Young, Alistair Rogers, Elliott Tong, James Jordon,
• Abstract summary: We devise a novel reinforcement learning algorithm for its solution to the portfolio pursuit problem. We test our method on a complex synthetic market environment, and demonstrate that it outperforms a baseline method.
• Score: 11.151075150673961
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: When faced with a new customer, many factors contribute to an insurance firm's decision of what offer to make to that customer. In addition to the expected cost of providing the insurance, the firm must consider the other offers likely to be made to the customer, and how sensitive the customer is to differences in price. Moreover, firms often target a specific portfolio of customers that could depend on, e.g., age, location, and occupation. Given such a target portfolio, firms may choose to modulate an individual customer's offer based on whether the firm desires the customer within their portfolio. We term the problem of modulating offers to achieve a desired target portfolio the portfolio pursuit problem. Having formulated the portfolio pursuit problem as a sequential decision making problem, we devise a novel reinforcement learning algorithm for its solution. We test our method on a complex synthetic market environment, and demonstrate that it outperforms a baseline method which mimics current industry approaches to portfolio pursuit.

Related papers

• Segment Discovery: Enhancing E-commerce Targeting [8.000199536112937]
  This paper proposes a policy framework based on uplift modeling and constrained optimization. We demonstrate improvement over state-of-the-art targeting approaches using two large-scale experimental studies and a production implementation.
  arXiv  Detail & Related papers  (2024-09-20T18:42:04Z)
• Emulating Full Client Participation: A Long-Term Client Selection Strategy for Federated Learning [48.94952630292219]
  We propose a novel client selection strategy designed to emulate the performance achieved with full client participation. In a single round, we select clients by minimizing the gradient-space estimation error between the client subset and the full client set. In multi-round selection, we introduce a novel individual fairness constraint, which ensures that clients with similar data distributions have similar frequencies of being selected.
  arXiv  Detail & Related papers  (2024-05-22T12:27:24Z)
• Trust Driven On-Demand Scheme for Client Deployment in Federated Learning [39.9947471801304]
  "Trusted-On-Demand-FL" establishes a relationship of trust between the server and the pool of eligible clients. Our simulations rely on a continuous user behavior dataset, deploying an optimization model powered by a genetic algorithm.
  arXiv  Detail & Related papers  (2024-05-01T08:50:08Z)
• Deep Reinforcement Learning and Mean-Variance Strategies for Responsible Portfolio Optimization [49.396692286192206]
  We study the use of deep reinforcement learning for responsible portfolio optimization by incorporating ESG states and objectives. Our results show that deep reinforcement learning policies can provide competitive performance against mean-variance approaches for responsible portfolio allocation.
  arXiv  Detail & Related papers  (2024-03-25T12:04:03Z)
• Multi-Criteria Client Selection and Scheduling with Fairness Guarantee for Federated Learning Service [17.986744632466515]
  Federated Learning (FL) enables multiple clients to train machine learning models collaboratively without sharing the raw training data. We propose a multi-criteria client selection and scheduling scheme with a fairness guarantee. Our scheme can improve the model quality especially when data are non-iid.
  arXiv  Detail & Related papers  (2023-12-05T16:56:24Z)
• Intent Detection at Scale: Tuning a Generic Model using Relevant Intents [0.5461938536945723]
  This work proposes a system to scale intent predictions to various clients effectively, by combining a single generic model with a per-client list of relevant intents. Our approach minimizes training and maintenance costs while providing a personalized experience for clients, allowing for seamless adaptation to changes in their relevant intents. The final system exhibits significantly superior performance compared to industry-specific models, showcasing its flexibility and ability to cater to diverse client needs.
  arXiv  Detail & Related papers  (2023-09-15T13:15:20Z)
• Multi-Target Multiplicity: Flexibility and Fairness in Target Specification under Resource Constraints [76.84999501420938]
  We introduce a conceptual and computational framework for assessing how the choice of target affects individuals' outcomes. We show that the level of multiplicity that stems from target variable choice can be greater than that stemming from nearly-optimal models of a single target.
  arXiv  Detail & Related papers  (2023-06-23T18:57:14Z)
• On solving decision and risk management problems subject to uncertainty [91.3755431537592]
  Uncertainty is a pervasive challenge in decision and risk management. This paper develops a systematic understanding of such strategies, determine their range of application, and develop a framework to better employ them.
  arXiv  Detail & Related papers  (2023-01-18T19:16:23Z)
• Outcome-Driven Reinforcement Learning via Variational Inference [95.82770132618862]
  We discuss a new perspective on reinforcement learning, recasting it as the problem of inferring actions that achieve desired outcomes, rather than a problem of maximizing rewards. To solve the resulting outcome-directed inference problem, we establish a novel variational inference formulation that allows us to derive a well-shaped reward function. We empirically demonstrate that this method eliminates the need to design reward functions and leads to effective goal-directed behaviors.
  arXiv  Detail & Related papers  (2021-04-20T18:16:21Z)
• Dynamically Tie the Right Offer to the Right Customer in Telecommunications Industry [0.0]
  This work presents a conceptual model by studying the significant campaign-dependent variables of customer targeting. The outcomes of customer segmentation of this study could be more meaningful and relevant for marketers.
  arXiv  Detail & Related papers  (2020-10-18T16:44:51Z)
• Automatic Curriculum Learning through Value Disagreement [95.19299356298876]
  Continually solving new, unsolved tasks is the key to learning diverse behaviors. In the multi-task domain, where an agent needs to reach multiple goals, the choice of training goals can largely affect sample efficiency. We propose setting up an automatic curriculum for goals that the agent needs to solve. We evaluate our method across 13 multi-goal robotic tasks and 5 navigation tasks, and demonstrate performance gains over current state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-06-17T03:58:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.