Generic Exploration and K-armed Voting Bandits

No abstract is available for this paper.

• Publication year

  2013

• Venue

  International Conference on Machine Learning

• Publication date

  2013-06-16

• Fields of study

  Computer Science, Economics

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Wiley Series in Probability and Statistics

  2012cited by this paper
• Large-scale validation and analysis of interleaved search evaluation

  2012cited by this paper
• The K-armed Dueling Bandits Problem

  2012influential reference
• Bandits with an Edge

  2011cited by this paper
• Beat the Mean Bandit

  2011influential reference
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

  2010cited by this paper
• UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem

  2010cited by this paper
• Best Arm Identification in Multi-Armed Bandits

  2010cited by this paper
• Interactively optimizing information retrieval systems as a dueling bandits problem

  2009cited by this paper
• Exploration-exploitation tradeoff using variance estimates in multi-armed bandits

  2009cited by this paper
• A Short Introduction to Computational Social Choice

  2007cited by this paper
• Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems

  2006cited by this paper
• Evaluating Retrieval Performance Using Clickthrough Data

  2003cited by this paper
• Finite-time Analysis of the Multiarmed Bandit Problem

  2002influential reference
• PAC Bounds for Multi-armed Bandit and Markov Decision Processes

  2002influential reference
• Computing with Noisy Information

  1994cited by this paper
• On Selecting the Largest Element in Spite of Erroneous Information

  1987cited by this paper
• Probability inequalities for sum of bounded random variables

  1963cited by this paper
• Asymptotically Efficient Adaptive Allocation Rules

  year unknowninfluential reference
• Author's Personal Copy Theoretical Computer Science Pure Exploration in Finitely-armed and Continuous-armed Bandits

  year unknowncited by this paper

• Fusing Reward and Dueling Feedback in Stochastic Bandits

  2025cites this paper
• Reinforcement Learning from Adversarial Preferences in Tabular MDPs

  2025cites this paper
• Human-in-the-loop: Real-time Preference Optimization

  2025cites this paper
• Clustering Items through Bandit Feedback: Finding the Right Feature out of Many

  2025cites this paper
• Continuum-armed Bandit Optimization with Batch Pairwise Comparison Oracles

  2025cites this paper
• Multi-Armed Bandits Meet Large Language Models

  2025cites this paper
• Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits

  2025cites this paper
• Beyond Numeric Awards: In-Context Dueling Bandits with LLM Agents

  2024cites this paper
• Towards Improved Preference Optimization Pipeline: from Data Generation to Budget-Controlled Regularization

  2024cites this paper
• Biased Dueling Bandits with Stochastic Delayed Feedback

  2024cites this paper
• A Tutorial on Multi-Armed Bandit Applications for Large Language Models

  2024cites this paper
• Bandits with Preference Feedback: A Stackelberg Game Perspective

  2024cites this paper
• Multi-Player Approaches for Dueling Bandits

  2024cites this paper
• Non-Stationary Dueling Bandits Under a Weighted Borda Criterion

  2024cites this paper
• Provable Multi-Party Reinforcement Learning with Diverse Human Feedback

  2024cites this paper
• When Can We Track Significant Preference Shifts in Dueling Bandits?

  2023cites this paper
• Identifying Copeland Winners in Dueling Bandits with Indifferences

  2023influential citation
• Federated Analytics Informed Distributed Industrial IoT Learning With Non-IID Data

  2023cites this paper
• Active Ranking of Experts Based on their Performances in Many Tasks

  2023cites this paper
• Direct Preference-Based Evolutionary Multi-Objective Optimization with Dueling Bandit

  2023cites this paper
• Borda Regret Minimization for Generalized Linear Dueling Bandits

  2023cites this paper
• Batched Dueling Bandits

  2022cites this paper
• Active Evaluation: Efficient NLG Evaluation with Few Pairwise Comparisons

  2022cites this paper
• An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem

  2022cites this paper
• Dirichlet–Luce choice model for learning from interactions

  2022cites this paper
• Non-Stationary Dueling Bandits

  2022cites this paper
• Dueling Bandits with Adversarial Sleeping

  2021cites this paper
• Optimal Algorithms for Stochastic Contextual Preference Bandits

  2021cites this paper
• Personalizing over-the-counter hearing aids using pairwise comparisons.

  2021cites this paper
• Testification of Condorcet Winners in dueling bandits

  2021cites this paper
• Stochastic Dueling Bandits with Adversarial Corruption

  2021cites this paper
• Regret Minimization in Stochastic Contextual Dueling Bandits

  2020cites this paper
• DUELING BANDIT PROBLEMS

  2020cites this paper
• Choice Bandits

  2020cites this paper
• On the Sample Complexity of Testing for the Existence of the Condorcet Winner in Dueling Bandits

  2020cites this paper
• An Optimal Elimination Algorithm for Learning a Best Arm

  2020cites this paper
• Dueling Bandits: From Two-dueling to Multi-dueling

  2020cites this paper
