Image de couverture de livre

Adversarial Multi-dueling Bandits

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Gajane, Pratik
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Best-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda Objectives
par: Akash, S, et autres
Publié: (2026)

Utility-based Dueling Bandits as a Partial Monitoring Game
par: Gajane, Pratik, et autres
Publié: (2015)

Fairness in two-player zero-sum games with bandit feedback
par: Akash, S, et autres
Publié: (2026)

Randomized Least Squares Value Iteration itself is Joint Differentially Private
par: Lu, Haiyang, et autres
Publié: (2026)

Investigating Gender Fairness in Machine Learning-driven Personalized Care for Chronic Pain
par: Gajane, Pratik, et autres
Publié: (2024)

Evaluating Causal Discovery Algorithms for Path-Specific Fairness and Utility in Healthcare
par: Nagesh, Nitish, et autres
Publié: (2026)

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
par: Ghaffari, Fatemeh, et autres
Publié: (2024)

Heterogeneous Multi-Player Multi-Armed Bandits Robust To Adversarial Attacks
par: Magesh, Akshayaa, et autres
Publié: (2025)

Adversarial Bandits with Multi-User Delayed Feedback: Theory and Application
par: Li, Yandi, et autres
Publié: (2023)

Adversarial Attacks on Combinatorial Multi-Armed Bandits
par: Balasubramanian, Rishab, et autres
Publié: (2023)

Stealthy Adversarial Attacks on Stochastic Multi-Armed Bandits
par: Wang, Zhiwei, et autres
Publié: (2024)

Adversarial Bandit over Bandits: Hierarchical Bandits for Online Configuration Management
par: Avin, Chen, et autres
Publié: (2025)

Adversarial Combinatorial Bandits with Switching Costs
par: Dong, Yanyan, et autres
Publié: (2024)

Stochastic Bandits Robust to Adversarial Attacks
par: Wang, Xuchuang, et autres
Publié: (2024)

On Characterizing Learnability for Adversarial Noisy Bandits
par: Hanneke, Steve, et autres
Publié: (2026)

Faster Rates for Private Adversarial Bandits
par: Asi, Hilal, et autres
Publié: (2025)

Cascading Bandits Robust to Adversarial Corruptions
par: Xie, Jize, et autres
Publié: (2025)

Adversarial Bandits against Arbitrary Strategies
par: Kim, Jung-hun, et autres
Publié: (2022)

Constrained Contextual Bandits with Adversarial Contexts
par: Sarkar, Dhruv, et autres
Publié: (2026)

Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback
par: Xiong, Guojun, et autres
Publié: (2024)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
par: Jin, Tianyuan, et autres
Publié: (2024)

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
par: Iwazaki, Shogo
Publié: (2026)

Near-Optimal Regret in Adversarial Kernel Bandits
par: Zhang, Yu-Jie, et autres
Publié: (2026)

Bandits in Flux: Adversarial Constraints in Dynamic Environments
par: Salem, Tareq Si
Publié: (2026)

Unrolled Creative Adversarial Network For Generating Novel Musical Pieces
par: Nag, Pratik
Publié: (2024)

Lagrangian Index Policy for Restless Bandits with Average Reward
par: Avrachenkov, Konstantin, et autres
Publié: (2024)

Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
par: Bernasconi, Martino, et autres
Publié: (2024)

An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
par: van Erven, Tim, et autres
Publié: (2025)

Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs
par: Kash, Ian A., et autres
Publié: (2022)

Adversarial Bandit Optimization with Globally Bounded Perturbations to Linear Losses
par: Cheng, Zhuoyu, et autres
Publié: (2026)

HyperArm Bandit Optimization: A Novel approach to Hyperparameter Optimization and an Analysis of Bandit Algorithms in Stochastic and Adversarial Settings
par: Karroum, Samih, et autres
Publié: (2025)

Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback
par: Liu, Haolin, et autres
Publié: (2024)

Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
par: Di, Qiwei, et autres
Publié: (2024)

Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
par: Ito, Shinji, et autres
Publié: (2025)

Online Conformal Abstention for Factuality Control Under Adversarial Bandit Feedback
par: Lee, Minjae, et autres
Publié: (2025)

Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses
par: Zuo, Shiliang
Publié: (2020)

Are Stochastic Multi-objective Bandits Harder than Single-objective Bandits?
par: Guan, Changkun, et autres
Publié: (2026)

Multi-Armed Bandits with Interference
par: Jia, Su, et autres
Publié: (2024)

Imprecise Multi-Armed Bandits
par: Kosoy, Vanessa
Publié: (2024)

Multi-Agent Lipschitz Bandits
par: Chakraborty, Sourav, et autres
Publié: (2026)