{"total":59,"rows":[{"id":"2302.05185","title":"On Penalty-based Bilevel Gradient Descent Method","created":"2023-02-10","cited_by_count":87,"area":null},{"id":"2112.05604","title":"Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity","created":"2021-12-10","cited_by_count":49,"area":null},{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"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":"2104.06763","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","created":"2021-04-14","cited_by_count":39,"area":null},{"id":"2203.04850","title":"Federated Minimax Optimization: Improved Convergence Analyses and Algorithms","created":"2022-03-09","cited_by_count":37,"area":null},{"id":"2112.15311","title":"Bayesian Optimization of Function Networks","created":"2021-12-31","cited_by_count":33,"area":null},{"id":"2203.00176","title":"When AUC meets DRO: Optimizing Partial AUC for Deep Learning with Non-Convex Convergence Guarantee","created":"2022-03-01","cited_by_count":29,"area":null},{"id":"2201.00272","title":"Thinking inside the box: A tutorial on grey-box Bayesian optimization","created":"2022-01-02","cited_by_count":26,"area":null},{"id":"2211.16715","title":"Policy Optimization over General State and Action Spaces","created":"2022-11-30","cited_by_count":23,"area":null},{"id":"2508.04860","title":"Can SGD Handle Heavy-Tailed Noise?","created":"2025-08-06","cited_by_count":17,"area":null},{"id":"2203.01505","title":"Large-scale Optimization of Partial AUC in a Range of False Positive Rates","created":"2022-03-03","cited_by_count":15,"area":null},{"id":"2301.04935","title":"A Stochastic Proximal Polyak Step Size","created":"2023-01-12","cited_by_count":15,"area":null},{"id":"2402.01052","title":"Weakly Convex Regularisers for Inverse Problems: Convergence of Critical Points and Primal-Dual Optimisation","created":"2024-02-01","cited_by_count":14,"area":null},{"id":"2209.10825","title":"Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis","created":"2022-09-22","cited_by_count":12,"area":null},{"id":"2301.13314","title":"Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization","created":"2023-01-30","cited_by_count":11,"area":null},{"id":"2402.17722","title":"Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence","created":"2024-02-27","cited_by_count":11,"area":null},{"id":"2106.03034","title":"Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization","created":"2021-06-06","cited_by_count":10,"area":null},{"id":"2310.03234","title":"Non-Smooth Weakly-Convex Finite-sum Coupled Compositional Optimization","created":"2023-10-05","cited_by_count":10,"area":null},{"id":"2403.00329","title":"Learning with Logical Constraints but without Shortcut Satisfaction","created":"2024-03-01","cited_by_count":10,"area":null},{"id":"2501.19214","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","created":"2025-01-31","cited_by_count":9,"area":null},{"id":"2302.04249","title":"Federated Minimax Optimization with Client Heterogeneity","created":"2023-02-08","cited_by_count":8,"area":null},{"id":"2306.16761","title":"Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs","created":"2023-06-29","cited_by_count":8,"area":null},{"id":"2307.14528","title":"Function Value Learning: Adaptive Learning Rates Based on the Polyak Stepsize and Function Splitting in ERM","created":"2023-07-26","cited_by_count":8,"area":null},{"id":"2203.15797","title":"Convergence of First-Order Methods for Constrained Nonconvex Optimization with Dependent Data","created":"2022-03-29","cited_by_count":7,"area":null},{"id":"2208.02204","title":"Efficiently Computing Nash Equilibria in Adversarial Team Markov Games","created":"2022-08-03","cited_by_count":7,"area":null},{"id":"2302.00316","title":"Accelerated First-Order Optimization under Nonlinear Constraints","created":"2023-02-01","cited_by_count":5,"area":null},{"id":"2305.05828","title":"A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties","created":"2023-05-10","cited_by_count":5,"area":null},{"id":"2504.07607","title":"Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints","created":"2025-04-10","cited_by_count":5,"area":null},{"id":"2604.16620","title":"Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance","created":"2026-04-17","cited_by_count":5,"area":null},{"id":"2402.01599","title":"Hyperparameter tuning via trajectory predictions: Stochastic prox-linear methods in matrix sensing","created":"2024-02-02","cited_by_count":4,"area":null},{"id":"2411.15067","title":"Linear convergence of proximal descent schemes on the Wasserstein space","created":"2024-11-22","cited_by_count":4,"area":null},{"id":"2211.05430","title":"Regret Bounds for Noise-Free Cascaded Kernelized Bandits","created":"2022-11-10","cited_by_count":3,"area":null},{"id":"2303.11954","title":"Bayesian Optimization for Function Compositions with Applications to Dynamic Pricing","created":"2023-03-21","cited_by_count":3,"area":null},{"id":"2310.10006","title":"Soft ascent-descent as a stable and flexible alternative to flooding","created":"2023-10-16","cited_by_count":3,"area":null},{"id":"2401.13971","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","created":"2024-01-25","cited_by_count":3,"area":null},{"id":"2507.08956","title":"Beyond Scores: Proximal Diffusion Models","created":"2025-07-11","cited_by_count":3,"area":"diffusion"},{"id":"2205.01457","title":"Efficient algorithms for implementing incremental proximal-point methods","created":"2022-05-03","cited_by_count":2,"area":null},{"id":"2302.12808","title":"Linearization Algorithms for Fully Composite Optimization","created":"2023-02-24","cited_by_count":2,"area":null},{"id":"2303.05037","title":"Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets","created":"2023-03-09","cited_by_count":2,"area":null},{"id":"2311.09065","title":"Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints","created":"2023-11-15","cited_by_count":2,"area":null},{"id":"2607.06883","title":"Finding a stationary point of a stochastic convex problem","created":"2026-07-08","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":"2304.12522","title":"A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase Retrieval","created":"2023-04-25","cited_by_count":1,"area":null},{"id":"2305.10634","title":"Modified Gauss-Newton Algorithms under Noise","created":"2023-05-18","cited_by_count":1,"area":null},{"id":"2410.20153","title":"The inexact power augmented Lagrangian method for constrained nonconvex optimization","created":"2024-10-26","cited_by_count":1,"area":null},{"id":"2605.15530","title":"Rethinking Neural Network Learning Rates: A Stackelberg Perspective","created":"2026-05-15","cited_by_count":1,"area":null},{"id":"2607.08954","title":"Nonconvex Composite Functional Constraints via First-Order Augmented Lagrangian Methods under Local Regularity","created":"2026-07-09","cited_by_count":1,"area":null},{"id":"2609.08064","title":"Risk-Conditioned Fine-Tuning of Large Language Models","created":"2026-09-08","cited_by_count":1,"area":null},{"id":"2106.10759","title":"Robust Regression via Model Based Methods","created":"2021-06-20","cited_by_count":0,"area":null},{"id":"2112.09429","title":"Federated Learning with Superquantile Aggregation for Heterogeneous Data","created":"2021-12-17","cited_by_count":0,"area":null},{"id":"2201.05250","title":"Consistent Approximations in Composite Optimization","created":"2022-01-13","cited_by_count":0,"area":null},{"id":"2201.07657","title":"Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear coupling constraints","created":"2022-01-19","cited_by_count":0,"area":null},{"id":"2308.08886","title":"Dual Gauss-Newton Directions for Deep Learning","created":"2023-08-17","cited_by_count":0,"area":null},{"id":"2411.07496","title":"ADMM for Structured Fractional Minimization","created":"2024-11-12","cited_by_count":0,"area":null},{"id":"2503.02494","title":"Enhancing Distributional Robustness in Principal Component Analysis by Wasserstein Distances","created":"2025-03-04","cited_by_count":0,"area":null},{"id":"2505.07298","title":"Learning-Based Surrogate Method for Stochastic Optimization under Decision-Dependent Uncertainty with Adaptive Random Designs","created":"2025-05-12","cited_by_count":0,"area":null},{"id":"2507.13283","title":"Stochastic Weakly Convex Optimization Under Heavy-Tailed Noises","created":"2025-07-17","cited_by_count":0,"area":null},{"id":"2604.28144","title":"Global Optimality for Constrained Exploration via Penalty Regularization","created":"2026-04-30","cited_by_count":0,"area":"deeprl"}],"next_cursor":null}