{"total":38,"rows":[{"id":"2412.05270","title":"APOLLO: SGD-like Memory, AdamW-level Performance","created":"2024-12-06","cited_by_count":54,"area":null},{"id":"2506.03595","title":"Purifying Shampoo: Investigating Shampoo's Heuristics by Decomposing its Preconditioner","created":"2025-06-04","cited_by_count":23,"area":null},{"id":"2506.03133","title":"PoLAR: Polar-Decomposed Low-Rank Adapter Representation","created":"2025-06-03","cited_by_count":20,"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":"2504.20437","title":"GaLore 2: Large-Scale LLM Pre-Training by Gradient Low-Rank Projection","created":"2025-04-29","cited_by_count":14,"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":"2512.18248","title":"On the Convergence Rate of LoRA Gradient Descent","created":"2025-12-20","cited_by_count":10,"area":null},{"id":"2509.18993","title":"CR-Net: Scaling Parameter-Efficient Training with Cross-Layer Low-Rank Structure","created":"2025-09-23","cited_by_count":7,"area":null},{"id":"2502.19571","title":"LORENZA: Enhancing Generalization in Low-Rank Gradient LLM Training via Efficient Zeroth-Order Adaptive SAM","created":"2025-02-26","cited_by_count":5,"area":null},{"id":"2505.22922","title":"Scalable Parameter and Memory Efficient Pretraining for LLM: Recent Algorithmic Advances and Benchmarking","created":"2025-05-28","cited_by_count":5,"area":null},{"id":"2506.01863","title":"Unified Scaling Laws for Compressed Representations","created":"2025-06-02","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":"2506.21374","title":"Pay Attention to Small Weights","created":"2025-06-26","cited_by_count":3,"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":"2510.05361","title":"MT-DAO: Multi-Timescale Distributed Adaptive Optimizers with Local Updates","created":"2025-10-06","cited_by_count":2,"area":null},{"id":"2602.03515","title":"Mitigating Staleness in Asynchronous Pipeline Parallelism via Basis Rotation","created":"2026-02-03","cited_by_count":2,"area":null},{"id":"2602.09169","title":"Train Less, Infer Faster: Efficient Model Finetuning and Compression via Structured Sparsity","created":"2026-02-09","cited_by_count":2,"area":null},{"id":"2606.17526","title":"MGUP: A Momentum-Gradient Alignment Update Policy for Stochastic Optimization","created":"2026-06-16","cited_by_count":2,"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":"2506.01897","title":"MLorc: Momentum Low-rank Compression for Memory Efficient Large Language Model Adaptation","created":"2025-06-02","cited_by_count":1,"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":"2512.07112","title":"FOAM: Blocked State Folding for Memory-Efficient LLM Training","created":"2025-12-08","cited_by_count":1,"area":null},{"id":"2602.04396","title":"LoRDO: Distributed Low-Rank Optimization with Infrequent Communication","created":"2026-02-04","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":"2604.25467","title":"Subspace Optimization for Efficient Federated Learning under Heterogeneous Data","created":"2026-04-28","cited_by_count":1,"area":null},{"id":"2512.17109","title":"Bridging Training and Merging Through Momentum-Aware Optimization","created":"2025-12-18","cited_by_count":0,"area":null},{"id":"2602.06208","title":"Emergent Low-Rank Training Dynamics in MLPs with Smooth Activations","created":"2026-02-05","cited_by_count":0,"area":null},{"id":"2605.06166","title":"One Algorithm, Two Goals: Dual Scoring for Parameter and Data Selection in LLM Fine-Tuning","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.10335","title":"PowerStep: Memory-Efficient Adaptive Optimization via $\\ell_p$-Norm Steepest Descent","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2606.00888","title":"Memory-Efficient LLM Training with Dynamic Sparsity: From Stability to Practical Scaling","created":"2026-05-30","cited_by_count":0,"area":null},{"id":"2607.05872","title":"No Subspace to Track: Non-Identifiability and Optimizer State in Low-Rank Training","created":"2026-07-07","cited_by_count":0,"area":null},{"id":"2608.28442","title":"Curvature-Conditioned Multiscale Momentum with Sphere Constraints for LLM Pretraining","created":"2026-08-28","cited_by_count":0,"area":null},{"id":"2608.28557","title":"Blog: Survey of Optimizers","created":"2026-08-28","cited_by_count":0,"area":null},{"id":"2609.15037","title":"MoARa: Module-Aware Rank Allocation and Structure-Preserving Decomposition for Low-Rank LLM Pre-training","created":"2026-09-14","cited_by_count":0,"area":null},{"id":"2610.04204","title":"Clean: Second-order LLM Training at Linear Memory Cost via Nystr{\\\"o}m Sketching","created":"2026-10-03","cited_by_count":0,"area":null},{"id":"2610.04792","title":"Do More Modalities Always Help? A Geometric Perspective on Missing-Modality Robustness","created":"2026-10-03","cited_by_count":0,"area":null},{"id":"2610.19844","title":"Memory-Efficient Subspace Optimization with Residual Correction: From Momentum SGD to Muon","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}