{"total":108,"rows":[{"id":"2107.05745","title":"Adapting to Misspecification in Contextual Bandits","created":"2021-07-12","cited_by_count":81,"area":null},{"id":"2205.06811","title":"Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions","created":"2022-05-13","cited_by_count":51,"area":null},{"id":"2102.05858","title":"Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously","created":"2021-02-11","cited_by_count":48,"area":null},{"id":"2110.03580","title":"A Model Selection Approach for Corruption Robust Reinforcement Learning","created":"2021-10-07","cited_by_count":45,"area":null},{"id":"2107.01509","title":"Bayesian decision-making under misspecified priors with applications to meta-learning","created":"2021-07-03","cited_by_count":44,"area":null},{"id":"2106.04117","title":"The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition","created":"2021-06-08","cited_by_count":40,"area":null},{"id":"2106.02978","title":"Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks","created":"2021-06-05","cited_by_count":33,"area":null},{"id":"2206.13063","title":"On the Complexity of Adversarial Decision Making","created":"2022-06-27","cited_by_count":33,"area":null},{"id":"2212.05949","title":"Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes","created":"2022-12-12","cited_by_count":33,"area":null},{"id":"2102.05800","title":"Robust Policy Gradient against Strong Data Corruption","created":"2021-02-11","cited_by_count":30,"area":null},{"id":"2302.09739","title":"A Blackbox Approach to Best of Both Worlds in Bandits and Beyond","created":"2023-02-20","cited_by_count":30,"area":null},{"id":"2208.09407","title":"Learning in Stackelberg Games with Non-myopic Agents","created":"2022-08-19","cited_by_count":29,"area":null},{"id":"2206.00873","title":"Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs","created":"2022-06-02","cited_by_count":26,"area":null},{"id":"2102.05776","title":"Defense Against Reward Poisoning Attacks in Reinforcement Learning","created":"2021-02-10","cited_by_count":21,"area":null},{"id":"2109.10963","title":"On Optimal Robustness to Adversarial Corruption in Online Decision Problems","created":"2021-09-22","cited_by_count":21,"area":null},{"id":"2110.12615","title":"Linear Contextual Bandits with Adversarial Corruptions","created":"2021-10-25","cited_by_count":21,"area":null},{"id":"2102.06875","title":"Improved Corruption Robust Algorithms for Episodic Reinforcement Learning","created":"2021-02-13","cited_by_count":20,"area":null},{"id":"2109.05700","title":"Exploiting Heterogeneity in Robust Federated Best-Arm Identification","created":"2021-09-13","cited_by_count":20,"area":null},{"id":"2207.14550","title":"Best-of-Both-Worlds Algorithms for Partial Monitoring","created":"2022-07-29","cited_by_count":19,"area":null},{"id":"2202.05100","title":"Adaptively Exploiting d-Separators with Causal Bandits","created":"2022-02-10","cited_by_count":18,"area":null},{"id":"2103.12487","title":"Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions","created":"2021-03-23","cited_by_count":15,"area":null},{"id":"2111.12482","title":"One More Step Towards Reality: Cooperative Bandits with Imperfect Communication","created":"2021-11-24","cited_by_count":15,"area":null},{"id":"2305.17301","title":"Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds","created":"2023-05-26","cited_by_count":15,"area":null},{"id":"2305.18543","title":"Robust Lipschitz Bandits to Adversarial Corruptions","created":"2023-05-29","cited_by_count":15,"area":null},{"id":"2302.01523","title":"Multi-channel Autobidding with Budget and ROI Constraints","created":"2023-02-03","cited_by_count":14,"area":null},{"id":"2302.12370","title":"Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds","created":"2023-02-24","cited_by_count":14,"area":null},{"id":"2110.13052","title":"Can Q-Learning be Improved with Advice?","created":"2021-10-25","cited_by_count":13,"area":null},{"id":"2403.03811","title":"Incentivized Learning in Principal-Agent Bandit Games","created":"2024-03-06","cited_by_count":13,"area":null},{"id":"2108.04782","title":"Bandit Algorithms for Precision Medicine","created":"2021-08-10","cited_by_count":12,"area":null},{"id":"2105.11802","title":"Bias-Robust Bayesian Optimization via Dueling Bandits","created":"2021-05-25","cited_by_count":11,"area":null},{"id":"2202.01850","title":"A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits","created":"2022-02-03","cited_by_count":11,"area":null},{"id":"2206.14912","title":"Best of Both Worlds Model Selection","created":"2022-06-29","cited_by_count":11,"area":null},{"id":"2312.15433","title":"Best-of-Both-Worlds Algorithms for Linear Contextual Bandits","created":"2023-12-24","cited_by_count":11,"area":null},{"id":"2110.09008","title":"When Are Linear Stochastic Bandits Attackable?","created":"2021-10-18","cited_by_count":10,"area":null},{"id":"2205.14842","title":"Efficient Reward Poisoning Attacks on Online Deep Reinforcement Learning","created":"2022-05-30","cited_by_count":9,"area":null},{"id":"2206.09642","title":"Beyond IID: data-driven decision-making in heterogeneous environments","created":"2022-06-20","cited_by_count":9,"area":null},{"id":"2206.02656","title":"A Regret-Variance Trade-Off in Online Learning","created":"2022-06-06","cited_by_count":7,"area":null},{"id":"2306.10694","title":"On the Model-Misspecification in Reinforcement Learning","created":"2023-06-19","cited_by_count":7,"area":null},{"id":"2102.12722","title":"Combinatorial Bandits under Strategic Manipulations","created":"2021-02-25","cited_by_count":6,"area":null},{"id":"2111.07458","title":"Mean-based Best Arm Identification in Stochastic Bandits under Reward Contamination","created":"2021-11-14","cited_by_count":6,"area":null},{"id":"2203.03186","title":"Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm","created":"2022-03-07","cited_by_count":6,"area":null},{"id":"2205.04134","title":"Federated Multi-Armed Bandits Under Byzantine Attacks","created":"2022-05-09","cited_by_count":6,"area":null},{"id":"2302.02526","title":"On Private and Robust Bandits","created":"2023-02-06","cited_by_count":6,"area":null},{"id":"2302.14686","title":"Approximately Stationary Bandits with Knapsacks","created":"2023-02-28","cited_by_count":6,"area":null},{"id":"2305.19218","title":"Adversarial Attacks on Online Learning to Rank with Stochastic Click Models","created":"2023-05-30","cited_by_count":6,"area":null},{"id":"2106.04207","title":"Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions","created":"2021-06-08","cited_by_count":5,"area":null},{"id":"2110.08449","title":"Adversarial Attacks on Gaussian Process Bandits","created":"2021-10-16","cited_by_count":5,"area":null},{"id":"2202.06694","title":"Versatile Dueling Bandits: Best-of-both-World Analyses for Online Learning from Preferences","created":"2022-02-14","cited_by_count":5,"area":null},{"id":"2206.02834","title":"Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds","created":"2022-06-06","cited_by_count":5,"area":null},{"id":"2102.12192","title":"Multiplicative Reweighting for Robust Neural Network Optimization","created":"2021-02-24","cited_by_count":4,"area":null},{"id":"2106.06712","title":"Simple Combinatorial Algorithms for Combinatorial Bandits: Corruptions and Approximations","created":"2021-06-12","cited_by_count":4,"area":null},{"id":"2107.01881","title":"Robust Online Convex Optimization in the Presence of Outliers","created":"2021-07-05","cited_by_count":4,"area":null},{"id":"2107.09572","title":"Best-of-All-Worlds Bounds for Online Learning with Feedback Graphs","created":"2021-07-20","cited_by_count":4,"area":null},{"id":"2201.12700","title":"Coordinated Attacks against Contextual Bandits: Fundamental Limits and Defense Mechanisms","created":"2022-01-30","cited_by_count":4,"area":null},{"id":"2202.13710","title":"Best of Many Worlds Guarantees for Online Learning with Knapsacks","created":"2022-02-28","cited_by_count":4,"area":null},{"id":"2206.07528","title":"Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization","created":"2022-06-15","cited_by_count":4,"area":null},{"id":"2405.16843","title":"Non-stochastic Bandits With Evolving Observations","created":"2024-05-27","cited_by_count":4,"area":null},{"id":"2112.05367","title":"Efficient Action Poisoning Attacks on Linear Contextual Bandits","created":"2021-12-10","cited_by_count":3,"area":null},{"id":"2307.07675","title":"On the Robustness of Epoch-Greedy in Multi-Agent Contextual Bandit Mechanisms","created":"2023-07-15","cited_by_count":3,"area":null},{"id":"2310.04768","title":"Online Corrupted User Detection and Regret Minimization","created":"2023-10-07","cited_by_count":3,"area":null},{"id":"2310.15932","title":"Online Robust Mean Estimation","created":"2023-10-24","cited_by_count":3,"area":null},{"id":"2402.08321","title":"Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring","created":"2024-02-13","cited_by_count":3,"area":null},{"id":"2405.20028","title":"A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\\Theta(T^{2/3})$ and its Application to Best-of-Both-Worlds","created":"2024-05-30","cited_by_count":3,"area":null},{"id":"2409.20440","title":"Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits","created":"2024-09-30","cited_by_count":3,"area":null},{"id":"2410.01857","title":"Learning the Optimal Path and DNN Partition for Collaborative Edge Inference","created":"2024-10-02","cited_by_count":3,"area":null},{"id":"2505.21938","title":"Practical Adversarial Attacks on Stochastic Bandits via Fake Data Injection","created":"2025-05-28","cited_by_count":3,"area":null},{"id":"2609.13440","title":"Efficient Online Inverse Optimization with $O(d)$ Regret","created":"2026-09-11","cited_by_count":3,"area":null},{"id":"2201.01628","title":"Bridging Adversarial and Nonstationary Multi-armed Bandit","created":"2022-01-05","cited_by_count":2,"area":null},{"id":"2212.06279","title":"Decentralized Stochastic Multi-Player Multi-Armed Walking Bandits","created":"2022-12-12","cited_by_count":2,"area":null},{"id":"2309.16563","title":"CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption","created":"2023-09-28","cited_by_count":2,"area":null},{"id":"2310.05308","title":"Adversarial Attacks on Combinatorial Multi-Armed Bandits","created":"2023-10-08","cited_by_count":2,"area":null},{"id":"2402.13487","title":"Stealthy Adversarial Attacks on Stochastic Multi-Armed Bandits","created":"2024-02-21","cited_by_count":2,"area":null},{"id":"2410.19705","title":"Robust Thompson Sampling Algorithms Against Reward Poisoning Attacks","created":"2024-10-25","cited_by_count":2,"area":null},{"id":"2508.19466","title":"Incentivized Lipschitz Bandits","created":"2025-08-26","cited_by_count":2,"area":null},{"id":"2510.02820","title":"Online Learning in the Random Order Model","created":"2025-10-03","cited_by_count":2,"area":null},{"id":"2110.05724","title":"Query-Reward Tradeoffs in Multi-Armed Bandits","created":"2021-10-12","cited_by_count":1,"area":null},{"id":"2307.13903","title":"Corruption-Robust Lipschitz Contextual Search","created":"2023-07-26","cited_by_count":1,"area":null},{"id":"2401.01077","title":"Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions","created":"2024-01-02","cited_by_count":1,"area":null},{"id":"2402.12868","title":"Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets","created":"2024-02-20","cited_by_count":1,"area":null},{"id":"2405.12439","title":"No-Regret M${}^{\\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting","created":"2024-05-21","cited_by_count":1,"area":null},{"id":"2408.08859","title":"Stochastic Bandits Robust to Adversarial Attacks","created":"2024-08-16","cited_by_count":1,"area":null},{"id":"2408.12581","title":"Identifying the Best Arm in the Presence of Global Environment Shifts","created":"2024-08-22","cited_by_count":1,"area":null},{"id":"2501.03402","title":"On the Adversarial Robustness of Benjamini Hochberg","created":"2025-01-06","cited_by_count":1,"area":null},{"id":"2502.00108","title":"Tracking Most Significant Shifts in Infinite-Armed Bandits","created":"2025-01-31","cited_by_count":1,"area":null},{"id":"2511.05802","title":"Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits","created":"2025-11-08","cited_by_count":1,"area":null},{"id":"2511.15315","title":"Robust Bayesian Optimisation with Unbounded Corruptions","created":"2025-11-19","cited_by_count":1,"area":null},{"id":"2601.11924","title":"Communication-Corruption Coupling and Verification in Cooperative Multi-Objective Bandits","created":"2026-01-17","cited_by_count":1,"area":null},{"id":"2602.01295","title":"Best-of-Both-Worlds for Heavy-Tailed Markov Decision Processes","created":"2026-02-01","cited_by_count":1,"area":null},{"id":"2602.10971","title":"A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions","created":"2026-02-11","cited_by_count":1,"area":null},{"id":"2201.12482","title":"Collaborative Learning in General Graphs with Limited Memorization: Complexity, Learnability, and Reliability","created":"2022-01-29","cited_by_count":0,"area":null},{"id":"2203.00076","title":"Robust Multi-Agent Bandits Over Undirected Graphs","created":"2022-02-28","cited_by_count":0,"area":null},{"id":"2206.02666","title":"Robust Pareto Set Identification with Contaminated Bandit Feedback","created":"2022-06-06","cited_by_count":0,"area":null},{"id":"2302.00997","title":"Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning","created":"2023-02-02","cited_by_count":0,"area":null},{"id":"2304.11741","title":"Robust and differentially private stochastic linear bandits","created":"2023-04-23","cited_by_count":0,"area":null},{"id":"2305.02441","title":"Reward Teaching for Federated Multi-armed Bandits","created":"2023-05-03","cited_by_count":0,"area":null},{"id":"2402.17720","title":"The SMART approach to instance-optimal online learning","created":"2024-02-27","cited_by_count":0,"area":null},{"id":"2403.12181","title":"MAC Advice for Facility Location Mechanism Design","created":"2024-03-18","cited_by_count":0,"area":null},{"id":"2406.18072","title":"Learning for Bandits under Action Erasures","created":"2024-06-26","cited_by_count":0,"area":null},{"id":"2502.07514","title":"A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond","created":"2025-02-11","cited_by_count":0,"area":null},{"id":"2504.20894","title":"Does Feedback Help in Bandits with Arm Erasures?","created":"2025-04-29","cited_by_count":0,"area":null}],"next_cursor":"100"}