Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On testing transitivity in online preference learning

From MaRDI portal
Publication:2071345
Jump to:navigation, search

DOI10.1007/s10994-021-06026-2OpenAlexW3177658582MaRDI QIDQ2071345

Viktor Bengs, Björn Haddenhorst, Eyke Hüllermeier

Publication date: 28 January 2022

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-021-06026-2


zbMATH Keywords

online learningsequential testingstochastic transitivitypairwise preferencesdueling bandits


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • The \(K\)-armed dueling bandits problem
  • Sequential analysis. Tests and confidence intervals
  • Binary choice probabilities: on the varieties of stochastic transitivity
  • Statistical issues in measurement
  • NON-NULL RANKING MODELS. I
  • Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
  • Asymptotic Behavior of Expected Sample Size in Certain One Sided Tests
  • Optimum Character of the Sequential Probability Ratio Test
  • Sequential Tests of Statistical Hypotheses


This page was built for publication: On testing transitivity in online preference learning

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2071345&oldid=14553101"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 21:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki