{"total":34,"rows":[{"id":"2201.07443","title":"On the Convergence Rates of Policy Gradient Methods","created":"2022-01-19","cited_by_count":119,"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":"2212.12978","title":"Universal Gradient Descent Ascent Method for Nonconvex-Nonconcave Minimax Optimization","created":"2022-12-26","cited_by_count":12,"area":null},{"id":"2410.12455","title":"Loss Landscape Characterization of Neural Networks without Over-Parametrization","created":"2024-10-16","cited_by_count":8,"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":"2305.08463","title":"Convergence Analysis of Mean Shift","created":"2023-05-15","cited_by_count":6,"area":null},{"id":"2411.18752","title":"Locally Differentially Private Online Federated Learning With Correlated Noise","created":"2024-11-27","cited_by_count":6,"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":"2208.14318","title":"Convergence Rates of Training Deep Neural Networks via Alternating Minimization Methods","created":"2022-08-30","cited_by_count":4,"area":null},{"id":"2312.01047","title":"A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization","created":"2023-12-02","cited_by_count":4,"area":null},{"id":"2410.14054","title":"Adaptive Gradient Normalization and Independent Sampling for (Stochastic) Generalized-Smooth Optimization","created":"2024-10-17","cited_by_count":4,"area":null},{"id":"2105.12271","title":"SG-PALM: a Fast Physically Interpretable Tensor Graphical Model","created":"2021-05-26","cited_by_count":3,"area":null},{"id":"2208.05834","title":"Joint reconstruction-segmentation on graphs","created":"2022-08-11","cited_by_count":2,"area":null},{"id":"2205.08115","title":"Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Data","created":"2022-05-17","cited_by_count":1,"area":null},{"id":"2210.16997","title":"Convergence Rates of Stochastic Zeroth-order Gradient Descent for \\L ojasiewicz Functions","created":"2022-10-31","cited_by_count":1,"area":null},{"id":"2212.05719","title":"Tensor Factorization via Transformed Tensor-Tensor Product for Image Alignment","created":"2022-12-12","cited_by_count":1,"area":null},{"id":"2303.15866","title":"Efficient Alternating Minimization Solvers for Wyner Multi-View Unsupervised Learning","created":"2023-03-28","cited_by_count":1,"area":null},{"id":"2410.18402","title":"Low-Rank Tensor Learning by Generalized Nonconvex Regularization","created":"2024-10-24","cited_by_count":1,"area":null},{"id":"2502.11152","title":"Error Bound Analysis for the Regularized Loss of Deep Linear Neural Networks","created":"2025-02-16","cited_by_count":1,"area":null},{"id":"2507.01932","title":"A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition","created":"2025-07-02","cited_by_count":1,"area":null},{"id":"2603.16042","title":"Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning","created":"2026-03-17","cited_by_count":1,"area":null},{"id":"2109.08850","title":"Coordinate Descent for MCP/SCAD Penalized Least Squares Converges Linearly","created":"2021-09-18","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":"2310.15334","title":"ADMM Algorithms for Residual Network Training: Convergence Analysis and Parallel Implementation","created":"2023-10-23","cited_by_count":0,"area":null},{"id":"2407.17216","title":"Alternating Iteratively Reweighted $\\ell_1$ and Subspace Newton Algorithms for Nonconvex Sparse Optimization","created":"2024-07-24","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":"2505.08262","title":"Super-fast Rates of Convergence for Neural Network Classifiers under the Hard Margin Condition","created":"2025-05-13","cited_by_count":0,"area":null},{"id":"2507.04247","title":"Inertial Quadratic Majorization Minimization with Application to Kernel Regularized Learning","created":"2025-07-06","cited_by_count":0,"area":null},{"id":"2603.00333","title":"Dynamic Proximal Gradient Algorithms for Schatten-$p$ Quasi-Norm Regularized Problems","created":"2026-02-27","cited_by_count":0,"area":null},{"id":"2603.19147","title":"Fast and Effective Computation of Generalized Symmetric Matrix Factorization","created":"2026-03-19","cited_by_count":0,"area":null},{"id":"2605.07448","title":"Robust Tensor Regression with Nonconvexity: Algorithmic and Statistical Theory","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2607.10618","title":"Demixing Sparse Signals from Nonlinear Observations using Generalized Non-convex Regularization","created":"2026-07-12","cited_by_count":0,"area":null},{"id":"2607.20769","title":"Memory-Computation Tradeoffs in Semi Amortized Parametric Optimization","created":"2026-07-22","cited_by_count":0,"area":null},{"id":"2608.05460","title":"A proximal subgradient method for nonconvex stochastic optimization under the Kurdyka-{\\L}ojasiewicz condition","created":"2026-08-05","cited_by_count":0,"area":null}],"next_cursor":null}