{"total":27,"rows":[{"id":"2203.03756","title":"Flat minima generalize for low-rank matrix recovery","created":"2022-03-07","cited_by_count":28,"area":null},{"id":"2201.12592","title":"Exact Decomposition of Joint Low Rankness and Local Smoothness Plus Sparse Matrices","created":"2022-01-29","cited_by_count":19,"area":null},{"id":"2501.02625","title":"HALO: Hadamard-Assisted Lower-Precision Optimization for LLMs","created":"2025-01-05","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":"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":"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":"2206.04276","title":"Robust Matrix Completion with Heavy-tailed Noise","created":"2022-06-09","cited_by_count":4,"area":null},{"id":"2311.18076","title":"Localization from structured distance matrices via low-rank matrix recovery","created":"2023-11-29","cited_by_count":4,"area":null},{"id":"2101.06388","title":"Informative core identification in complex networks","created":"2021-01-16","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":"2109.04022","title":"Multi-Tensor Network Representation for High-Order Tensor Completion","created":"2021-09-09","cited_by_count":2,"area":null},{"id":"2212.08339","title":"Generalization Bounds for Inductive Matrix Completion in Low-noise Settings","created":"2022-12-16","cited_by_count":2,"area":null},{"id":"2302.10963","title":"Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?","created":"2023-02-21","cited_by_count":2,"area":null},{"id":"2305.19818","title":"Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning","created":"2023-05-31","cited_by_count":2,"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":"2302.02096","title":"Matrix Estimation for Individual Fairness","created":"2023-02-04","cited_by_count":1,"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":"2504.19530","title":"Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent","created":"2025-04-28","cited_by_count":1,"area":null},{"id":"2408.05431","title":"Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan","created":"2024-08-10","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":"2502.09534","title":"Fast Tensor Completion via Approximate Richardson Iteration","created":"2025-02-13","cited_by_count":0,"area":null},{"id":"2507.18327","title":"Beyond Low-rankness: Guaranteed Matrix Recovery via Modified Nuclear Norm","created":"2025-07-24","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":"2605.17189","title":"Sample-efficient inductive matrix completion with noise and inexact side-information","created":"2026-05-16","cited_by_count":0,"area":null}],"next_cursor":null}