{"total":20,"rows":[{"id":"2203.03756","title":"Flat minima generalize for low-rank matrix recovery","created":"2022-03-07","cited_by_count":28,"area":null},{"id":"2203.12513","title":"Sensing Theorems for Unsupervised Learning in Linear Inverse Problems","created":"2022-03-23","cited_by_count":28,"area":null},{"id":"2201.12151","title":"Unsupervised Learning From Incomplete Measurements for Inverse Problems","created":"2022-01-28","cited_by_count":20,"area":null},{"id":"2105.03678","title":"Nearly Minimax-Optimal Rates for Noisy Sparse Phase Retrieval via Early-Stopped Mirror Descent","created":"2021-05-08","cited_by_count":5,"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":"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":"2504.09509","title":"Optimal sparse phase retrieval via a quasi-Bayesian approach","created":"2025-04-13","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":"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":"2311.12888","title":"Acceleration and Implicit Regularization in Gaussian Phase Retrieval","created":"2023-11-21","cited_by_count":1,"area":null},{"id":"2409.04733","title":"A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval","created":"2024-09-07","cited_by_count":1,"area":null},{"id":"2108.09859","title":"Convex Latent Effect Logit Model via Sparse and Low-rank Decomposition","created":"2021-08-22","cited_by_count":0,"area":null},{"id":"2502.05407","title":"Dictionary Learning: The Complexity of Learning Sparse Superposed Features with Feedback","created":"2025-02-08","cited_by_count":0,"area":null},{"id":"2504.14741","title":"AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization","created":"2025-04-20","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.09042","title":"SCaLE: Switching Cost aware Learning and Exploration","created":"2026-01-14","cited_by_count":0,"area":null},{"id":"2602.22279","title":"Learning to reconstruct from saturated data: audio declipping and high-dynamic range imaging","created":"2026-02-25","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}