• Best-item Learning in Random Utility Models with Subset Choices

  2020cites this paper
• Bandit algorithms in information retrieval evaluation and ranking

  2019cites this paper
• Top-κ selection with pairwise comparisons

  2019cites this paper
• Ordinal Monte Carlo Tree Search

  2019cites this paper
• From PAC to Instance-Optimal Sample Complexity in the Plackett-Luce Model

  2019cites this paper
• Regret Minimisation in Multinomial Logit Bandits

  2019cites this paper
• Bandits in the Plackett-Luce Model

  2019cites this paper
• Bandit Algorithms in Information Retrieval

  2019cites this paper
• Simple Algorithms for Dueling Bandits

  2019cites this paper
• Combinatorial Bandits with Relative Feedback

  2019cites this paper
• Duelling Bandits with Weak Regret in Adversarial Environments

  2018influential citation
• Online Evaluation of Rankers Using Multileaving

  2018cites this paper
• MergeDTS

  2018influential citation
• Dueling Bandits with Qualitative Feedback

  2018cites this paper
• Preference-based Online Learning with Dueling Bandits: A Survey

  2018influential citation
• Merge Double Thompson Sampling for Large Scale Online Ranker Evaluation

  2018cites this paper
• PAC Battling Bandits in the Plackett-Luce Model

  2018cites this paper
• Advancements in Dueling Bandits

  2018cites this paper
• Approximate Ranking from Pairwise Comparisons

  2018cites this paper
• Factored Bandits

  2018cites this paper
• Decentralized Exploration in Multi-Armed Bandits

  2018cites this paper
• PAC-Battling Bandits with Plackett-Luce: Tradeoff between Sample Complexity and Subset Size

  2018cites this paper
• Efficient Mechanisms for Peer Grading and Dueling Bandits

  2018cites this paper
• Decoy Bandits Dueling on a Poset

  2018cites this paper
• Active Ranking with Subset-wise Preferences

  2018cites this paper
• Maxing and Ranking with Few Assumptions

  2017cites this paper
• Regret Analysis for Continuous Dueling Bandit

  2017cites this paper
• Maximum Selection and Ranking under Noisy Comparisons

  2017cites this paper
• Online Learning for the Control of Human Standing via Spinal Cord Stimulation

  2017cites this paper
• Multi-dueling Bandits with Dependent Arms

  2017cites this paper
• Dueling bandits for online ranker evaluation

  2017influential citation
• Bandits multi-armés avec rétroaction partielle

  2017influential citation
• Dueling Bandits with Weak Regret

  2017cites this paper
• Verification Based Solution for Structured MAB Problems

  2016cites this paper
• Instance-dependent Regret Bounds for Dueling Bandits

  2016cites this paper
• Active Ranking from Pairwise Comparisons and the Futility of Parametric Assumptions

  2016cites this paper
• Decoy Bandits Dueling on a Poset

  2016cites this paper
• Active ranking from pairwise comparisons and when parametric assumptions do not help

  2016influential citation
• Dueling Bandits: Beyond Condorcet Winners to General Tournament Solutions

  2016influential citation
• Network of Bandits

  2016cites this paper
• Double Thompson Sampling for Dueling Bandits

  2016cites this paper
• Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm

  2016influential citation
• Indistinguishable Bandits Dueling with Decoys on a Poset

  2016cites this paper
• Search Engines that Learn from Their Users

  2016cites this paper
• Multi-Dueling Bandits and Their Application to Online Ranker Evaluation

  2016cites this paper
• Network of Bandits insure Privacy of end-users

  2016cites this paper
• Utility-based Dueling Bandits as a Partial Monitoring Game

  2015cites this paper
• Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach

  2015cites this paper
• Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem

  2015influential citation
• Bandit Forest

  2015cites this paper
• MergeRUCB: A Method for Large-Scale Online Ranker Evaluation

  2015influential citation
• Contextual Dueling Bandits

  2015influential citation
• Random Forest for the Contextual Bandit Problem

  2015cites this paper
• A Relative Exponential Weighing Algorithm for Adversarial Utility-based Dueling Bandits

  2015cites this paper
• Sparse Dueling Bandits

  2015cites this paper
• NEXT: A System for Real-World Development, Evaluation, and Application of Active Learning

  2015cites this paper
• Decision Tree Algorithms for the Contextual Bandit Problem

  2015cites this paper
• Copeland Dueling Bandits

  2015cites this paper
• The Analysis of Adaptive Data Collection Methods for Machine Learning

  2015cites this paper
• Preference-Based Rank Elicitation using Statistical Models: The Case of Mallows

  2014cites this paper
• Relative confidence sampling for efficient on-line ranker evaluation

  2014influential citation
• A Survey of Preference-Based Online Learning with Bandit Algorithms

  2014cites this paper
• PAC Rank Elicitation through Adaptive Sampling of Stochastic Pairwise Preferences

  2014cites this paper