{"total":18,"rows":[{"id":"2306.10915","title":"Practical Equivariances via Relational Conditional Neural Processes","created":"2023-06-19","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":"2302.14770","title":"Completeness of Atomic Structure Representations","created":"2023-02-28","cited_by_count":7,"area":null},{"id":"2303.05682","title":"A dual basis approach to multidimensional scaling","created":"2023-03-10","cited_by_count":5,"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":"2503.23832","title":"An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function","created":"2025-03-31","cited_by_count":4,"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":"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":"2412.10664","title":"Structured Sampling for Robust Euclidean Distance Geometry","created":"2024-12-14","cited_by_count":2,"area":null},{"id":"2302.10066","title":"Sharp analysis of EM for learning mixtures of pairwise differences","created":"2023-02-20","cited_by_count":1,"area":null},{"id":"2309.04072","title":"Riemannian Langevin Monte Carlo schemes for sampling PSD matrices with fixed rank","created":"2023-09-08","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.18414","title":"A Dual Basis Approach for Structured Robust Euclidean Distance Geometry","created":"2025-05-23","cited_by_count":1,"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":"2509.19250","title":"Recovering Wasserstein Distance Matrices from Few Measurements","created":"2025-09-23","cited_by_count":0,"area":null},{"id":"2601.22765","title":"Bayesian Matrix Completion Under Geometric Constraints","created":"2026-01-30","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}