{"total":19,"rows":[{"id":"2108.12163","title":"Provable Tensor-Train Format Tensor Completion by Riemannian Optimization","created":"2021-08-27","cited_by_count":17,"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":"2206.09042","title":"Riemannian CUR Decompositions for Robust Principal Component Analysis","created":"2022-06-17","cited_by_count":7,"area":null},{"id":"2110.03975","title":"Tensor train completion: local recovery guarantees via Riemannian optimization","created":"2021-10-08","cited_by_count":6,"area":null},{"id":"2110.08754","title":"Fully-Connected Tensor Network Decomposition for Robust Tensor Completion Problem","created":"2021-10-17","cited_by_count":5,"area":null},{"id":"2211.14645","title":"Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties","created":"2022-11-26","cited_by_count":4,"area":null},{"id":"2306.03372","title":"Online Tensor Learning: Computational and Statistical Trade-offs, Adaptivity and Optimal Regret","created":"2023-06-06","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":"2410.06376","title":"Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees","created":"2024-10-08","cited_by_count":4,"area":null},{"id":"2406.07409","title":"Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent","created":"2024-06-11","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":"2212.00746","title":"Learning Transition Operators From Sparse Space-Time Samples","created":"2022-12-01","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":"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":"2508.00091","title":"Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness","created":"2025-07-31","cited_by_count":0,"area":null},{"id":"2606.22724","title":"Subspace-Constrained Federated Learning with Low-Rank Adaptation","created":"2026-06-21","cited_by_count":0,"area":null},{"id":"2609.24501","title":"Tensor Completion using Subspace Information","created":"2026-09-21","cited_by_count":0,"area":null}],"next_cursor":null}