conftrace_

primal-dual method

58 papers

Explore in graph

Co-occurring keywords

convex optimization (1321) stochastic optimization (1060) primal-dual optimization (49) primal-dual algorithm (72) distributed optimization (275) constrained markov decision process (56) sample complexity (1169) iteration complexity (70) support vector machine (978) coordinate descent (147)

Papers

Convergence and Sample Complexity of Natural Policy Gradient Primal-Dual Methods for Constrained MDPs JMLR 2025
Sample-Efficient Constrained Reinforcement Learning with General Parameterization NIPS 2024
Safe and Efficient: A Primal-Dual Method for Offline Convex CMDPs under Partial Data Coverage NIPS 2024
Stochastic-Constrained Stochastic Optimization with Markovian Data JMLR 2024
A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled Constraints NIPS 2024
Tighter Convergence Bounds for Shuffled SGD via Primal-Dual Perspective NIPS 2024
Reward Penalties on Augmented States for Solving Richly Constrained RL Effectively AAAI 2024
High Probability and Risk-Averse Guarantees for a Stochastic Accelerated Primal-Dual Method JMLR 2024
A-FedPD: Aligning Dual-Drift is All Federated Primal-Dual Learning Needs NIPS 2024
Scalable Primal-Dual Actor-Critic Method for Safe Multi-Agent RL with General Utilities NIPS 2023
Projection-Free Methods for Solving Nonconvex-Concave Saddle Point Problems NIPS 2023
Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Conservative Natural Policy Gradient Primal-Dual Algorithm AAAI 2023
Gradient-Variation Bound for Online Convex Optimization with Constraints AAAI 2023
Policy-Based Primal-Dual Methods for Convex Constrained Markov Decision Processes AAAI 2023
Randomized Primal-Dual Methods with Adaptive Step Sizes AISTATS 2023
Online Matching with Controllable Rewards and Arrival Probabilities IJCAI 2022
A Near-Optimal Primal-Dual Method for Off-Policy Learning in CMDP NIPS 2022
Towards painless policy optimization for constrained MDPs UAI 2022
Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization AISTATS 2022
UnderGrad: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees ICML 2022
On the Efficiency of Entropic Regularized Algorithms for Optimal Transport JMLR 2022
Accelerated Primal-Dual Gradient Method for Smooth and Convex-Concave Saddle-Point Problems with Bilinear Coupling NIPS 2022
A first-order primal-dual method with adaptivity to local smoothness NIPS 2021
Fast Projection Onto Convex Smooth Constraints ICML 2021
Variance Reduction via Primal-Dual Accelerated Dual Averaging for Nonsmooth Convex Finite-Sums ICML 2021