No article text was recorded for this version.
regret-violation trade-off
Version 2 of 257 papers79 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
- Blog: Online Convex Optimization with Perturbed Constraints: Optimal Rates against Stronger Benchmarks
- Blog: Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
- Blog: Adaptive Algorithms for Online Convex Optimization with Long-term Constraints
- Blog: Multi-armed bandits with guaranteed revenue per arm
- Blog: Online Alternating Direction Method
- Blog: Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Blog: One-Point Sampling for Distributed Bandit Convex Optimization with Time-Varying Constraints
- Blog: Lazy Lagrangians with Predictions for Online Learning
- Blog: Online Learning for Traffic Routing under Unknown Preferences
- Blog: Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints
- Blog: Online Convex Optimization with Stochastic Constraints
- Blog: Tight Bounds for Online Convex Optimization with Adversarial Constraints
- Blog: Distributed online constrained convex optimization with event-triggered communication
- Blog: Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
- Blog: $O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
- Blog: Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints
- Blog: No-regret Algorithms for Online Convex Programs
- Blog: Online Multi-task Learning with Hard Constraints
- Blog: Distributed Online Optimization with Long-Term Constraints
- Blog: A Bayesian Approach for Stochastic Continuum-armed Bandit with Long-term Constraints
- Blog: Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
- Blog: Data-Dependent Regret Bounds for MABs with Constraints
- Blog: Online Convex Optimization with Perturbed Constraints
- Blog: Online Learning with Primary and Secondary Losses
- Blog: Online Learning under Budget and ROI Constraints via Weak Adaptivity
- Blog: Adaptive Passive-Aggressive Framework for Online Regression with Side Information
- Blog: Safe Online Convex Optimization with Unknown Linear Safety Constraints
- Blog: A Unifying Framework for Online Safe Optimization
- Blog: Data-driven optimization model customization
- Blog: A Lazy Approach to Online Learning with Constraints
- Blog: Adaptive Algorithms for Online Convex Optimization with Long-term Constraints
- Blog: Safety-Aware Algorithms for Adversarial Contextual Bandit
- Blog: Distributed Online Convex Optimization with Time-Varying Coupled Inequality Constraints
- Blog: Contextual Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
- Blog: Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
- Blog: Online Convex Optimization with Hard Constraints: Towards the Best of Two Worlds and Beyond
- Blog: Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
- Blog: Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints
- Blog: The Pareto-optimal Trade-off between Regret and Statistical Inference in Linear Stochastic Bandits under Safety Constraints
- Blog: Distributed Bandit Online Convex Optimization with Time-Varying Coupled Inequality Constraints
- Blog: Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
- Blog: An Incremental Gradient Method for Large-scale Distributed Nonlinearly Constrained Optimization
- Blog: Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
- Blog: A Data-Centric Multi-Objective Learning Framework for Responsible Recommendation Systems
- Blog: Contextual Combinatorial Multi-output GP Bandits with Group Constraints
- Blog: On the Power of Optimism in Constrained Online Convex Optimization
- Blog: Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition
- Blog: Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
- Blog: Online Learning with Primary and Secondary Losses
- Blog: Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints
- Blog: Non-stationary Bandits with Knapsacks
- Blog: Online Classification with Specificity Constraints
- Blog: Distributed Constrained Online Nonconvex Optimization with Compressed Communication
- Blog: Efficient tracking of large classes of experts.
- Blog: Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
- Blog: Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_regret_violation_trade_off_22c44462,
title = {regret-violation trade-off},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/regret-violation-trade-off/rdr_22c444624f7b447c8390885cef8d965b},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_regret_violation_trade_off_22c44462_v2,
title = {regret-violation trade-off},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/regret-violation-trade-off/rdr_22c444624f7b447c8390885cef8d965b/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}