{"total":31,"rows":[{"id":"2111.14580","title":"Amortized Implicit Differentiation for Stochastic Bilevel Optimization","created":"2021-11-29","cited_by_count":63,"area":null},{"id":"2405.18199","title":"Adam with model exponential moving average is effective for nonconvex optimization","created":"2024-05-28","cited_by_count":23,"area":null},{"id":"2110.15412","title":"Stochastic Mirror Descent: Convergence Analysis and Adaptive Variants via the Mirror Stochastic Polyak Stepsize","created":"2021-10-28","cited_by_count":22,"area":null},{"id":"2206.10713","title":"Beyond Uniform Lipschitz Condition in Differentially Private Optimization","created":"2022-06-21","cited_by_count":19,"area":null},{"id":"2411.07061","title":"General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization","created":"2024-11-11","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":"2406.04142","title":"Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance","created":"2024-06-06","cited_by_count":13,"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":"2505.20219","title":"New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results","created":"2025-05-26","cited_by_count":6,"area":null},{"id":"2309.03094","title":"Smoothing ADMM for Sparse-Penalized Quantile Regression with Non-Convex Penalties","created":"2023-09-04","cited_by_count":4,"area":null},{"id":"2310.05812","title":"Provably Convergent Data-Driven Convex-Nonconvex Regularization","created":"2023-10-09","cited_by_count":4,"area":null},{"id":"2305.15136","title":"ReSync: Riemannian Subgradient-based Robust Rotation Synchronization","created":"2023-05-24","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":"2407.07829","title":"Disentangled Representation Learning with the Gromov-Monge Gap","created":"2024-07-10","cited_by_count":3,"area":null},{"id":"2509.19455","title":"Anchored Langevin Algorithms","created":"2025-09-23","cited_by_count":3,"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":"2308.16362","title":"A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions","created":"2023-08-30","cited_by_count":2,"area":null},{"id":"2512.02342","title":"Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients","created":"2025-12-02","cited_by_count":2,"area":null},{"id":"2605.26977","title":"Convergence of Spectral Descent for Non-smooth Optimization","created":"2026-05-26","cited_by_count":2,"area":null},{"id":"2111.05530","title":"Nearly Optimal Linear Convergence of Stochastic Primal-Dual Methods for Linear Programming","created":"2021-11-10","cited_by_count":1,"area":null},{"id":"2303.17779","title":"Decentralized Weakly Convex Optimization Over the Stiefel Manifold","created":"2023-03-31","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":"2606.01827","title":"Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler","created":"2026-06-01","cited_by_count":1,"area":null},{"id":"2108.04482","title":"Complexity of Inexact Proximal Point Algorithm for minimizing convex functions with Holderian Growth","created":"2021-08-10","cited_by_count":0,"area":null},{"id":"2303.16822","title":"An inexact LPA for DC composite optimization and application to matrix completions with outliers","created":"2023-03-29","cited_by_count":0,"area":null},{"id":"2404.03250","title":"Multi-task learning via robust regularized clustering with non-convex group penalties","created":"2024-04-04","cited_by_count":0,"area":null},{"id":"2409.01570","title":"Smoothed Robust Phase Retrieval","created":"2024-09-03","cited_by_count":0,"area":null},{"id":"2410.05025","title":"$\\ell_1$-norm rank-one symmetric matrix factorization has no spurious second-order stationary points","created":"2024-10-07","cited_by_count":0,"area":null},{"id":"2503.08869","title":"Smoothing ADMM for Non-convex and Non-smooth Hierarchical Federated Learning","created":"2025-03-11","cited_by_count":0,"area":null},{"id":"2510.11910","title":"Simplifying Optimal Transport through Schatten-$p$ Regularization","created":"2025-10-13","cited_by_count":0,"area":null}],"next_cursor":null}