Paper: arXiv 2603.15511

Authors: Claudia Fassino, Pierpaolo Uberti

Abstract

Given a reference risk measure, the risk budgeting is the portfolio where each asset contributes a predetermined amount to the total risk. We propose a novel approach, alternative to the ones proposed in the literature, for the calculation of the risk budgeting portfolio. This different perspective on the problem has several interesting consequences. For the calculation of the portfolio, we define a Cauchy sequence within the simplex of R^n, whose limit corresponds to the risk budgeting portfolio. This construction allows for the straightforward implementation of an efficient algorithm, avoiding the need to solve auxiliary, equivalent optimization problems, which may be computationally challenging and hard to interpret in the decision theory context. We compare our algorithm with the standard optimization-based methods proposed in the literature. From a theoretical point of view, starting from the Cauchy sequence, we define a function for which the risk budgeting portfolio is a fixed point. Therefore, sufficient conditions for the existence and uniqueness of the fixed point can be used. The methodology is developed for general risk measures and implemented in detail in the case of standard deviation.

Complexity vs Empirical Score

  • Math Complexity: 7.5/10
  • Empirical Rigor: 3.0/10
  • Quadrant: Lab Rats — theoretically deep, empirically untested

Why this score: The paper presents a mathematically elegant fixed-point and Cauchy sequence approach to risk budgeting portfolios, replacing non-convex optimization with a constructive iterative scheme. However, the evaluation is primarily theoretical and computational rather than empirical, lacking backtesting on real-world market datasets.

Research Flowchart

  flowchart TD
    A[Goal: Calculate Risk Budgeting Portfolio for General Risk Measures] --> B[Inputs: Reference Risk Measure e.g. Std Dev & Risk Budgets]
    B --> C[Method: Define Cauchy Sequence in R^n Simplex]
    C --> D[Theory: Formulate Fixed-Point Function for Existence/Uniqueness]
    C --> E[Computation: Run Iterative Fixed-Point Algorithm]
    D --> F[Outcome: Fast, Direct Convergence without Auxiliary Optimization]
    E --> F