No article text was recorded for this version.
adaptive adversary robustness (oblivious adversary assumption)
Version 1 of 1165 papers177 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Online Team Formation Under Different Synergies
- Blog: Efficient Kernelized Learning in Polyhedral Games beyond Full Information: From Colonel Blotto to Congestion Games
- Blog: Online Learning with Graph-Structured Feedback against Adaptive Adversaries
- Blog: Beating the Adaptive Bandit with High Probability
- Blog: Optimal Online Discrepancy Minimization
- Blog: Multi-Armed Bandits with Metric Movement Costs
- Blog: Online Combinatorial Optimization with Group Fairness Constraints
- Blog: Linear Bandits with Non-i.i.d. Noise
- Blog: An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization
- Blog: Fast rates for online learning in Linearly Solvable Markov Decision Processes
- Blog: High-Probability Regret Bounds for Bandit Online Linear Optimization
- Blog: Private Online Learning against an Adaptive Adversary: Realizable and Agnostic Settings
- Blog: Tight Regret Bounds for Infinite-armed Linear Contextual Bandits
- Blog: Tracking Most Significant Arm Switches in Bandits
- Blog: Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs
- Blog: Radar Anti-Jamming Strategy Learning via Domain-Knowledge Enhanced Online Convex Optimization
- Blog: Risk-Averse Stochastic Convex Bandit
- Blog: Online learning over a finite action set with limited switching
- Blog: Improved Regret Bounds for Projection-free Bandit Convex Optimization
- Blog: Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition
- Blog: Prediction with Expert Advice under Local Differential Privacy
- Blog: Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits
- Blog: Online Learning of Eigenvectors
- Blog: Feature-Based Online Bilateral Trade
- Blog: Following the Perturbed Leader for Online Structured Learning
- Blog: Breaking the T^(2/3) Barrier for Sequential Calibration
- Blog: Federated Online Prediction from Experts with Differential Privacy: Separations and Regret Speed-ups
- Blog: Almost Optimal Model-Free Reinforcement Learningvia Reference-Advantage Decomposition
- Blog: Smoothed Online Classification can be Harder than Batch Classification
- Blog: Multi-agent actor-critic with time dynamical opponent model
- Blog: Online Learning with Bounded Recall
- Blog: Approximation Theory Based Methods for RKHS Bandits
- Blog: Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variation
- Blog: The Blinded Bandit: Learning with Adaptive Feedback
- Blog: Nonstochastic Bandits with Composite Anonymous Feedback
- Blog: Upper Confidence Primal-Dual Reinforcement Learning for CMDP with Adversarial Loss
- Blog: A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
- Blog: Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
- Blog: Breaking the $T^{2/3}$ Barrier for Sequential Calibration
- Blog: Conditional Swap Regret and Conditional Correlated Equilibrium
- Blog: Decoupling Exploration and Exploitation in Multi-Armed Bandits
- Blog: Prediction by random-walk perturbation
- Blog: Random Walk Approach to Regret Minimization
- Blog: Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs
- Blog: Higher-Order Regret Bounds with Switching Costs
- Blog: Multi-scale exploration of convex functions and bandit convex optimization
- Blog: Online Matrix Completion with Side Information
- Blog: Interactive Learning of a Dynamic Structure
- Blog: Online Learning under Budget and ROI Constraints via Weak Adaptivity
- Blog: Projection-free Online Learning with Arbitrary Delays
- Blog: Oracle-efficient Hybrid Learning with Constrained Adversaries
- Blog: Oracle-Efficient Online Learning for Smoothed Adversaries
- Blog: A Generalized Approach to Online Convex Optimization
- Blog: Manas: multi-agent neural architecture search
- Blog: Multi-Armed Bandits with Interference: Bridging Causal Inference and Adversarial Bandits
- Blog: Narrowing the Gap between Adversarial and Stochastic MDPs via Policy Optimization
- Blog: Combinatorial Bandits under Strategic Manipulations
- Blog: Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization
- Blog: Online convex optimization in the bandit setting: gradient descent without a gradient
- Blog: Decentralized Learning Dynamics in the Gossip Model
Showing 60 of 165 papers.
History & citation
Current · Permanent link
- Online Optimization Against Adaptive Adversaries merged into this direction (95% overlap)
- Online Learning Against Adaptive Adversaries merged into this direction (85% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_adaptive_adversary_robustness_oblivious__e250b478,
title = {adaptive adversary robustness (oblivious adversary assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/adaptive-adversary-robustness-oblivious-adversary-assumption/rdr_e250b478676c4c8c9cbcc66ec084ec73},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_adaptive_adversary_robustness_oblivious__e250b478_v1,
title = {adaptive adversary robustness (oblivious adversary assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/adaptive-adversary-robustness-oblivious-adversary-assumption/rdr_e250b478676c4c8c9cbcc66ec084ec73/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}