{"total":35,"rows":[{"id":"2110.10351","title":"Faster Algorithm and Sharper Analysis for Constrained Markov Decision Process","created":"2021-10-20","cited_by_count":19,"area":null},{"id":"2212.09513","title":"Stochastic Inexact Augmented Lagrangian Method for Nonconvex Expectation Constrained Optimization","created":"2022-12-19","cited_by_count":19,"area":null},{"id":"2311.00678","title":"Complexity of Single Loop Algorithms for Nonlinear Programming with Stochastic Objective and Constraints","created":"2023-11-01","cited_by_count":16,"area":null},{"id":"2203.01123","title":"A Primal-Dual Approach to Bilevel Optimization with Multiple Inner Minima","created":"2022-03-01","cited_by_count":13,"area":null},{"id":"2207.05650","title":"A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization","created":"2022-07-12","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":"2312.00561","title":"A safe exploration approach to constrained Markov decision processes","created":"2023-12-01","cited_by_count":10,"area":null},{"id":"2212.12603","title":"Stochastic Methods for AUC Optimization subject to AUC-based Fairness Constraints","created":"2022-12-23","cited_by_count":9,"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":"2504.15243","title":"Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints","created":"2025-04-21","cited_by_count":6,"area":null},{"id":"2202.07868","title":"Data-Driven Minimax Optimization with Expectation Constraints","created":"2022-02-16","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":"2209.04086","title":"Stochastic Compositional Optimization with Compositional Constraints","created":"2022-09-09","cited_by_count":4,"area":null},{"id":"2304.13950","title":"Fairness Uncertainty Quantification: How certain are you that the model is fair?","created":"2023-04-27","cited_by_count":4,"area":null},{"id":"2410.03955","title":"A Retention-Centric Framework for Continual Learning with Guaranteed Model Developmental Safety","created":"2024-10-04","cited_by_count":4,"area":null},{"id":"2209.04604","title":"Accelerated Primal-Dual Methods for Convex-Strongly-Concave Saddle Point Problems","created":"2022-09-10","cited_by_count":3,"area":null},{"id":"2403.12859","title":"Primal Methods for Variational Inequality Problems with Functional Constraints","created":"2024-03-19","cited_by_count":3,"area":null},{"id":"2210.05108","title":"Projection-Free Functional Constrained Optimization for Risk Aversion and Sparsity Control","created":"2022-10-11","cited_by_count":2,"area":null},{"id":"2404.09438","title":"Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization","created":"2024-04-15","cited_by_count":2,"area":null},{"id":"2505.12530","title":"Enforcing Fair Predicted Scores on Intervals of Percentiles by Difference-of-Convex Constraints","created":"2025-05-18","cited_by_count":2,"area":null},{"id":"2507.23155","title":"On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization","created":"2025-07-30","cited_by_count":2,"area":null},{"id":"2308.10767","title":"GBM-based Bregman Proximal Algorithms for Constrained Learning","created":"2023-08-21","cited_by_count":1,"area":null},{"id":"2502.19764","title":"Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions","created":"2025-02-27","cited_by_count":1,"area":null},{"id":"2506.20630","title":"First-order methods for stochastic and finite-sum convex optimization with deterministic constraints","created":"2025-06-25","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":"2212.11143","title":"Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints","created":"2022-12-21","cited_by_count":0,"area":null},{"id":"2304.04778","title":"First-order methods for Stochastic Variational Inequality problems with Function Constraints","created":"2023-04-10","cited_by_count":0,"area":null},{"id":"2310.03890","title":"Accelerated Neural Network Training with Rooted Logistic Objectives","created":"2023-10-05","cited_by_count":0,"area":null},{"id":"2311.11180","title":"Nonsmooth Projection-Free Optimization with Functional Constraints","created":"2023-11-18","cited_by_count":0,"area":null},{"id":"2405.01984","title":"A Penalty-Based Guardrail Algorithm for Non-Decreasing Optimization with Inequality Constraints","created":"2024-05-03","cited_by_count":0,"area":null},{"id":"2504.09409","title":"Mirror Descent Linearized Augmented Lagrangian Methods for Nonconvex Constrained Stochastic Zeroth-Order Optimization","created":"2025-04-13","cited_by_count":0,"area":null},{"id":"2506.02504","title":"Stochastic Momentum Methods for Non-smooth Non-Convex Finite-Sum Coupled Compositional Optimization","created":"2025-06-03","cited_by_count":0,"area":null},{"id":"2604.14017","title":"Stochastic Trust-Region Methods for Over-parameterized Models","created":"2026-04-15","cited_by_count":0,"area":null},{"id":"2605.03313","title":"Distributed Learning with Adversarial Gradient Perturbations","created":"2026-05-05","cited_by_count":0,"area":null},{"id":"2606.07088","title":"Residual-Controlled Multiplier Learning for Stochastic Constrained Decision-Making","created":"2026-06-05","cited_by_count":0,"area":null}],"next_cursor":null}