Paper: arXiv 2411.12323
Authors: Martin Arnaiz Iglesias, Adil Rengim Cetingoz, Noufel Frikha
Abstract
This paper introduces and examines numerical approximation schemes for computing risk budgeting portfolios associated to positive homogeneous and sub-additive risk measures. We employ Mirror Descent algorithms to determine the optimal risk budgeting weights in both deterministic and stochastic settings, establishing convergence along with an explicit non-asymptotic quantitative rate for the averaged algorithm. A comprehensive numerical analysis follows, illustrating our theoretical findings across various risk measures – including standard deviation, Expected Shortfall, deviation measures, and Variantiles – and comparing the performance with that of the standard stochastic gradient descent method recently proposed in the literature.
Complexity vs Empirical Score
- Math Complexity: 7.5/10
- Empirical Rigor: 6.0/10
- Quadrant: Holy Grail — high math complexity, high empirical rigor
Why this score: The paper involves advanced mathematical concepts such as Mirror Descent algorithms, convex optimization, and convergence rate analysis, indicating high math complexity; it also includes a comprehensive numerical analysis comparing methods across various risk measures, demonstrating strong empirical rigor.
Research Flowchart
flowchart TD
A["Research Goal:<br>Compute Risk Budgeting Portfolios<br>via Numerical Approximation"] --> B{"Methodology:<br>Mirror Descent Algorithms"}
B --> C["Data/Inputs:<br>Positive Homogeneous &<br>Sub-additive Risk Measures"]
C --> D["Computational Processes:<br>Deterministic & Stochastic Settings"]
D --> E["Averaged Algorithm<br>with Convergence Rate"]
E --> F["Outcomes:<br>1. Explicit Non-Asymptotic Rate<br>2. Numerical Analysis Across<br>Standard Deviation, ES, Deviation, Variantiles<br>3. Comparison vs. Stochastic Gradient Descent"]
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes deterministic and stochastic mirror descent (MD) algorithms, including a tamed gradient version, for computing risk budgeting portfolios across general risk measures.
Source sentence
We then introduce our deterministic MD (DMD) algorithm, providing con-vergence results along with a convergence rate for the weighted averaged sequence. Next, we propose and analyse a stochastic MD (SMD) scheme in a stochastic frame-work where the risk measure is expressed as the minimum of a convex map.
Assumes 5
- The learning step sequence satisfies \(\sum_{n}\gamma_n = \infty\) and \(\sum_{n}\gamma_n^2 < \infty\). statistical
Source sentence
Assume additionally that the learning step sequence (γn)n≥1 satisfies P n≥1 γn = ∞and P n≥1 γ2 n < ∞. (3.11) 11 Assume additionally that the learning step sequence (γn)n≥1 satisfies P n≥1 γn = ∞and P n≥1 γ2 n < ∞.
- The bound \(m \ge \|y^*\|_1\) holds for the radius of the feasible set. model
Source sentence
Assume that m ≥∥y⋆∥1. Assume that m ≥∥y⋆∥1, that the regularity and integrability condi-tions on the function L of Proposition 3.1 are satisfied and that sup (ξ,y)∈R×(Rd +∩Bm) E[(∂ξL(ξ, −⟨y, X⟩))2] + E[X2 i (∂xL(ξ, −⟨y, X⟩))2] < ∞, 1 ≤i ≤d.
- Risk measures are positive homogeneous and sub‑additive. model
Source sentence
This paper introduces and examines numerical approximation schemes for computing risk budgeting portfolios associated to positive homogeneous and sub-additive risk measures.
- The stochastic risk measure can be expressed as the minimum of a convex map. model
Source sentence
Next, we propose and analyse a stochastic MD (SMD) scheme in a stochastic frame-work where the risk measure is expressed as the minimum of a convex map.
Show 1 more
- The gradient of the value function may be unbounded, requiring a tamed version. other
Source sentence
By developing a tailored tamed version of the gradient, we intro-duced both deterministic and stochastic MD schemes, establishing their convergence along with a convergence rate for the weighted averaged sequence.
Data
- S&P 500 daily returns market-prices unknown
Source sentence
We randomly select d stocks from the S&P 500 components (as of Q2 2022) and obtain their daily returns from August 2008 to April 2022.
- Student‑t mixture simulated data synthetic unknown
Source sentence
We then simulate 106 data points from the fitted model and apply the SMD, c-SGD, and t-SGD algorithms to the simulated dataset, analyzing convergence by comparing the results to the reference portfolio.
Costs
Not applicable
Finds 4
- Both deterministic and stochastic MD algorithms remain stable as dimensionality increases and outperform the standard SGD algorithm recently proposed in the literature. performance
Source sentence
Our numerical results illustrate these theoretical findings, demonstrating that both algorithms remain stable as dimensionality increases and perform more effec-tively than the standard SGD algorithm recently proposed in the literature.
- The stochastic MD (SMD) algorithm converges to the minimum faster than t‑SGD in the experiments. performance
Source sentence
The results indicate that the SMD algorithm converges to the minimum faster than t-SGD.
- Tamed methods (t‑SGD and SMD) consistently avoid divergence across all tested cases, unlike c‑SGD which is sensitive to learning‑rate choice. performance
Source sentence
The figure suggests that, although c-SGD can occasionally achieve accurate results, its convergence is highly sensitive to the initial choice of the learning rate γ.5 In contrast, the tamed meth-ods exhibit notable robustness to hyperparameter selection, consistently avoiding divergence across all tested cases.
- Theoretical convergence of the weighted averaged sequence is established with explicit non‑asymptotic rates for both deterministic and stochastic MD schemes. theoretical
Source sentence
We employ Mirror Descent algorithms to determine the optimal risk budgeting weights in both deterministic and stochastic settings, establishing convergence along with an explicit non-asymptotic quantitative rate for the averaged algorithm. We establish the a.s. convergence of the SMD algorithm, along with a non-asymptotic a.s. convergence rate for the weighted average sequence.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 19 related papers). Coverage is partial, so this is neither replication nor refutation.
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.