{"total":20,"rows":[{"id":"2404.02827","title":"BAdam: A Memory Efficient Full Parameter Optimization Method for Large Language Models","created":"2024-04-03","cited_by_count":27,"area":null},{"id":"2201.01965","title":"Efficient Global Optimization of Two-Layer ReLU Networks: Quadratic-Time Algorithms and Adversarial Training","created":"2022-01-06","cited_by_count":15,"area":null},{"id":"2407.20999","title":"MoFO: Momentum-Filtered Optimizer for Mitigating Forgetting in LLM Fine-Tuning","created":"2024-07-30","cited_by_count":14,"area":null},{"id":"2201.05756","title":"Block Policy Mirror Descent","created":"2022-01-15","cited_by_count":11,"area":null},{"id":"2406.07292","title":"Convergence rate of random scan Coordinate Ascent Variational Inference under log-concavity","created":"2024-06-11","cited_by_count":9,"area":null},{"id":"2105.11818","title":"SGD with Coordinate Sampling: Theory and Practice","created":"2021-05-25","cited_by_count":4,"area":null},{"id":"2108.07414","title":"Stability and Generalization for Randomized Coordinate Descent","created":"2021-08-17","cited_by_count":4,"area":null},{"id":"2501.15941","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","created":"2025-01-27","cited_by_count":4,"area":null},{"id":"2109.04228","title":"Coordinate Descent Methods for DC Minimization: Optimality Conditions and Global Convergence","created":"2021-09-09","cited_by_count":2,"area":null},{"id":"2201.12691","title":"Coordinate Descent Methods for Fractional Minimization","created":"2022-01-30","cited_by_count":2,"area":null},{"id":"2303.16241","title":"Convergence of the Stochastic Heavy Ball Method With Approximate Gradients and/or Block Updating","created":"2023-03-28","cited_by_count":2,"area":null},{"id":"2305.10294","title":"DualFL: A Duality-based Federated Learning Algorithm with Communication Acceleration in the General Convex Regime","created":"2023-05-17","cited_by_count":2,"area":null},{"id":"2206.14981","title":"Randomized Coordinate Subgradient Method for Nonsmooth Composite Optimization","created":"2022-06-30","cited_by_count":1,"area":null},{"id":"2301.12065","title":"Decentralized Entropic Optimal Transport for Distributed Distribution Comparison","created":"2023-01-28","cited_by_count":1,"area":null},{"id":"2209.05372","title":"Convergence of Batch Updating Methods with Approximate Gradients and/or Noisy Measurements: Theory and Computational Results","created":"2022-09-12","cited_by_count":0,"area":null},{"id":"2404.03101","title":"MARL-LNS: Cooperative Multi-agent Reinforcement Learning via Large Neighborhoods Search","created":"2024-04-03","cited_by_count":0,"area":null},{"id":"2503.01530","title":"Stability-based Generalization Analysis of Randomized Coordinate Descent for Pairwise Learning","created":"2025-03-03","cited_by_count":0,"area":null},{"id":"2605.00740","title":"Randomized Subspace Nesterov Accelerated Gradient","created":"2026-05-01","cited_by_count":0,"area":null},{"id":"2605.14373","title":"Turning Stale Gradients into Stable Gradients: Coherent Coordinate Descent with Implicit Landscape Smoothing for Lightweight Zeroth-Order Optimization","created":"2026-05-14","cited_by_count":0,"area":null},{"id":"2606.03209","title":"DECA: Decentralizing Block-Wise Adam for Efficient LLM Full-Parameter Fine-Tuning on Non-IID Data","created":"2026-06-02","cited_by_count":0,"area":null}],"next_cursor":null}