Dynamic Nonlinear Matrix Completion for Time-Varying Data Imputation
Jicong Fan
Abstract
Classical matrix completion methods focus on data with stationary latent structure and hence are not effective in missing value imputation when the latent structure changes with time. This paper proposes a dynamic nonlinear matrix completion (D-NLMC) method, which is able to recover the missing values of streaming data when the low-dimensional nonlinear latent structure of the data changes with time. The paper provides an efficient approach to updating the nonlinear model dynamically. D-NLMC incorporates the information of new data and remove the information of earlier data recursively. The paper shows that the missing data can be estimated if the change of latent structure is slow enough. Different from existing online or adaptive low-rank matrix completion methods, D-NLMC does not require the local low-rank assumption and is able to adaptively recover high-rank matrices with low-dimensional latent structures. Note that existing high-rank matrix completion methods have high-computational costs and are not applicable to streaming data with varying latent structures, which fortunately can be handled by D-NLMC efficiently and accurately. Numerical results show that D-NLMC outperforms the baselines in real applications.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4c8702bf-6c07-4b63-aa85-c621507fd04bCited by top-tier papers5
- Graph Convolutional Kernel Machine versus Graph Convolutional NetworksZhihao Wu, Zhao Zhang, Jicong FanNeurIPS 2023 · 41 citations
- TimeCHEAT: A Channel Harmony Strategy for Irregularly Sampled Multivariate Time Series AnalysisJiexi Liu, Meng Cao, Songcan ChenAAAI 2025 · 16 citations
- Neuron-Enhanced AutoEncoder Matrix Completion and Collaborative Filtering: Theory and PracticeJicong Fan, Rui Chen, Zhao Zhang, Chris DingICLR 2024 · 4 citations
- Boosting Spectral Clustering on Incomplete Data via Kernel Correction and Affinity LearningFangchen Yu, Runze Zhao, Zhan Shi, Yiwen Lu et al.NeurIPS 2023 · 2 citations
- Beyond Observations: Reconstruction Error-Guided Irregularly Sampled Time Series Representation LearningJiexi Liu, Meng Cao, Songcan ChenAAAI 2026
Builds on3
- NeuMiss networks: differentiable programming for supervised learning with missing valuesMarine Le Morvan, Julie Josse, Thomas Moreau, Erwan Scornet et al.NeurIPS 2020 · 50 citations
- Polynomial Matrix Completion for Missing Data Imputation and Transductive LearningJicong Fan, Yuqian Zhang, Madeleine UdellAAAI 2020 · 41 citations
- Large-Scale Subspace Clustering via k-FactorizationJicong FanKDD 2021 · 17 citations
Related papers
- Deep-Union CompletionSiddharth Baskar, Karan Vikyath Veeranna Rupashree, Daniel L. Pimentel-AlarcónAAAI 2025 · 1 citation
- DAMR: Dynamic Adjacency Matrix Representation Learning for Multivariate Time Series ImputationXiaobin Ren, Kaiqi Zhao, Patricia J. Riddle, Katerina Taskova et al.SIGMOD 2023 · 15 citations
- Online Missing Value Imputation and Change Point Detection with the Gaussian CopulaYuxuan Zhao, Eric Landgrebe, Eliot Shekhtman, Madeleine UdellAAAI 2022 · 12 citations
- Inductive Matrix Completion Based on Graph Neural NetworksMuhan Zhang, Yixin ChenICLR 2020 · 273 citations
- Self-Attention Driven Tensor Representation for High-Order Data RecoveryZhi-Wei Shi, Yu-Bang Zheng, Heng-Chao LiCVPR 2026
