Imagen de Portada

Best-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda Objectives

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Akash, S, Gajane, Pratik, Singh, Jawar
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Adversarial Multi-dueling Bandits
por: Gajane, Pratik
Publicado: (2024)

Utility-based Dueling Bandits as a Partial Monitoring Game
por: Gajane, Pratik, et al.
Publicado: (2015)

Fairness in two-player zero-sum games with bandit feedback
por: Akash, S, et al.
Publicado: (2026)

The Sampling Complexity of Condorcet Winner Identification in Dueling Bandits
por: Saad, El Mehdi, et al.
Publicado: (2026)

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
por: Kuroki, Yuko, et al.
Publicado: (2023)

Non-Stationary Dueling Bandits Under a Weighted Borda Criterion
por: Suk, Joe, et al.
Publicado: (2024)

Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits
por: Li, Mengmeng, et al.
Publicado: (2025)

Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
por: Di, Qiwei, et al.
Publicado: (2024)

Biased Dueling Bandits with Stochastic Delayed Feedback
por: Yi, Bongsoo, et al.
Publicado: (2024)

Provably Efficient Multi-Objective Bandit Algorithms under Preference-Centric Customization
por: Cao, Linfeng, et al.
Publicado: (2025)

Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
por: Stradi, Francesco Emanuele, et al.
Publicado: (2024)

Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
por: Schlisselberg, Ofir, et al.
Publicado: (2025)

Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
por: Lee, Jongyeong, et al.
Publicado: (2024)

Fusing Reward and Dueling Feedback in Stochastic Bandits
por: Wang, Xuchuang, et al.
Publicado: (2025)

Multi-Player Approaches for Dueling Bandits
por: Raveh, Or, et al.
Publicado: (2024)

Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality
por: Kim, Chaiwon, et al.
Publicado: (2025)

A Further Efficient Algorithm with Best-of-Both-Worlds Guarantees for $m$-Set Semi-Bandit Problem
por: Chen, Botao, et al.
Publicado: (2026)

Best Group Identification in Multi-Objective Bandits
por: Shahverdikondori, Mohammad, et al.
Publicado: (2025)

Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions
por: Oh, Youngmin
Publicado: (2026)

When Can We Track Significant Preference Shifts in Dueling Bandits?
por: Suk, Joe, et al.
Publicado: (2023)

Neural Dueling Bandits: Preference-Based Optimization with Human Feedback
por: Verma, Arun, et al.
Publicado: (2024)

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
por: Kato, Masahiro, et al.
Publicado: (2024)

Federated Linear Dueling Bandits
por: Huang, Xuhan, et al.
Publicado: (2025)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
por: Di, Qiwei, et al.
Publicado: (2023)

Preference is More Than Comparisons: Rethinking Dueling Bandits with Augmented Human Feedback
por: Wang, Shengbo, et al.
Publicado: (2025)

Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm
por: Davoodi, Mansoor, et al.
Publicado: (2025)

Online Clustering of Dueling Bandits
por: Wang, Zhiyong, et al.
Publicado: (2025)

Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems
por: Zhan, Jingxin, et al.
Publicado: (2025)

Data-dependent Bounds with $T$-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
por: Nguyen, Quan, et al.
Publicado: (2025)

A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints
por: Germano, Jacopo, et al.
Publicado: (2023)

Linear and Neural Dueling Bandits with Delayed Feedback
por: Wang, Xiangyi, et al.
Publicado: (2026)

Conversational Dueling Bandits in Generalized Linear Models
por: Yang, Shuhua, et al.
Publicado: (2024)

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
por: Ghaffari, Fatemeh, et al.
Publicado: (2024)

Randomized Least Squares Value Iteration itself is Joint Differentially Private
por: Lu, Haiyang, et al.
Publicado: (2026)

Best Arm Identification for Stochastic Rising Bandits
por: Mussi, Marco, et al.
Publicado: (2023)

uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs
por: Chen, Yu, et al.
Publicado: (2024)

Multi-User Dueling Bandits: A Fair Approach using Nash Social Welfare
por: Ahmed, Maheed H., et al.
Publicado: (2026)

Recycling History: Efficient Recommendations from Contextual Dueling Bandits
por: Sankagiri, Suryanarayana, et al.
Publicado: (2025)

The Best of Both Worlds: On the Dilemma of Out-of-distribution Detection
por: Zhang, Qingyang, et al.
Publicado: (2024)

Evaluating Causal Discovery Algorithms for Path-Specific Fairness and Utility in Healthcare
por: Nagesh, Nitish, et al.
Publicado: (2026)