Cover Image

The Sampling Complexity of Condorcet Winner Identification in Dueling Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Saad, El Mehdi, Thuot, Victor, Verzelen, Nicolas
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Clustering Items through Bandit Feedback: Finding the Right Feature out of Many
by: Graf, Maximilian, et al.
Published: (2025)

Nonparametric Kernel Clustering with Bandit Feedback
by: Thuot, Victor, et al.
Published: (2026)

The Sample Complexity of Multiple Change Point Identification under Bandit Feedback
by: Graf, Maximilian, et al.
Published: (2026)

Active clustering with bandit feedback
by: Thuot, Victor, et al.
Published: (2024)

Best-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda Objectives
by: Akash, S, et al.
Published: (2026)

Feel-Good Thompson Sampling for Contextual Dueling Bandits
by: Li, Xuheng, et al.
Published: (2024)

Federated Linear Dueling Bandits
by: Huang, Xuhan, et al.
Published: (2025)

Online Clustering of Dueling Bandits
by: Wang, Zhiyong, et al.
Published: (2025)

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

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

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

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

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

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

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

Statistical and computational challenges in ranking
by: Carpentier, Alexandra, et al.
Published: (2025)

Low-degree Lower bounds for clustering in moderate dimension
by: Carpentier, Alexandra, et al.
Published: (2026)

Active Human Feedback Collection via Neural Contextual Dueling Bandits
by: Verma, Arun, et al.
Published: (2025)

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

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

Neural Variance-aware Dueling Bandits with Deep Representation and Shallow Exploration
by: Oh, Youngmin, et al.
Published: (2025)

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

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

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

Lipschitz Dueling Bandits over Continuous Action Spaces
by: Sharma, Mudit, et al.
Published: (2026)

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

Beyond Numeric Rewards: In-Context Dueling Bandits with LLM Agents
by: Xia, Fanzeng, et al.
Published: (2024)

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

Offline Contextual Bandit with Counterfactual Sample Identification
by: Gilotte, Alexandre, et al.
Published: (2025)

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

Phase Transition for Stochastic Block Model with more than $\sqrt{n}$ Communities
by: Carpentier, Alexandra, et al.
Published: (2025)

Phase Transition for Stochastic Block Model with more than $\sqrt{n}$ Communities (II)
by: Carpentier, Alexandra, et al.
Published: (2025)

Optimal level set estimation for non-parametric tournament and crowdsourcing problems
by: Graf, Maximilian, et al.
Published: (2024)

On The Complexity of Best-Arm Identification in Non-Stationary Linear Bandits
by: Maynard-Zhang, Leo, et al.
Published: (2026)

Low-degree lower bounds via almost orthonormal bases
by: Carpentier, Alexandra, et al.
Published: (2025)

The Sample Complexity of Multiclass and Sparse Contextual Bandits
by: Erez, Liad, et al.
Published: (2026)

LLM Routing with Dueling Feedback
by: Chiang, Chao-Kai, et al.
Published: (2025)

HyperArm Bandit Optimization: A Novel approach to Hyperparameter Optimization and an Analysis of Bandit Algorithms in Stochastic and Adversarial Settings
by: Karroum, Samih, et al.
Published: (2025)

Riemannian Dueling Optimization
by: Ren, Yuxuan, et al.
Published: (2026)

Computational lower bounds in latent models: clustering, sparse-clustering, biclustering
by: Even, Bertrand, et al.
Published: (2025)