{"total":20,"rows":[{"id":"2506.03133","title":"PoLAR: Polar-Decomposed Low-Rank Adapter Representation","created":"2025-06-03","cited_by_count":20,"area":null},{"id":"2307.12551","title":"Continuation Path Learning for Homotopy Optimization","created":"2023-07-24","cited_by_count":12,"area":null},{"id":"2307.03571","title":"Smoothing the Edges: Smooth Optimization for Sparse Regularization using Hadamard Overparametrization","created":"2023-07-07","cited_by_count":11,"area":null},{"id":"2303.03027","title":"Critical Points and Convergence Analysis of Generative Deep Linear Networks Trained with Bures-Wasserstein Loss","created":"2023-03-06","cited_by_count":7,"area":null},{"id":"2302.07828","title":"Over-parametrization via Lifting for Low-rank Matrix Sensing: Conversion of Spurious Solutions to Strict Saddle Points","created":"2023-02-15","cited_by_count":5,"area":null},{"id":"2506.13714","title":"Understanding Learning Invariance in Deep Linear Networks","created":"2025-06-16","cited_by_count":3,"area":null},{"id":"2507.15264","title":"On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem","created":"2025-07-21","cited_by_count":3,"area":null},{"id":"2510.01175","title":"On the Benefits of Weight Normalization for Overparameterized Matrix Sensing","created":"2025-10-01","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":"2501.13830","title":"A space-decoupling framework for optimization on bounded-rank matrices with orthogonally invariant constraints","created":"2025-01-23","cited_by_count":2,"area":null},{"id":"2509.21675","title":"Scalable Second-order Riemannian Optimization for $K$-means Clustering","created":"2025-09-25","cited_by_count":2,"area":null},{"id":"2310.15549","title":"Algorithmic Regularization in Tensor Optimization: Towards a Lifted Approach in Matrix Sensing","created":"2023-10-24","cited_by_count":1,"area":null},{"id":"2410.05022","title":"On subdifferential chain rule of matrix factorization and beyond","created":"2024-10-07","cited_by_count":0,"area":null},{"id":"2506.08428","title":"Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings","created":"2025-06-10","cited_by_count":0,"area":null},{"id":"2605.22736","title":"Optimization over the intersection of manifolds","created":"2026-05-21","cited_by_count":0,"area":null},{"id":"2605.26373","title":"Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.04327","title":"A Geometric Characterization of the Stationary Plateau for Two-Layer Neural Networks","created":"2026-06-03","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},{"id":"2608.02576","title":"Smooth Reparameterizations of Functions on Simplicial Product Spaces: Applications to Probabilistic Tensor Decomposition and Functional Data Registration","created":"2026-08-03","cited_by_count":0,"area":null},{"id":"2610.05874","title":"Global Communication or Graph-Specific Memory?","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}