{"total":18,"rows":[{"id":"2106.00286","title":"On Riemannian Optimization over Positive Definite Matrices with the Bures-Wasserstein Geometry","created":"2021-06-01","cited_by_count":32,"area":null},{"id":"2203.03756","title":"Flat minima generalize for low-rank matrix recovery","created":"2022-03-07","cited_by_count":28,"area":null},{"id":"2303.12298","title":"A General Algorithm for Solving Rank-one Matrix Sensing","created":"2023-03-22","cited_by_count":15,"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":"2108.01772","title":"Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization","created":"2021-08-03","cited_by_count":4,"area":null},{"id":"2305.06199","title":"Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression","created":"2023-05-10","cited_by_count":4,"area":null},{"id":"2309.04626","title":"Perceptual adjustment queries and an inverted measurement paradigm for low-rank metric learning","created":"2023-09-08","cited_by_count":3,"area":null},{"id":"2502.02766","title":"Theoretical Guarantees for Low-Rank Compression of Deep Neural Networks","created":"2025-02-04","cited_by_count":3,"area":null},{"id":"2608.03294","title":"Provably Learning Multi-Head Attention with Queries","created":"2026-08-04","cited_by_count":2,"area":null},{"id":"2205.08225","title":"ROP inception: signal estimation with quadratic random sketching","created":"2022-05-17","cited_by_count":1,"area":null},{"id":"2206.07083","title":"Learning the Structure of Large Networked Systems Obeying Conservation Laws","created":"2022-06-14","cited_by_count":1,"area":null},{"id":"2311.04673","title":"Compressive Recovery of Sparse Precision Matrices","created":"2023-11-08","cited_by_count":1,"area":null},{"id":"2601.16873","title":"Provably Learning Attention with Queries","created":"2026-01-23","cited_by_count":1,"area":null},{"id":"2412.10005","title":"Matrix Completion via Residual Spectral Matching","created":"2024-12-13","cited_by_count":0,"area":null},{"id":"2507.23017","title":"A Smoothing Newton Method for Rank-one Matrix Recovery","created":"2025-07-30","cited_by_count":0,"area":null},{"id":"2601.06558","title":"Robust Sparse Signal Recovery with Outliers: A Hard Thresholding Pursuit Approach Based on LAD","created":"2026-01-10","cited_by_count":0,"area":null},{"id":"2601.09042","title":"SCaLE: Switching Cost aware Learning and Exploration","created":"2026-01-14","cited_by_count":0,"area":null},{"id":"2608.04227","title":"Random features for Grassmannian kernel approximation with bounded rank-one projections","created":"2026-08-04","cited_by_count":0,"area":null}],"next_cursor":null}