{"total":19,"rows":[{"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":"2410.16103","title":"LDAdam: Adaptive Optimization from Low-Dimensional Gradient Statistics","created":"2024-10-21","cited_by_count":38,"area":null},{"id":"2502.01586","title":"SubTrack++ : Gradient Subspace Tracking for Scalable LLM Training","created":"2025-02-03","cited_by_count":16,"area":null},{"id":"2505.01043","title":"Low-Precision Training of Large Language Models: Methods, Challenges, and Opportunities","created":"2025-05-02","cited_by_count":11,"area":null},{"id":"2507.08784","title":"Greedy Low-Rank Gradient Compression for Distributed Learning with Convergence Guarantees","created":"2025-07-11","cited_by_count":11,"area":null},{"id":"2411.07837","title":"FRUGAL: Memory-Efficient Optimization by Reducing State Overhead for Scalable Training","created":"2024-11-12","cited_by_count":10,"area":null},{"id":"2506.01863","title":"Unified Scaling Laws for Compressed Representations","created":"2025-06-02","cited_by_count":5,"area":null},{"id":"2602.23349","title":"FlashOptim: Optimizers for Memory-Efficient Training","created":"2026-02-26","cited_by_count":5,"area":null},{"id":"2507.08091","title":"Low-rank Momentum Factorization for Memory Efficient Training","created":"2025-07-10","cited_by_count":4,"area":null},{"id":"2603.02064","title":"Never Saddle for Reparameterized Steepest Descent as Mirror Flow","created":"2026-03-02","cited_by_count":4,"area":null},{"id":"2503.01843","title":"When Can You Get Away with Low Memory Adam?","created":"2025-03-03","cited_by_count":3,"area":null},{"id":"2506.21374","title":"Pay Attention to Small Weights","created":"2025-06-26","cited_by_count":3,"area":null},{"id":"2411.07120","title":"Lean and Mean Adaptive Optimization via Subset-Norm and Subspace-Momentum with Convergence Guarantees","created":"2024-11-11","cited_by_count":2,"area":null},{"id":"2505.17967","title":"FFT-based Dynamic Subspace Selection for Low-Rank Adaptive Optimization of Large Language Models","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2512.15306","title":"LLMQ: Efficient Lower-Precision Pretraining for Consumer GPUs","created":"2025-12-17","cited_by_count":2,"area":null},{"id":"2606.22932","title":"FORGE: Fused On-Register Gradient Elimination for Memory-Efficient LLM Training","created":"2026-06-22","cited_by_count":2,"area":null},{"id":"2510.01878","title":"Geometrically Principled Randomized Optimization for Efficient LLM Training","created":"2025-10-02","cited_by_count":1,"area":null},{"id":"2604.09406","title":"OASIS: Online Activation Subspace Learning for Memory-Efficient Training","created":"2026-04-10","cited_by_count":1,"area":null},{"id":"2503.13795","title":"BurTorch: Revisiting Training from First Principles by Coupling Autodiff, Math Optimization, and Systems","created":"2025-03-18","cited_by_count":0,"area":null}],"next_cursor":null}