{"total":37,"rows":[{"id":"2402.11592","title":"Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmark","created":"2024-02-18","cited_by_count":114,"area":null},{"id":"2209.05045","title":"Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","created":"2022-09-12","cited_by_count":43,"area":null},{"id":"2107.12301","title":"Enhanced Bilevel Optimization via Bregman Distance","created":"2021-07-26","cited_by_count":28,"area":null},{"id":"2303.00565","title":"AdaSAM: Boosting Sharpness-Aware Minimization with Adaptive Learning Rate and Momentum for Training Deep Neural Networks","created":"2023-03-01","cited_by_count":21,"area":null},{"id":"2212.09513","title":"Stochastic Inexact Augmented Lagrangian Method for Nonconvex Expectation Constrained Optimization","created":"2022-12-19","cited_by_count":19,"area":null},{"id":"2301.06428","title":"Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization","created":"2023-01-16","cited_by_count":17,"area":null},{"id":"2408.11974","title":"Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization","created":"2024-08-21","cited_by_count":16,"area":null},{"id":"2106.16101","title":"AdaGDA: Faster Adaptive Gradient Descent Ascent Methods for Minimax Optimization","created":"2021-06-30","cited_by_count":13,"area":null},{"id":"2310.03613","title":"Solving a Class of Non-Convex Minimax Optimization in Federated Learning","created":"2023-10-05","cited_by_count":10,"area":null},{"id":"2506.04430","title":"Leveraging Coordinate Momentum in SignSGD and Muon: Memory-Optimized Zero-Order","created":"2025-06-04","cited_by_count":9,"area":null},{"id":"2301.02060","title":"A first-order augmented Lagrangian method for constrained minimax optimization","created":"2023-01-05","cited_by_count":8,"area":null},{"id":"2108.00473","title":"Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems","created":"2021-08-01","cited_by_count":7,"area":null},{"id":"2303.03984","title":"Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization","created":"2023-03-07","cited_by_count":6,"area":null},{"id":"2304.02441","title":"Decentralized gradient descent maximization method for composite nonconvex strongly-concave minimax problems","created":"2023-04-05","cited_by_count":6,"area":null},{"id":"2110.07098","title":"A Cubic Regularization Approach for Finding Local Minimax Points in Nonconvex Minimax Optimization","created":"2021-10-14","cited_by_count":5,"area":null},{"id":"2210.03967","title":"Asymptotically Unbiased Instance-wise Regularized Partial AUC Optimization: Theory and Algorithm","created":"2022-10-08","cited_by_count":5,"area":null},{"id":"2211.07303","title":"Adaptive Federated Minimax Optimization with Lower Complexities","created":"2022-11-14","cited_by_count":5,"area":null},{"id":"2307.15868","title":"Faster Stochastic Algorithms for Minimax Optimization under Polyak--{\\L}ojasiewicz Conditions","created":"2023-07-29","cited_by_count":5,"area":null},{"id":"2501.04287","title":"ElasticZO: A Memory-Efficient On-Device Learning with Combined Zeroth- and First-Order Optimization","created":"2025-01-08","cited_by_count":5,"area":null},{"id":"2504.07388","title":"Min-Max Optimisation for Nonconvex-Nonconcave Functions Using a Random Zeroth-Order Extragradient Algorithm","created":"2025-04-10","cited_by_count":5,"area":null},{"id":"2112.11663","title":"Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine Learning","created":"2021-12-22","cited_by_count":4,"area":null},{"id":"2304.10902","title":"Near-Optimal Decentralized Momentum Method for Nonconvex-PL Minimax Problems","created":"2023-04-21","cited_by_count":4,"area":null},{"id":"2403.09090","title":"Dissipative Gradient Descent Ascent Method: A Control Theory Inspired Algorithm for Min-max Optimization","created":"2024-03-14","cited_by_count":4,"area":null},{"id":"2111.13162","title":"Randomized Stochastic Gradient Descent Ascent","created":"2021-11-25","cited_by_count":3,"area":null},{"id":"2407.03571","title":"A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems","created":"2024-07-04","cited_by_count":3,"area":null},{"id":"2505.02281","title":"Minimisation of Quasar-Convex Functions Using Random Zeroth-Order Oracles","created":"2025-05-04","cited_by_count":3,"area":null},{"id":"2307.07113","title":"Variance-reduced accelerated methods for decentralized stochastic double-regularized nonconvex strongly-concave minimax problems","created":"2023-07-14","cited_by_count":2,"area":null},{"id":"2402.09807","title":"Two trust region type algorithms for solving nonconvex-strongly concave minimax problems","created":"2024-02-15","cited_by_count":2,"area":null},{"id":"2310.15448","title":"An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems","created":"2023-10-24","cited_by_count":1,"area":null},{"id":"2404.12312","title":"A Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization","created":"2024-04-18","cited_by_count":1,"area":null},{"id":"2409.00459","title":"Gradient-Free Method for Heavily Constrained Nonconvex Optimization","created":"2024-08-31","cited_by_count":1,"area":null},{"id":"2609.21747","title":"Single-Loop Stochastic Projected Damped Extragradient Methods for Nonconvex--(Strongly) Concave Minimax Optimization","created":"2026-09-18","cited_by_count":1,"area":null},{"id":"2211.11710","title":"Adaptive Stochastic Optimisation of Nonconvex Composite Objectives","created":"2022-11-21","cited_by_count":0,"area":null},{"id":"2307.13430","title":"Achieving Linear Speedup in Decentralized Stochastic Compositional Minimax Optimization","created":"2023-07-25","cited_by_count":0,"area":null},{"id":"2406.17386","title":"Double Momentum Method for Lower-Level Constrained Bilevel Optimization","created":"2024-06-25","cited_by_count":0,"area":null},{"id":"2411.15769","title":"Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems","created":"2024-11-24","cited_by_count":0,"area":null},{"id":"2512.01213","title":"Closing the Approximation Gap of Partial AUC Optimization: A Tale of Two Formulations","created":"2025-12-01","cited_by_count":0,"area":null}],"next_cursor":null}