{"total":22,"rows":[{"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":"2302.08300","title":"Deterministic Nonsmooth Nonconvex Optimization","created":"2023-02-16","cited_by_count":26,"area":null},{"id":"2302.01970","title":"Efficient Gradient Approximation Method for Constrained Bilevel Optimization","created":"2023-02-03","cited_by_count":15,"area":null},{"id":"2112.15348","title":"Training Recurrent Neural Networks by Sequential Least Squares and the Alternating Direction Method of Multipliers","created":"2021-12-31","cited_by_count":8,"area":null},{"id":"2403.03827","title":"An L-BFGS-B approach for linear and nonlinear system identification under $\\ell_1$ and group-Lasso regularization","created":"2024-03-06","cited_by_count":8,"area":null},{"id":"2210.11577","title":"Global Convergence of Direct Policy Search for State-Feedback $\\mathcal{H}_\\infty$ Robust Control: A Revisit of Nonsmooth Synthesis with Goldstein Subdifferential","created":"2022-10-20","cited_by_count":7,"area":null},{"id":"2310.03585","title":"Smoothing Methods for Automatic Differentiation Across Conditional Branches","created":"2023-10-05","cited_by_count":7,"area":null},{"id":"2210.04810","title":"Towards a Theoretical Foundation of Policy Optimization for Learning Control Policies","created":"2022-10-10","cited_by_count":6,"area":null},{"id":"2303.13401","title":"Optimization and Optimizers for Adversarial Robustness","created":"2023-03-23","cited_by_count":6,"area":null},{"id":"2111.15537","title":"Model-Free $\\mu$ Synthesis via Adversarial Reinforcement Learning","created":"2021-11-30","cited_by_count":5,"area":null},{"id":"2406.07100","title":"D-GRIL: End-to-End Topological Learning with 2-parameter Persistence","created":"2024-06-11","cited_by_count":5,"area":null},{"id":"2111.15645","title":"Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization","created":"2021-11-30","cited_by_count":4,"area":null},{"id":"2210.00621","title":"Optimization for Robustness Evaluation beyond $\\ell_p$ Metrics","created":"2022-10-02","cited_by_count":3,"area":null},{"id":"2310.17042","title":"Stochastic Gradient Sampling for Enhancing Neural Networks Training","created":"2023-10-25","cited_by_count":3,"area":null},{"id":"2407.18707","title":"Finite Neural Networks as Mixtures of Gaussian Processes: From Provable Error Bounds to Prior Selection","created":"2024-07-26","cited_by_count":3,"area":null},{"id":"2605.24477","title":"The Normalized Maximum Likelihood for Regular Non-Smooth Models: Measure-Theoretic Foundations and Geometric Sampling","created":"2026-05-23","cited_by_count":1,"area":null},{"id":"2112.06134","title":"Markov subsampling based Huber Criterion","created":"2021-12-12","cited_by_count":0,"area":null},{"id":"2402.11654","title":"Model-Free $\\mu$-Synthesis: A Nonsmooth Optimization Perspective","created":"2024-02-18","cited_by_count":0,"area":null},{"id":"2411.04946","title":"SPGD: Steepest Perturbed Gradient Descent Optimization","created":"2024-11-07","cited_by_count":0,"area":null},{"id":"2505.11752","title":"Permutation Randomization on Nonsmooth Nonconvex Optimization: A Theoretical and Experimental Study","created":"2025-05-16","cited_by_count":0,"area":null},{"id":"2607.20411","title":"Lipschitzian SLLNs for random functions","created":"2026-07-22","cited_by_count":0,"area":null},{"id":"2609.23837","title":"The Exponential Price of Determinism in Nonsmooth Nonconvex Optimization","created":"2026-09-20","cited_by_count":0,"area":null}],"next_cursor":null}