--- title: Rank-One Matrix Completion url: https://www.emergentmind.com/topics/rank-one-matrix-completion-r1mc type: topic --- # Rank-One Matrix Completion Rank-One Matrix Completion (R1MC) is the problem of reconstructing a matrix of rank one from a subset of its entries, often under constraints or with the presence of noise, outliers, or adversarial perturbations. R1MC plays a foundational role in low-rank modeling, statistical independence testing, collaborative filtering, channel estimation, and crowdsourcing. Despite the apparent simplicity resulting from the rank-one structure, R1MC is computationally and theoretically rich, with connections to combinatorial optimization, algebraic geometry, robust statistics, and convex/nonconvex optimization. ## 1. Formal Problem Statement and Foundational Principles Given a matrix $M \in \mathbb{R}^{m \times n}$ (or complex-valued for applications such as MIMO channel estimation), where a subset of entries indexed by $\Omega \subseteq [m] \times [n]$ is revealed, the R1MC task is to reconstruct $M$ with $\operatorname{rank}(M)=1$ such that $M_{ij}$ matches the observed entries for $(i,j)\in\Omega$. The canonical rank-one form is $M=uv^T$ for $u\in\mathbb{R}^m$, $v\in\mathbb{R}^n$. Key variants include: - **Noiseless case:** $M_{ij}=Y_{ij}$ for $(i,j)\in\Omega$, $\operatorname{rank}(M)=1$. - **Noisy case:** $\min_{u,v} \sum_{(i,j)\in\Omega} (u_i v_j - Y_{ij})^2$, often with regularization. - **Independence model:** For probability tables, $M$ lies in the simplex $\Delta^{mn-1}$ and must be nonnegative and sum to one [1407.3254]. The problem’s tractability is deeply influenced by the bipartite pattern of $\Omega$. Graph-theoretic conditions, polynomial constraints (vanishing of $2\times2$ minors), and combinatorial properties determine whether rank-one completion is feasible. ## 2. Methodologies and Algorithmic Frameworks ### Greedy and Alternating Minimization Alternating minimization iteratively updates $u$ and $v$ by solving row- and column-wise least squares: \[ \begin{align*} u_i^{(t+1)} &= \frac{\sum_{j: (i,j)\in\Omega} Y_{ij} v_j^{(t)}}{\sum_{j: (i,j)\in\Omega} (v_j^{(t)})^2} \\ v_j^{(t+1)} &= \frac{\sum_{i: (i,j)\in\Omega} Y_{ij} u_i^{(t+1)}}{\sum_{i: (i,j)\in\Omega} (u_i^{(t+1)})^2} \end{align*} \] Convergence is controlled by the spectral gap of a consensus Markov chain, with polynomial contraction rate $1 - \Theta(1/(n^2\Delta))$ [2008.04988]. ### Greedy Rank-One Pursuit R1MC is often approached by greedy pursuit algorithms adding rank-one "atoms" selected as top singular vectors of the current residual, followed by weight refinement and projection onto observed entries [1404.1377, 1607.08012]. The residual is updated orthogonally at each step, ensuring linear convergence: - **Standard R1MP/OR1MP:** Full weight update over all atoms. - **Economic variants:** Update only the most recent atom and previous estimate. Efficient implementations scale to \(10^8\) observed entries and achieve state-of-the-art speed relative to iterative nuclear-norm schemes. ### Convex and Semidefinite Programming Approaches Simple nuclear norm relaxation fails for deterministic R1MC; improved recoverability is achieved via two rounds of semidefinite relaxation with trace minimization, which is Lipschitz-stable under input perturbations [1801.00368]. These relaxations fit within the Lasserre hierarchy, leveraging sum-of-squares certificates and moment tensor manipulations via hierarchical low-rank decompositions. For certifiable optimality, R1MC can be reparametrized as a convex problem over projection matrices with semidefinite constraints, further tightened by enforcing vanishing $2\times2$ minors via Shor-style PSD blocks. Disjunctive branch-and-bound explores violated inequalities to either certify a rank-one solution or drive the solution space toward optimality [2305.12292]. ### Gradient Descent Dynamics Nonconvex gradient descent on the R1MC loss: \[ f(x) = \frac{1}{2}\left\| \mathcal{P}_\Omega(x x^T - M^*) \right\|_F^2 \] converges globally with vanilla random initialization, provided the starting vector has sufficiently small norm. Implicit regularization maintains incoherence, avoiding the need for explicit regularizers. Initial alignment and norm amplification occur in $O(\log n)$ iterations [2212.09396]. ## 3. Theoretical Guarantees, Optimality, and Complexity - **Algebraic-graphical criteria:** Rank-one completion feasibility is determined by vanishing $2\times2$ minors and contraction of the observed pattern’s bipartite graph to block-diagonal form. In the simplex, existence is equivalent to $\sum_i \sqrt{b_i} \leq 1$ for contracted blocks [1407.3254]. - **Complexity:** While general low-rank completion is NP-hard via reduction to tensor rank decision [1302.2639], rank-one cases admit polynomial time algorithms given a spanning tree of the observed entry graph. - **Certifiable optimality:** Convex relaxations via projection matrices and minor Shor blocks achieve optimality gaps below $1\%$ for moderate dimension, outperforming heuristics by $20\%\!-\!50\%$ in test MSE [2305.12292]. - **Sample complexity:** For random patterns and mild incoherence, R1MC achieves recovery with $O(n \log n)$ samples [2212.09396, 2511.00607]. - **Robustness:** Filtering-based alternating minimization with exclusion of extremal entries achieves provable resilience to adversarial corruption. Exact recovery holds with $(2F+1)$-robust graphs, and thresholds for success are established for Erdős–Rényi patterns [2010.12181]. ## 4. Robustness: Adversarial, Noisy, and Dynamic Rank Scenarios ### Adversarial Crowdsourcing R1MC augmented with local extreme-value filtering (removal of $F$ largest and $F$ smallest residuals per neighborhood) provably recovers the rank-one structure under $F$-local adversarial perturbations, provided the observed graph is $(2F+1)$-robust [2010.12181]. This method, termed M-MSR, achieves error under $0.2$ for up to $25\%$ adversaries, and significantly outperforms RPCA and variational Bayesian methods on crowdsourced datasets. ### Dynamic Rank Estimation for Channel Estimation In mmWave MIMO systems, robust block coordinate R1MC methods leverage autoregressive smoothing for online rank estimation across temporal frames. Lasso-type $\ell_1$ regularization on singular weights enables adaptation to abrupt rank changes and suppresses outlier-induced inflation. Completion and recovery are achieved in near-linear time per iteration, with exactness under standard RIP and sample complexity matching nuclear-norm minimization [2511.00607, 2511.05902]. ## 5. Geometric and Algebraic Aspects R1MC in the standard simplex establishes connections between probability models and algebraic geometry. The feasible region for simplex completions is described by high-degree polynomials, including irreducible boundary polynomials of degree $2^{n-1}$. The completion set, while not generally convex, is a semialgebraic manifold whose dimension is determined by the graph structure [1407.3254]. Tensor-based reductions (Derksen) equip R1MC with a natural lift to NP-hard tensor rank decision, bridging computational complexity and low-rank modeling [1302.2639]. ## 6. Symbolic and Numerical Moment Matrix Completion For polynomial systems arising in "unlabeled sensing," the unique solution can be recovered by rank-one moment matrix completion. Symbolic Groebner basis computation yields efficient solves for moderate $n$, while numeric SDP relaxation with nuclear norm minimization robustly returns rank-one moment matrices and successful recovery under high signal-to-noise regimes. These refinements outperform homotopy-EM methods when the system size exceeds factorial complexity [2405.16407]. ## 7. Applications and Empirical Performance | Application | Main R1MC Approach | Notable Result/Metric | |------------------------------|--------------------------------------|-----------------------------------------------| | Recommendation systems | Greedy pursuit, OR1MP, EOR1MP | RMSE~0.86 on Netflix with $10^8$ entries | | Crowdsourcing (adversarial) | M-MSR filtering alternating minimization| Error $<0.2$ under $25\%$ adversaries | | mmWave Channel Estimation | Robust BCD $\ell_1$-regularized R1MC | NMSE $<-20$ dB with $6\%$ pilot overhead | | Unlabeled sensing | Moment matrix SDP completion | $<1\%$ relative error for SNR $>50$ dB | | Independence model testing | Combinatorial-algebraic graph reduction| Polynomial-time feasibility checks | In each domain, R1MC algorithms are preferred when rank structure is dominant, sample patterns are favorable (e.g., random with sufficient connectivity), and interpretability or optimality certificates are required. Limitations include diminished robustness with high adversarial fractions, NP-hardness for associated tensor rank decisions, and increased complexity for large block-regularized or mixed-rank generalizations. --- Rank-One Matrix Completion, though mathematically elementary in its factorization, is structurally and computationally intricate; it interfaces with robust and certifiable optimization, combinatorics, algebraic geometry, and engineering, and continues to motivate efficient, provable solvers for high-dimensional, real-world inference tasks. Source: https://www.emergentmind.com/topics/rank-one-matrix-completion-r1mc