{"total":31,"rows":[{"id":"2112.15311","title":"Bayesian Optimization of Function Networks","created":"2021-12-31","cited_by_count":33,"area":null},{"id":"2104.14526","title":"Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements","created":"2021-04-29","cited_by_count":28,"area":null},{"id":"2109.11154","title":"Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery","created":"2021-09-23","cited_by_count":22,"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":"2106.03034","title":"Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization","created":"2021-06-06","cited_by_count":10,"area":null},{"id":"2106.12933","title":"GNMR: A provable one-line algorithm for low rank matrix recovery","created":"2021-06-24","cited_by_count":10,"area":null},{"id":"2109.09859","title":"Sharp global convergence guarantees for iterative nonconvex optimization: A Gaussian process perspective","created":"2021-09-20","cited_by_count":10,"area":null},{"id":"2209.10675","title":"A Validation Approach to Over-parameterized Matrix and Image Recovery","created":"2022-09-21","cited_by_count":8,"area":null},{"id":"2212.11346","title":"Deep Unfolded Tensor Robust PCA with Self-supervised Learning","created":"2022-12-21","cited_by_count":7,"area":null},{"id":"2310.06159","title":"Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled Gradient Descent, Even with Overparameterization","created":"2023-10-09","cited_by_count":6,"area":null},{"id":"2305.17224","title":"Fast and Accurate Estimation of Low-Rank Matrices from Noisy Measurements via Preconditioned Non-Convex Gradient Descent","created":"2023-05-26","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":"2206.04276","title":"Robust Matrix Completion with Heavy-tailed Noise","created":"2022-06-09","cited_by_count":4,"area":null},{"id":"2209.15130","title":"Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective","created":"2022-09-29","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":"2410.16826","title":"Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery","created":"2024-10-22","cited_by_count":4,"area":null},{"id":"2202.04026","title":"Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems","created":"2022-02-08","cited_by_count":3,"area":null},{"id":"2401.13971","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","created":"2024-01-25","cited_by_count":3,"area":null},{"id":"2405.10289","title":"On the Uniform Convergence of Subdifferentials in Stochastic Optimization and Learning","created":"2024-05-16","cited_by_count":3,"area":null},{"id":"2408.13276","title":"Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity","created":"2024-08-20","cited_by_count":3,"area":null},{"id":"2408.16852","title":"The Star Geometry of Critic-Based Regularizer Learning","created":"2024-08-29","cited_by_count":3,"area":null},{"id":"2101.05113","title":"Beyond Procrustes: Balancing-Free Gradient Descent for Asymmetric Low-Rank Matrix Sensing","created":"2021-01-13","cited_by_count":2,"area":null},{"id":"2302.10963","title":"Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?","created":"2023-02-21","cited_by_count":2,"area":null},{"id":"2410.15224","title":"Robust Low-rank Tensor Train Recovery","created":"2024-10-19","cited_by_count":2,"area":null},{"id":"2605.26977","title":"Convergence of Spectral Descent for Non-smooth Optimization","created":"2026-05-26","cited_by_count":2,"area":null},{"id":"2304.12522","title":"A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase Retrieval","created":"2023-04-25","cited_by_count":1,"area":null},{"id":"2405.09676","title":"The radius of statistical efficiency","created":"2024-05-15","cited_by_count":1,"area":null},{"id":"2206.11523","title":"Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems","created":"2022-06-23","cited_by_count":0,"area":null},{"id":"2303.16822","title":"An inexact LPA for DC composite optimization and application to matrix completions with outliers","created":"2023-03-29","cited_by_count":0,"area":null},{"id":"2604.00060","title":"Scaled Gradient Descent for Ill-Conditioned Low-Rank Matrix Recovery with Optimal Sampling Complexity","created":"2026-03-31","cited_by_count":0,"area":null},{"id":"2606.31390","title":"Direction-Magnitude Decomposition for Low-Rank Matrix Optimization: Faster Convergence and Saddle-to-saddle Dynamics","created":"2026-06-30","cited_by_count":0,"area":null}],"next_cursor":null}