scientific article; zbMATH DE number 7370524
From MaRDI portal
Publication:4998871
Viktor Bengs, Adil El Mesaoudi-Paul, Eyke Hüllermeier, Róbert Busa-Fekete
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1807.11398
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
rankingonline learningPAC learningmulti-armed banditspreference learningsample complexitycumulative regretexploration/exploitationtop-\(k\) selection
Related Items (3)
Multi-armed bandits with censored consumption of resources ⋮ Generalized transitivity: a systematic comparison of concepts with an application to preferences in the Babington Smith model ⋮ On testing transitivity in online preference learning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kullback-Leibler upper confidence bounds for optimal sequential allocation
- An asymptotically optimal policy for finite support models in the multiarmed bandit problem
- Combinatorial bandits
- The \(K\)-armed dueling bandits problem
- Statistical methods for ranking data
- Asymptotically efficient adaptive allocation rules
- Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
- Top-\(\kappa\) selection with pairwise comparisons
- Statistical issues in measurement
- Active ranking from pairwise comparisons and when parametric assumptions do not help
- Generalized transitivity: a systematic comparison of concepts with an application to preferences in the Babington Smith model
- Efficient algorithms for online decision problems
- A Survey of Preference-Based Online Learning with Bandit Algorithms
- Bandit Online Optimization over the Permutahedron
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
- Selecting a Selection Procedure
- Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
- Online Learning and Online Convex Optimization
- Discrete Choice Methods with Simulation
- NON-NULL RANKING MODELS. I
- Computing with Noisy Information
- Near-Optimal Regret Bounds for Thompson Sampling
- The Nonstochastic Multiarmed Bandit Problem
- 10.1162/153244303321897663
- Bandit Algorithms
- Tournament Solutions
- Partial Monitoring—Classification, Regret Bounds, and Algorithms
- Probability Inequalities for Sums of Bounded Random Variables
- Parallel algorithms for select and partition with noisy comparisons
- Testing Poisson Binomial Distributions
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- A Short Introduction to Computational Social Choice
- Prediction, Learning, and Games
- A Sequential Procedure for Selecting the Population with the Largest Mean from $k$ Normal Populations
- Rank Centrality: Ranking from Pairwise Comparisons
- Some aspects of the sequential design of experiments
- Aggregating inconsistent information
- Quicksort
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication:
