{"total":31,"rows":[{"id":"2104.05097","title":"Pay attention to your loss: understanding misconceptions about 1-Lipschitz neural networks","created":"2021-04-11","cited_by_count":30,"area":null},{"id":"2506.03133","title":"PoLAR: Polar-Decomposed Low-Rank Adapter Representation","created":"2025-06-03","cited_by_count":20,"area":null},{"id":"2303.16510","title":"Infeasible Deterministic, Stochastic, and Variance-Reduction Algorithms for Optimization under Orthogonality Constraints","created":"2023-03-29","cited_by_count":18,"area":null},{"id":"2302.04817","title":"The Edge of Orthogonality: A Simple View of What Makes BYOL Tick","created":"2023-02-09","cited_by_count":15,"area":null},{"id":"2306.09739","title":"Stabilized Neural Differential Equations for Learning Dynamics with Explicit Constraints","created":"2023-06-16","cited_by_count":15,"area":null},{"id":"2303.09261","title":"Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold","created":"2023-03-16","cited_by_count":14,"area":null},{"id":"2306.01485","title":"Robust low-rank training via approximate orthonormal constraints","created":"2023-06-02","cited_by_count":13,"area":null},{"id":"2305.19059","title":"Geometry-aware training of factorized layers in tensor Tucker format","created":"2023-05-30","cited_by_count":12,"area":null},{"id":"2205.14173","title":"Momentum Stiefel Optimizer, with Applications to Suitably-Orthogonal Attention, and Optimal Transport","created":"2022-05-27","cited_by_count":11,"area":null},{"id":"2404.17947","title":"Bounding the Expected Robustness of Graph Neural Networks Subject to Node Feature Attacks","created":"2024-04-27","cited_by_count":9,"area":null},{"id":"2405.01702","title":"Optimization without Retraction on the Random Generalized Stiefel Manifold","created":"2024-05-02","cited_by_count":7,"area":null},{"id":"2512.17090","title":"How to Square Tensor Networks and Circuits Without Squaring Them","created":"2025-12-18","cited_by_count":5,"area":null},{"id":"2406.02225","title":"Riemannian coordinate descent algorithms on matrix manifolds","created":"2024-06-04","cited_by_count":4,"area":null},{"id":"2510.21033","title":"Iso-Riemannian Optimization on Learned Data Manifolds","created":"2025-10-23","cited_by_count":4,"area":null},{"id":"2505.12378","title":"Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method","created":"2025-05-18","cited_by_count":3,"area":null},{"id":"2602.14656","title":"An Embarrassingly Simple Way to Optimize Orthogonal Matrices at Scale","created":"2026-02-16","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":"2304.03641","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","created":"2023-04-07","cited_by_count":2,"area":null},{"id":"2601.18513","title":"LipNeXt: Scaling up Lipschitz-based Certified Robustness to Billion-parameter Models","created":"2026-01-26","cited_by_count":2,"area":null},{"id":"2604.03388","title":"Scalable Variational Bayesian Fine-Tuning of LLMs via Orthogonalized Low-Rank Adapters","created":"2026-04-03","cited_by_count":2,"area":null},{"id":"2401.05967","title":"Block-Diagonal Orthogonal Relation and Matrix Entity for Knowledge Graph Embedding","created":"2024-01-11","cited_by_count":1,"area":null},{"id":"2408.08408","title":"Oja's plasticity rule overcomes several challenges of training neural networks under biological constraints","created":"2024-08-15","cited_by_count":1,"area":null},{"id":"2506.07351","title":"Decentralized Optimization on Compact Submanifolds by Quantized Riemannian Gradient Tracking","created":"2025-06-09","cited_by_count":1,"area":null},{"id":"2510.25594","title":"Feedback Alignment Meets Low-Rank Manifolds: A Structured Recipe for Local Learning","created":"2025-10-29","cited_by_count":1,"area":null},{"id":"2604.04130","title":"Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints","created":"2026-04-05","cited_by_count":1,"area":null},{"id":"2305.09046","title":"Convex optimization over a probability simplex","created":"2023-05-15","cited_by_count":0,"area":null},{"id":"2405.03073","title":"Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms","created":"2024-05-05","cited_by_count":0,"area":null},{"id":"2511.22828","title":"Fast dynamical similarity analysis","created":"2025-11-28","cited_by_count":0,"area":null},{"id":"2605.02838","title":"A second-order method landing on the Stiefel manifold via Newton$\\unicode{x2013}$Schulz iteration","created":"2026-05-04","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":"2607.25299","title":"Retraction-Free Optimization over the Stiefel Manifold for the LoRA Fine-Tuning","created":"2026-07-28","cited_by_count":0,"area":null}],"next_cursor":null}