{"total":17,"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":"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":"2310.17137","title":"Large-Scale Gaussian Processes via Alternating Projection","created":"2023-10-26","cited_by_count":11,"area":null},{"id":"2406.17296","title":"BlockLLM: Memory-Efficient Adaptation of LLMs by Selecting and Optimizing the Right Coordinate Blocks","created":"2024-06-25","cited_by_count":9,"area":null},{"id":"2206.00128","title":"ForestPrune: Compact Depth-Controlled Tree Ensembles","created":"2022-05-31","cited_by_count":7,"area":null},{"id":"2602.15322","title":"On Surprising Effectiveness of Masking Updates in Adaptive Optimizers","created":"2026-02-17","cited_by_count":7,"area":null},{"id":"2510.00823","title":"Non-Euclidean Broximal Point Method: A Blueprint for Geometry-Aware Optimization","created":"2025-10-01","cited_by_count":4,"area":null},{"id":"2311.17539","title":"Critical Influence of Overparameterization on Sharpness-aware Minimization","created":"2023-11-29","cited_by_count":3,"area":null},{"id":"2204.04762","title":"Rockafellian Relaxation and Stochastic Optimization under Perturbations","created":"2022-04-10","cited_by_count":2,"area":null},{"id":"2307.01169","title":"Analyzing and Improving Greedy 2-Coordinate Updates for Equality-Constrained Optimization via Steepest Descent in the 1-Norm","created":"2023-07-03","cited_by_count":2,"area":null},{"id":"2504.01431","title":"Multi-convex Programming for Discrete Latent Factor Models Prototyping","created":"2025-04-02","cited_by_count":1,"area":null},{"id":"2301.12184","title":"Laplacian-based Semi-Supervised Learning in Multilayer Hypergraphs by Coordinate Descent","created":"2023-01-28","cited_by_count":0,"area":null},{"id":"2304.01432","title":"Reducing Discretization Error in the Frank-Wolfe Method","created":"2023-04-04","cited_by_count":0,"area":null},{"id":"2402.12630","title":"FAST: An Optimization Framework for Fast Additive Segmentation in Transparent ML","created":"2024-02-20","cited_by_count":0,"area":null},{"id":"2411.06295","title":"Analyzing the Evolution of Graphs and Texts","created":"2024-11-09","cited_by_count":0,"area":null},{"id":"2601.21467","title":"A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation","created":"2026-01-29","cited_by_count":0,"area":null},{"id":"2610.13382","title":"BLOKS: Scaling Kernel Solvers with Sketched Block Preconditioning","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}