Co-occurring keywords · papers mentioning both
Papers
Learning Policies with Zero or Bounded Constraint Violation for Constrained MDPs
NeurIPS 2021
Online DR-Submodular Maximization: Minimizing Regret and Constraint Violation
AAAI 2021
Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints
ICML 2021
Safe Reinforcement Learning with Natural Language Constraints
NeurIPS 2021
Tight sampling and discarding bounds for scenario programs with an arbitrary number of removed samples
L4DC 2021
A Low Complexity Algorithm with O(√T) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints
JMLR 2020
Online Convex Optimization with Perturbed Constraints: Optimal Rates against Stronger Benchmarks
AISTATS 2020
Please Mind the Root: Decoding Arborescences for Dependency Parsing
EMNLP 2020
Upper Confidence Primal-Dual Reinforcement Learning for CMDP with Adversarial Loss
NeurIPS 2020
Online convex optimization for cumulative constraints
NeurIPS 2018
Online Convex Optimization with Stochastic Constraints
NeurIPS 2017
Adaptive Algorithms for Online Convex Optimization with Long-term Constraints
ICML 2016