conftrace_

policy regret

13 papers

Explore in graph

Co-occurring keywords

online learning (1777) regret bound (1926) multi-armed bandit (1098) regret minimization (315) adversarial learning (1595) multi-agent system (1819) adaptive adversary (8) adaptive adversaries (2) game theory (854) sample-efficient learning (43)

Papers

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