{"total":60,"rows":[{"id":"2302.05185","title":"On Penalty-based Bilevel Gradient Descent Method","created":"2023-02-10","cited_by_count":87,"area":null},{"id":"2102.06933","title":"Revisiting Smoothed Online Learning","created":"2021-02-13","cited_by_count":29,"area":null},{"id":"2306.02601","title":"Aiming towards the minimizers: fast convergence of SGD for overparametrized problems","created":"2023-06-05","cited_by_count":22,"area":null},{"id":"2202.03397","title":"Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-start","created":"2022-02-07","cited_by_count":17,"area":null},{"id":"2206.08868","title":"A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem","created":"2022-06-17","cited_by_count":17,"area":null},{"id":"2301.04935","title":"A Stochastic Proximal Polyak Step Size","created":"2023-01-12","cited_by_count":15,"area":null},{"id":"2206.03907","title":"A Unified Convergence Theorem for Stochastic Optimization Methods","created":"2022-06-08","cited_by_count":12,"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":"2405.16601","title":"A CMDP-within-online framework for Meta-Safe Reinforcement Learning","created":"2024-05-26","cited_by_count":12,"area":"deeprl"},{"id":"2106.02720","title":"An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning","created":"2021-06-04","cited_by_count":10,"area":null},{"id":"2101.11041","title":"Complementary Composite Minimization, Small Gradients in General Norms, and Applications","created":"2021-01-26","cited_by_count":9,"area":null},{"id":"2301.03113","title":"Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems","created":"2023-01-08","cited_by_count":9,"area":null},{"id":"2412.01773","title":"FERERO: A Flexible Framework for Preference-Guided Multi-Objective Learning","created":"2024-12-02","cited_by_count":9,"area":null},{"id":"2101.09346","title":"On the Local Linear Rate of Consensus on the Stiefel Manifold","created":"2021-01-22","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":"2306.11922","title":"No Wrong Turns: The Simple Geometry Of Neural Networks Optimization Paths","created":"2023-06-20","cited_by_count":7,"area":null},{"id":"2406.10148","title":"A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled Constraints","created":"2024-06-14","cited_by_count":7,"area":null},{"id":"2510.26389","title":"Adaptive Context Length Optimization with Low-Frequency Truncation for Multi-Agent Reinforcement Learning","created":"2025-10-30","cited_by_count":7,"area":null},{"id":"2212.01314","title":"On Solution Functions of Optimization: Universal Approximation and Covering Number Bounds","created":"2022-12-02","cited_by_count":6,"area":null},{"id":"2302.07851","title":"Continuized Acceleration for Quasar Convex Functions in Non-Convex Optimization","created":"2023-02-15","cited_by_count":6,"area":null},{"id":"2309.04522","title":"Connecting NTK and NNGP: A Unified Theoretical Framework for Wide Neural Network Learning Dynamics","created":"2023-09-08","cited_by_count":6,"area":null},{"id":"2204.00406","title":"A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction","created":"2022-04-01","cited_by_count":5,"area":null},{"id":"2209.00771","title":"Optimizing the Performative Risk under Weak Convexity Assumptions","created":"2022-09-02","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":"2301.03125","title":"Sharper Analysis for Minibatch Stochastic Proximal Point Methods: Stability, Smoothness, and Deviation","created":"2023-01-09","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":"2402.08097","title":"An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization","created":"2024-02-12","cited_by_count":4,"area":null},{"id":"2202.04026","title":"Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems","created":"2022-02-08","cited_by_count":3,"area":null},{"id":"2308.09310","title":"Variance reduction techniques for stochastic proximal point algorithms","created":"2023-08-18","cited_by_count":3,"area":null},{"id":"2309.09411","title":"Distributionally Time-Varying Online Stochastic Optimization under Polyak-{\\L}ojasiewicz Condition with Application in Conditional Value-at-Risk Statistical Learning","created":"2023-09-18","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":"2301.11687","title":"Theoretical Analysis of Offline Imitation With Supplementary Dataset","created":"2023-01-27","cited_by_count":2,"area":"offlinerl"},{"id":"2302.12808","title":"Linearization Algorithms for Fully Composite Optimization","created":"2023-02-24","cited_by_count":2,"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":"2105.13271","title":"OpReg-Boost: Learning to Accelerate Online Algorithms with Operator Regression","created":"2021-05-27","cited_by_count":1,"area":null},{"id":"2212.09413","title":"Gradient Descent-Type Methods: Background and Simple Unified Convergence Analysis","created":"2022-12-19","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":"2602.13510","title":"Stochastic variance reduced extragradient methods for solving hierarchical variational inequalities","created":"2026-02-13","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":"2201.05250","title":"Consistent Approximations in Composite Optimization","created":"2022-01-13","cited_by_count":0,"area":null},{"id":"2202.04020","title":"Local Linear Convergence of Gradient Methods for Subspace Optimization via Strict Complementarity","created":"2022-02-08","cited_by_count":0,"area":null},{"id":"2206.11523","title":"Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems","created":"2022-06-23","cited_by_count":0,"area":null},{"id":"2212.04672","title":"Iterative Minimax Games with Coupled Linear Constraints","created":"2022-12-09","cited_by_count":0,"area":null},{"id":"2306.04756","title":"A Linearly Convergent GAN Inversion-based Algorithm for Reverse Engineering of Deceptions","created":"2023-06-07","cited_by_count":0,"area":null},{"id":"2405.00914","title":"Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization","created":"2024-05-01","cited_by_count":0,"area":null},{"id":"2501.11127","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","created":"2025-01-19","cited_by_count":0,"area":null},{"id":"2503.01441","title":"A Randomized Linearly Convergent Frank-Wolfe-type Method for Smooth Convex Minimization over the Spectrahedron","created":"2025-03-03","cited_by_count":0,"area":null},{"id":"2503.13921","title":"Learning Over Dirty Data with Minimal Repairs","created":"2025-03-18","cited_by_count":0,"area":null},{"id":"2506.08428","title":"Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings","created":"2025-06-10","cited_by_count":0,"area":null},{"id":"2507.19465","title":"Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Regions","created":"2025-07-25","cited_by_count":0,"area":null},{"id":"2509.13955","title":"Asymptotic Analysis of Nonlinear One-Bit Precoding in Massive MIMO Systems via Approximate Message Passing","created":"2025-09-17","cited_by_count":0,"area":null},{"id":"2510.13134","title":"Convergence, design and training of continuous-time dropout as a random batch method","created":"2025-10-15","cited_by_count":0,"area":null},{"id":"2512.01228","title":"On the Tension Between Optimality and Adversarial Robustness in Policy Optimization","created":"2025-12-01","cited_by_count":0,"area":"deeprl"},{"id":"2601.11499","title":"On the Probability of First Success in Differential Evolution: Hazard Identities and Tail Bounds","created":"2026-01-16","cited_by_count":0,"area":null},{"id":"2601.21467","title":"A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation","created":"2026-01-29","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":"2604.13393","title":"A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity","created":"2026-04-15","cited_by_count":0,"area":null},{"id":"2604.17067","title":"Trajectory-Restricted Optimization Conditions and Geometry-Aware Linear Convergence","created":"2026-04-18","cited_by_count":0,"area":null},{"id":"2607.01715","title":"Distributionally Robust Listwise Preference Optimization","created":"2026-07-02","cited_by_count":0,"area":"alignment"},{"id":"2607.17240","title":"Constrained Path Reasoning: Measuring When Committed Stages Earn Their Cost","created":"2026-07-19","cited_by_count":0,"area":"lr"}],"next_cursor":null}