Covariate-assisted matrix completion with multiple structural breaks

DOI10.1007/s11424-023-2342-2MaRDI QIDQ6130995

Zhaojun Wang, Long Feng, Jing Meng, Changliang Zou

Publication date: 3 April 2024

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

zbMATH Keywords

matrix completionmultiple structural breaksadditional covariateswild binary segmentation

Mathematics Subject Classification ID

Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal change point detection and localization in sparse dynamic networks
• Matrix completion via max-norm constrained optimization
• Wild binary segmentation for multiple change-point detection
• Estimation of high-dimensional low-rank matrices
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• Theory of semidefinite programming for sensor network localization
• Uniform asymptotic normality of the maximum likelihood estimator
• Multiple change-point detection: a selective overview
• Exact matrix completion via convex optimization
• Multiple change-point detection via a screening and ranking algorithm
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Statistical Analysis with Missing Data, Third Edition
• Optimal Detection of Changepoints With a Linear Computational Cost
• Matrix Completion With Covariate Information
• Narrowest-Over-Threshold Detection of Multiple Change Points and Change-Point-Like Features
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Matrix Completion From a Few Entries
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion

This page was built for publication: Covariate-assisted matrix completion with multiple structural breaks