Low-Rank Plus Sparse Matrix Transfer Learning under Growing Representations and Ambient Dimensions
Jinhang Chai, Xuyuan Liu, Elynn Chen, Yujun Yan

TL;DR
This paper introduces a transfer learning framework for structured matrix estimation that accounts for growing ambient dimensions and representations, providing theoretical guarantees and empirical validation.
Contribution
It proposes a novel transfer framework with an anchored alternating projection estimator that effectively separates source, low-rank, and sparse components in expanding spaces.
Findings
The estimator achieves improved error bounds when rank and sparsity increments are small.
The framework applies to Markov transition matrix estimation with dependent noise.
Empirical results validate the transfer gains in structured covariance estimation.
Abstract
Learning systems often expand their ambient features or latent representations over time, embedding earlier representations into larger spaces with limited new latent structure. We study transfer learning for structured matrix estimation under simultaneous growth of the ambient dimension and the intrinsic representation, where a well-estimated source task is embedded as a subspace of a higher-dimensional target task. We propose a general transfer framework in which the target parameter decomposes into an embedded source component, low-dimensional low-rank innovations, and sparse edits, and develop an anchored alternating projection estimator that preserves transferred subspaces while estimating only low-dimensional innovations and sparse modifications. We establish deterministic error bounds that separate target noise, representation growth, and source estimation error, yielding…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Stochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques
