Co-occurring keywords · papers mentioning both
Papers
On the Importance of Randomization in Discriminative Feature Feedback
COLT 2026
Security Games with Layered Defenses: Adaptive Adversaries and Gittins Indices
AAAI 2026
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
COLT 2025
Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
AISTATS 2025
Tracking The Best Expert Privately
ICML 2025
Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms
NeurIPS 2024
The Limits of Differential Privacy in Online Learning
NeurIPS 2024
Federated Online and Bandit Convex Optimization
ICML 2023
Robust Algorithms on Adaptive Inputs from Bounded Adversaries
ICLR 2023
Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance
ICML 2023
Complete Policy Regret Bounds for Tallying Bandits
COLT 2022
On the power of adaptivity in statistical adversaries
COLT 2022
Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits
COLT 2022
Efficient Bandit Convex Optimization: Beyond Linear Losses
COLT 2021
Online Learning with Switching Costs and Other Adaptive Adversaries
NeurIPS 2013