Metraipolis › archive › dc_d30313f4ccbd

Inference for H{ü}sler-Reiss block models — arXiv:2609.26501

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.26501
License (as archived)
CC0-1.0
Archived
2026-10-08T15:54:01.108Z
SHA-256 of the archived text
0e08b2ab8aacf8dd9ba2d88ceb5826de17c042df758a75f4c2f49f670d4f4332
Stable URL of this page
https://metraipolis.com/documento/dc_d30313f4ccbd

How to cite

Inference for H{ü}sler-Reiss block models — arXiv:2609.26501 — arXiv (en), https://arxiv.org/abs/2609.26501 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d30313f4ccbd (Metraipolis archive dc_d30313f4ccbd, sha256 0e08b2ab8aacf8dd9ba2d88ceb5826de17c042df758a75f4c2f49f670d4f4332)
BibTeX
@misc{dcd30313f4ccbd,
  title = {Inference for Hüsler-Reiss block models — arXiv:2609.26501},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.26501},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d30313f4ccbd; sha256 0e08b2ab8aacf8dd9ba2d88ceb5826de17c042df758a75f4c2f49f670d4f4332},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26501. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Estimating the H{ü}sler-Reiss precision matrix is a fundamental problem for statistical inference in multivariate extremes. In high-dimensional settings, the number of unknown parameters grows quadratically with the dimension, making regularisation indispensable. Existing approaches regularise the estimation problem by exploiting sparsity. In this paper, we consider an alternative structural assumption, namely that the H{ü}sler-Reiss precision matrix is block-structured. To estimate such a matrix, we introduce a new regularisation framework based on a convex fusion penalty. By encouraging rows and columns to merge, this approach provides a parsimonious representation of the precision matrix, allowing for the simultaneous estimation of its coefficients and the underlying partition of the variables. The resulting convex optimisation problem is solved by an efficient algorithm combining gradient-based updates with progressive fusion steps. We establish non-asymptotic concentration bounds for the empirical weights entering the penalty and prove consistency of both block recovery and precision matrix estimation under suitable regularity conditions. Numerical experiments demonstrate that our methodology accurately recovers the latent block structure while accurately estimating the H{ü}sler-Reiss precision matrix across various configurations, illustrating the practical benefits of fusion-based regularisation for multivariate extremes. These benefits are also demonstrated by applying the proposed method to foreign exchange data.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.ST).
Categorie arXiv: Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2609.26501 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T15:12:57.876Z dalla pagina https://arxiv.org/catchup/math.ST/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).