conftrace_

policy regret

15 papers

Explore in graph

Co-occurring keywords · papers mentioning both

online learning (8) regret bound (7) multi-armed bandit (5) adaptive adversary (3) regret minimization (3) adversarial learning (3) multi-agent system (2) markov game (2) adaptive adversaries (2) game theory (2)

Papers

Policy-Regret Minimization in Markov Games with Function Approximation ICML 2025 The Perils of Optimizing Learned Reward Functions: Low Training Error Does Not Guarantee Low Regret ICML 2025 Adaptive online non-stochastic control L4DC 2024 Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms NeurIPS 2024 Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret L4DC 2023 Online Convex Optimization with Unbounded Memory NeurIPS 2023 Bounded Memory Adversarial Bandits with Composite Anonymous Delayed Feedback IJCAI 2022 Complete Policy Regret Bounds for Tallying Bandits COLT 2022 Congested Bandits: Optimal Routing via Short-term Resets ICML 2022 Addressing the Long-term Impact of ML Decisions via Policy Regret IJCAI 2021 Decentralized Learning in Online Queuing Systems NeurIPS 2021 Online Optimal Control with Affine Constraints AAAI 2021 Online learning with dynamics: A minimax perspective NeurIPS 2020 Policy Regret in Repeated Games NeurIPS 2018 Online Learning with Switching Costs and Other Adaptive Adversaries NeurIPS 2013