Change-point detection in variance-covariance matrix
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914561619132416 |
|---|---|
| author | Lin, Ying Poignard, Benjamin |
| author_facet | Lin, Ying Poignard, Benjamin |
| contents | We consider the joint estimation of change point locations and the sparsity pattern of the variance covariance matrix, which is assumed to evolve in a piecewise constant manner. By applying Group Fused LASSO and LASSO penalties to the squared Frobenius norm, we estimate both the covariance structure and the change points. Adaptive weights are incorporated into the penalty terms to enhance change point detection and covariance estimation accuracy. We establish the conditions under which the estimated change points and the sparse estimators within each segment are consistent. To solve the resulting optimization problem efficiently, we develop an alternating direction method of multipliers (ADMM) whose updates reduce to computationally tractable subproblems. The performance of the proposed method is illustrated through synthetic and real data experiments, including comparisons with several competing procedures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_12881 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Change-point detection in variance-covariance matrix Lin, Ying Poignard, Benjamin Methodology We consider the joint estimation of change point locations and the sparsity pattern of the variance covariance matrix, which is assumed to evolve in a piecewise constant manner. By applying Group Fused LASSO and LASSO penalties to the squared Frobenius norm, we estimate both the covariance structure and the change points. Adaptive weights are incorporated into the penalty terms to enhance change point detection and covariance estimation accuracy. We establish the conditions under which the estimated change points and the sparse estimators within each segment are consistent. To solve the resulting optimization problem efficiently, we develop an alternating direction method of multipliers (ADMM) whose updates reduce to computationally tractable subproblems. The performance of the proposed method is illustrated through synthetic and real data experiments, including comparisons with several competing procedures. |
| title | Change-point detection in variance-covariance matrix |
| topic | Methodology |
| url | https://arxiv.org/abs/2605.12881 |