{"total":67,"rows":[{"id":"2403.03507","title":"GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projection","created":"2024-03-06","cited_by_count":463,"area":null},{"id":"2110.03677","title":"Large Learning Rate Tames Homogeneity: Convergence and Balancing Effect","created":"2021-10-07","cited_by_count":50,"area":null},{"id":"2410.01623","title":"Fira: Can We Achieve Full-rank Training of LLMs Under Low-rank Constraint?","created":"2024-10-02","cited_by_count":43,"area":null},{"id":"2303.14676","title":"PDPP: Projected Diffusion for Procedure Planning in Instructional Videos","created":"2023-03-26","cited_by_count":36,"area":null},{"id":"2102.02756","title":"On the computational and statistical complexity of over-parameterized matrix sensing","created":"2021-01-27","cited_by_count":31,"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":"2103.01489","title":"Mind Mappings: Enabling Efficient Algorithm-Accelerator Mapping Space Search","created":"2021-03-02","cited_by_count":24,"area":null},{"id":"2203.16462","title":"Convergence of gradient descent for deep neural networks","created":"2022-03-30","cited_by_count":24,"area":null},{"id":"2107.12365","title":"Inference for Heteroskedastic PCA with Missing Data","created":"2021-07-26","cited_by_count":21,"area":null},{"id":"2202.08788","title":"Global Convergence of Sub-gradient Method for Robust Matrix Recovery: Small Initialization, Noisy Measurements, and Over-parameterization","created":"2022-02-17","cited_by_count":21,"area":null},{"id":"2405.17991","title":"VeLoRA: Memory Efficient Training using Rank-1 Sub-Token Projections","created":"2024-05-28","cited_by_count":18,"area":null},{"id":"2102.12430","title":"Noisy Gradient Descent Converges to Flat Minima for Nonconvex Matrix Factorization","created":"2021-02-24","cited_by_count":15,"area":null},{"id":"2109.12701","title":"Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach","created":"2021-09-26","cited_by_count":14,"area":null},{"id":"2409.10927","title":"Propulsion: Steering LLM with Tiny Fine-Tuning","created":"2024-09-17","cited_by_count":14,"area":null},{"id":"2210.13111","title":"Federated Learning and Meta Learning: Approaches, Applications, and Directions","created":"2022-10-24","cited_by_count":12,"area":null},{"id":"2504.09708","title":"Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization","created":"2025-04-13","cited_by_count":12,"area":null},{"id":"2105.13831","title":"Implicit Regularization in Matrix Sensing via Mirror Descent","created":"2021-05-28","cited_by_count":11,"area":null},{"id":"2412.19616","title":"Gradient Weight-normalized Low-rank Projection for Efficient LLM Training","created":"2024-12-27","cited_by_count":11,"area":null},{"id":"2105.10360","title":"Multi-source Learning via Completion of Block-wise Overlapping Noisy Matrices","created":"2021-05-21","cited_by_count":10,"area":null},{"id":"2410.08598","title":"Parameter-Efficient Fine-Tuning of Large Language Models using Semantic Knowledge Tuning","created":"2024-10-11","cited_by_count":10,"area":null},{"id":"2302.03682","title":"Approximate message passing from random initialization with applications to $\\mathbb{Z}_{2}$ synchronization","created":"2023-02-07","cited_by_count":9,"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":"2412.00071","title":"COAP: Memory-Efficient Training with Correlation-Aware Gradient Projection","created":"2024-11-26","cited_by_count":8,"area":null},{"id":"2401.11940","title":"Low-Tubal-Rank Tensor Recovery via Factorized Gradient Descent","created":"2024-01-22","cited_by_count":7,"area":null},{"id":"2203.01190","title":"Model-free Neural Lyapunov Control for Safe Robot Navigation","created":"2022-03-02","cited_by_count":6,"area":null},{"id":"2208.11246","title":"Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion","created":"2022-08-24","cited_by_count":6,"area":null},{"id":"2210.04810","title":"Towards a Theoretical Foundation of Policy Optimization for Learning Control Policies","created":"2022-10-10","cited_by_count":6,"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":"2402.06756","title":"Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion","created":"2024-02-09","cited_by_count":6,"area":null},{"id":"2104.07006","title":"Fast quantum state reconstruction via accelerated non-convex programming","created":"2021-04-14","cited_by_count":5,"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":"2503.20505","title":"Riemannian Optimization on Relaxed Indicator Matrix Manifold","created":"2025-03-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":"2212.09396","title":"Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization","created":"2022-12-19","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":"2306.03372","title":"Online Tensor Learning: Computational and Statistical Trade-offs, Adaptivity and Optimal Regret","created":"2023-06-06","cited_by_count":4,"area":null},{"id":"2502.00463","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","created":"2025-02-01","cited_by_count":4,"area":null},{"id":"2102.00937","title":"Riemannian Perspective on Matrix Factorization","created":"2021-02-01","cited_by_count":3,"area":null},{"id":"2102.02396","title":"Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent","created":"2021-02-04","cited_by_count":3,"area":null},{"id":"2307.13818","title":"Gradient-Based Spectral Embeddings of Random Dot Product Graphs","created":"2023-07-25","cited_by_count":3,"area":null},{"id":"2505.22602","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","created":"2025-05-28","cited_by_count":3,"area":null},{"id":"2604.21905","title":"Low-Rank Adaptation Redux for Large Models","created":"2026-04-23","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":"2112.11760","title":"On Asymptotic Linear Convergence of Projected Gradient Descent for Constrained Least Squares","created":"2021-12-22","cited_by_count":2,"area":null},{"id":"2205.13827","title":"Error Bound of Empirical $\\ell_2$ Risk Minimization for Noisy Standard and Generalized Phase Retrieval Problems","created":"2022-05-27","cited_by_count":2,"area":null},{"id":"2106.09211","title":"Square Root Principal Component Pursuit: Tuning-Free Noisy Robust Matrix Recovery","created":"2021-06-17","cited_by_count":1,"area":null},{"id":"2205.07999","title":"An Exponentially Increasing Step-size for Parameter Estimation in Statistical Models","created":"2022-05-16","cited_by_count":1,"area":null},{"id":"2302.02096","title":"Matrix Estimation for Individual Fairness","created":"2023-02-04","cited_by_count":1,"area":null},{"id":"2303.11453","title":"Greedy Pruning with Group Lasso Provably Generalizes for Matrix Sensing","created":"2023-03-20","cited_by_count":1,"area":null},{"id":"2306.04775","title":"Exploiting Observation Bias to Improve Matrix Completion","created":"2023-06-07","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":"2501.07237","title":"GWT: Scalable Optimizer State Compression for Large Language Model Training","created":"2025-01-13","cited_by_count":1,"area":null},{"id":"2502.20033","title":"Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization","created":"2025-02-27","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":"2111.06302","title":"On Recovering the Best Rank-r Approximation from Few Entries","created":"2021-11-11","cited_by_count":0,"area":null},{"id":"2202.04020","title":"Local Linear Convergence of Gradient Methods for Subspace Optimization via Strict Complementarity","created":"2022-02-08","cited_by_count":0,"area":null},{"id":"2208.09449","title":"A Novel Plug-and-Play Approach for Adversarially Robust Generalization","created":"2022-08-19","cited_by_count":0,"area":null},{"id":"2306.16557","title":"Non-Convex Optimizations for Machine Learning with Theoretical Guarantee: Robust Matrix Completion and Neural Network Learning","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2403.15999","title":"Near-Optimal differentially private low-rank trace regression with guaranteed private initialization","created":"2024-03-24","cited_by_count":0,"area":null},{"id":"2407.13731","title":"Predictive Low Rank Matrix Learning under Partial Observations: Mixed-Projection ADMM","created":"2024-07-18","cited_by_count":0,"area":null},{"id":"2502.08536","title":"Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach","created":"2025-02-12","cited_by_count":0,"area":null},{"id":"2508.09685","title":"Global Convergence Analysis of Vanilla Gradient Descent for Asymmetric Matrix Completion","created":"2025-08-13","cited_by_count":0,"area":null},{"id":"2605.05446","title":"Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation","created":"2026-05-06","cited_by_count":0,"area":null},{"id":"2605.26271","title":"Learning Nonlinear Factor Models with Unknown Monotone Links from Incomplete and Noisy Data","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2605.28269","title":"Dynamic Topic Modeling with a Higher-Order Hypergraphical Representation","created":"2026-05-27","cited_by_count":0,"area":null}],"next_cursor":null}