{"total":17,"rows":[{"id":"2206.08756","title":"Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay","created":"2022-06-17","cited_by_count":15,"area":null},{"id":"2401.02592","title":"Guaranteed Nonconvex Factorization Approach for Tensor Train Recovery","created":"2024-01-05","cited_by_count":8,"area":null},{"id":"2303.06198","title":"Deflated HeteroPCA: Overcoming the curse of ill-conditioning in heteroskedastic PCA","created":"2023-03-10","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":"2305.06199","title":"Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression","created":"2023-05-10","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":"2506.16032","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","created":"2025-06-19","cited_by_count":4,"area":null},{"id":"2604.21905","title":"Low-Rank Adaptation Redux for Large Models","created":"2026-04-23","cited_by_count":3,"area":null},{"id":"2410.15224","title":"Robust Low-rank Tensor Train Recovery","created":"2024-10-19","cited_by_count":2,"area":null},{"id":"2405.18412","title":"Tensor Methods in High Dimensional Data Analysis: Opportunities and Challenges","created":"2024-05-28","cited_by_count":1,"area":null},{"id":"2505.11261","title":"Fourier Low-rank and Sparse Tensor for Efficient Tensor Completion","created":"2025-05-16","cited_by_count":1,"area":null},{"id":"2512.07490","title":"Efficient Low-Tubal-Rank Tensor Estimation via Alternating Preconditioned Gradient Descent","created":"2025-12-08","cited_by_count":1,"area":null},{"id":"2306.11750","title":"Optical Coherence Tomography Image Enhancement via Block Hankelization and Low Rank Tensor Network Approximation","created":"2023-06-19","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":"2506.09594","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","created":"2025-06-11","cited_by_count":0,"area":null},{"id":"2510.17734","title":"Efficient Tensor Completion Algorithms for Highly Oscillatory Operators","created":"2025-10-20","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}