{"total":80,"rows":[{"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":"2302.11068","title":"Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time","created":"2023-02-21","cited_by_count":31,"area":null},{"id":"2305.16038","title":"Implicit bias of SGD in $L_{2}$-regularized linear DNNs: One-way jumps from high to low rank","created":"2023-05-25","cited_by_count":29,"area":null},{"id":"2104.14526","title":"Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements","created":"2021-04-29","cited_by_count":28,"area":null},{"id":"2410.23819","title":"Weight decay induces low-rank attention layers","created":"2024-10-31","cited_by_count":27,"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":"2203.16462","title":"Convergence of gradient descent for deep neural networks","created":"2022-03-30","cited_by_count":24,"area":null},{"id":"2109.09046","title":"Improving Fairness for Data Valuation in Horizontal Federated Learning","created":"2021-09-19","cited_by_count":22,"area":null},{"id":"2109.11154","title":"Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery","created":"2021-09-23","cited_by_count":22,"area":null},{"id":"2107.12365","title":"Inference for Heteroskedastic PCA with Missing Data","created":"2021-07-26","cited_by_count":21,"area":null},{"id":"2206.03345","title":"Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification","created":"2022-06-07","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":"2201.02658","title":"Fair and efficient contribution valuation for vertical federated learning","created":"2022-01-07","cited_by_count":18,"area":null},{"id":"2207.08041","title":"Personalized PCA: Decoupling Shared and Unique Features","created":"2022-07-17","cited_by_count":17,"area":null},{"id":"2104.12031","title":"Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence","created":"2021-04-24","cited_by_count":13,"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":"2106.04769","title":"Submodular + Concave","created":"2021-06-09","cited_by_count":13,"area":null},{"id":"2207.01789","title":"Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterization","created":"2022-07-05","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":"2504.09708","title":"Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization","created":"2025-04-13","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":"2204.11516","title":"Randomly Initialized Alternating Least Squares: Fast Convergence for Matrix Sensing","created":"2022-04-25","cited_by_count":11,"area":null},{"id":"2104.11510","title":"Time Series Forecasting via Learning Convolutionally Low-Rank Models","created":"2021-04-23","cited_by_count":10,"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":"2107.09802","title":"Private Alternating Least Squares: Practical Private Matrix Completion with Tighter Rates","created":"2021-07-20","cited_by_count":10,"area":null},{"id":"2212.04025","title":"A Novel Stochastic Gradient Descent Algorithm for Learning Principal Subspaces","created":"2022-12-08","cited_by_count":7,"area":null},{"id":"2106.07193","title":"Crowdsourcing via Annotator Co-occurrence Imputation and Provable Symmetric Nonnegative Matrix Factorization","created":"2021-06-14","cited_by_count":6,"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":"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":"2104.07006","title":"Fast quantum state reconstruction via accelerated non-convex programming","created":"2021-04-14","cited_by_count":5,"area":null},{"id":"2104.10790","title":"Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime","created":"2021-04-21","cited_by_count":5,"area":null},{"id":"2204.14067","title":"Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition","created":"2022-04-29","cited_by_count":5,"area":null},{"id":"2305.17224","title":"Fast and Accurate Estimation of Low-Rank Matrices from Noisy Measurements via Preconditioned Non-Convex Gradient Descent","created":"2023-05-26","cited_by_count":5,"area":null},{"id":"2204.01815","title":"Tensor Completion with Provable Consistency and Fairness Guarantees for Recommender Systems","created":"2022-04-04","cited_by_count":4,"area":null},{"id":"2206.04276","title":"Robust Matrix Completion with Heavy-tailed Noise","created":"2022-06-09","cited_by_count":4,"area":null},{"id":"2212.09396","title":"Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization","created":"2022-12-19","cited_by_count":4,"area":null},{"id":"2308.03661","title":"Matrix Completion in Almost-Verification Time","created":"2023-08-07","cited_by_count":4,"area":null},{"id":"2406.05822","title":"Symmetric Matrix Completion with ReLU Sampling","created":"2024-06-09","cited_by_count":4,"area":null},{"id":"2406.06002","title":"Computational and Statistical Guarantees for Tensor-on-Tensor Regression with Tensor Train Decomposition","created":"2024-06-10","cited_by_count":4,"area":null},{"id":"2502.00463","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","created":"2025-02-01","cited_by_count":4,"area":null},{"id":"2102.00937","title":"Riemannian Perspective on Matrix Factorization","created":"2021-02-01","cited_by_count":3,"area":null},{"id":"2102.02396","title":"Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent","created":"2021-02-04","cited_by_count":3,"area":null},{"id":"2110.12121","title":"On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-rank Matrix Optimization","created":"2021-10-23","cited_by_count":3,"area":null},{"id":"2307.13818","title":"Gradient-Based Spectral Embeddings of Random Dot Product Graphs","created":"2023-07-25","cited_by_count":3,"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":"2410.16982","title":"Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization","created":"2024-10-22","cited_by_count":3,"area":null},{"id":"2505.22602","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","created":"2025-05-28","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":"2112.11760","title":"On Asymptotic Linear Convergence of Projected Gradient Descent for Constrained Least Squares","created":"2021-12-22","cited_by_count":2,"area":null},{"id":"2201.10245","title":"On Uniform Boundedness Properties of SGD and its Momentum Variants","created":"2022-01-25","cited_by_count":2,"area":null},{"id":"2309.03439","title":"Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data","created":"2023-09-07","cited_by_count":2,"area":null},{"id":"2403.14899","title":"Statistical Inference For Noisy Matrix Completion Incorporating Auxiliary Information","created":"2024-03-22","cited_by_count":2,"area":null},{"id":"2110.12046","title":"Uncertainty Quantification For Low-Rank Matrix Completion With Heterogeneous and Sub-Exponential Noise","created":"2021-10-22","cited_by_count":1,"area":null},{"id":"2212.00746","title":"Learning Transition Operators From Sparse Space-Time Samples","created":"2022-12-01","cited_by_count":1,"area":null},{"id":"2303.11453","title":"Greedy Pruning with Group Lasso Provably Generalizes for Matrix Sensing","created":"2023-03-20","cited_by_count":1,"area":null},{"id":"2405.02101","title":"Discrete Aware Matrix Completion via Convexized $\\ell_0$-Norm Approximation","created":"2024-05-03","cited_by_count":1,"area":null},{"id":"2410.23595","title":"Disentangling Interpretable Factors with Supervised Independent Subspace Principal Component Analysis","created":"2024-10-31","cited_by_count":1,"area":null},{"id":"2501.16322","title":"Implicit Bias in Matrix Factorization and its Explicit Realization in a New Architecture","created":"2025-01-27","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":"2505.03717","title":"Nonnegative Low-rank Matrix Recovery Can Have Spurious Local Minima","created":"2025-05-06","cited_by_count":1,"area":null},{"id":"2507.09428","title":"On Information Geometry and Iterative Optimization in Model Compression: Operator Factorization","created":"2025-07-12","cited_by_count":1,"area":null},{"id":"2511.04485","title":"Q3R: Quadratic Reweighted Rank Regularizer for Effective Low-Rank Training","created":"2025-11-06","cited_by_count":1,"area":null},{"id":"2111.06302","title":"On Recovering the Best Rank-r Approximation from Few Entries","created":"2021-11-11","cited_by_count":0,"area":null},{"id":"2307.08857","title":"An Admissible Shift-Consistent Method for Recommender Systems","created":"2023-07-17","cited_by_count":0,"area":null},{"id":"2310.03224","title":"Matrix Completion from One-Bit Dither Samples","created":"2023-10-05","cited_by_count":0,"area":null},{"id":"2405.06569","title":"Efficient Federated Low Rank Matrix Completion","created":"2024-05-10","cited_by_count":0,"area":null},{"id":"2406.04588","title":"Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model","created":"2024-06-07","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":"2409.19550","title":"Tailed Low-Rank Matrix Factorization for Similarity Matrix Completion","created":"2024-09-29","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":"2501.13385","title":"Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent","created":"2025-01-23","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":"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":"2509.18024","title":"Core-elements Subsampling for Alternating Least Squares","created":"2025-09-22","cited_by_count":0,"area":null},{"id":"2601.12213","title":"One-Sided Matrix Completion from Ultra-Sparse Samples","created":"2026-01-18","cited_by_count":0,"area":null},{"id":"2604.17001","title":"Inductive Convolution Nuclear Norm Minimization for Tensor Completion with Arbitrary Sampling","created":"2026-04-18","cited_by_count":0,"area":null},{"id":"2608.21607","title":"Subzero matrix completion for sparse data analysis: large-scale learning of latent low-rank structure","created":"2026-08-21","cited_by_count":0,"area":null}],"next_cursor":null}