{"total":38,"rows":[{"id":"2102.07078","title":"Exploiting Shared Representations for Personalized Federated Learning","created":"2021-02-14","cited_by_count":541,"area":null},{"id":"2106.14289","title":"Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix Factorization","created":"2021-06-27","cited_by_count":45,"area":null},{"id":"2203.02839","title":"Algorithmic Regularization in Model-free Overparametrized Asymmetric Matrix Factorization","created":"2022-03-06","cited_by_count":34,"area":null},{"id":"2102.02756","title":"On the computational and statistical complexity of over-parameterized matrix sensing","created":"2021-01-27","cited_by_count":31,"area":null},{"id":"2406.04112","title":"Compressible Dynamics in Deep Overparameterized Low-Rank Learning & Adaptation","created":"2024-06-06","cited_by_count":26,"area":null},{"id":"2107.12365","title":"Inference for Heteroskedastic PCA with Missing Data","created":"2021-07-26","cited_by_count":21,"area":null},{"id":"2306.01154","title":"The Law of Parsimony in Gradient Descent for Learning Deep Linear Networks","created":"2023-06-01","cited_by_count":20,"area":null},{"id":"2102.12430","title":"Noisy Gradient Descent Converges to Flat Minima for Nonconvex Matrix Factorization","created":"2021-02-24","cited_by_count":15,"area":null},{"id":"2106.02119","title":"A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few Samples","created":"2021-06-03","cited_by_count":13,"area":null},{"id":"2208.09723","title":"Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling","created":"2022-08-20","cited_by_count":12,"area":null},{"id":"2305.06927","title":"Convergence of Alternating Gradient Descent for Matrix Factorization","created":"2023-05-11","cited_by_count":12,"area":null},{"id":"2105.13831","title":"Implicit Regularization in Matrix Sensing via Mirror Descent","created":"2021-05-28","cited_by_count":11,"area":null},{"id":"2105.10360","title":"Multi-source Learning via Completion of Block-wise Overlapping Noisy Matrices","created":"2021-05-21","cited_by_count":10,"area":null},{"id":"2106.12933","title":"GNMR: A provable one-line algorithm for low rank matrix recovery","created":"2021-06-24","cited_by_count":10,"area":null},{"id":"2208.11246","title":"Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion","created":"2022-08-24","cited_by_count":6,"area":null},{"id":"2210.04810","title":"Towards a Theoretical Foundation of Policy Optimization for Learning Control Policies","created":"2022-10-10","cited_by_count":6,"area":null},{"id":"2310.06159","title":"Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled Gradient Descent, Even with Overparameterization","created":"2023-10-09","cited_by_count":6,"area":null},{"id":"2402.06756","title":"Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion","created":"2024-02-09","cited_by_count":6,"area":null},{"id":"2206.04276","title":"Robust Matrix Completion with Heavy-tailed Noise","created":"2022-06-09","cited_by_count":4,"area":null},{"id":"2408.13276","title":"Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity","created":"2024-08-20","cited_by_count":3,"area":null},{"id":"2101.05113","title":"Beyond Procrustes: Balancing-Free Gradient Descent for Asymmetric Low-Rank Matrix Sensing","created":"2021-01-13","cited_by_count":2,"area":null},{"id":"2404.17592","title":"Low-Rank Online Dynamic Assortment with Dual Contextual Information","created":"2024-04-19","cited_by_count":2,"area":null},{"id":"2409.08771","title":"In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting","created":"2024-09-13","cited_by_count":2,"area":null},{"id":"2407.19446","title":"Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions","created":"2024-07-28","cited_by_count":1,"area":null},{"id":"2502.20033","title":"Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization","created":"2025-02-27","cited_by_count":1,"area":null},{"id":"2504.19530","title":"Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent","created":"2025-04-28","cited_by_count":1,"area":null},{"id":"2602.03954","title":"Learning Multi-type heterogeneous interacting particle systems","created":"2026-02-03","cited_by_count":1,"area":null},{"id":"2405.06569","title":"Efficient Federated Low Rank Matrix Completion","created":"2024-05-10","cited_by_count":0,"area":null},{"id":"2407.13731","title":"Predictive Low Rank Matrix Learning under Partial Observations: Mixed-Projection ADMM","created":"2024-07-18","cited_by_count":0,"area":null},{"id":"2412.10005","title":"Matrix Completion via Residual Spectral Matching","created":"2024-12-13","cited_by_count":0,"area":null},{"id":"2502.08536","title":"Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach","created":"2025-02-12","cited_by_count":0,"area":null},{"id":"2504.14741","title":"AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization","created":"2025-04-20","cited_by_count":0,"area":null},{"id":"2505.12919","title":"RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees","created":"2025-05-19","cited_by_count":0,"area":null},{"id":"2508.09685","title":"Global Convergence Analysis of Vanilla Gradient Descent for Asymmetric Matrix Completion","created":"2025-08-13","cited_by_count":0,"area":null},{"id":"2605.05446","title":"Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation","created":"2026-05-06","cited_by_count":0,"area":null},{"id":"2605.17189","title":"Sample-efficient inductive matrix completion with noise and inexact side-information","created":"2026-05-16","cited_by_count":0,"area":null},{"id":"2605.26271","title":"Learning Nonlinear Factor Models with Unknown Monotone Links from Incomplete and Noisy Data","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.08188","title":"Latent Structural Categorical Matrix Completion with Application to Quasispecies Analysis","created":"2026-06-06","cited_by_count":0,"area":null}],"next_cursor":null}