{"id":"https://openalex.org/W3177658582","doi":"https://doi.org/10.1007/s10994-021-06026-2","title":"On testing transitivity in online preference learning","display_name":"On testing transitivity in online preference learning","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3177658582","doi":"https://doi.org/10.1007/s10994-021-06026-2","mag":"3177658582"},"language":"en","primary_location":{"id":"doi:10.1007/s10994-021-06026-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10994-021-06026-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10994-021-06026-2.pdf","source":{"id":"https://openalex.org/S62148650","display_name":"Machine Learning","issn_l":"0885-6125","issn":["0885-6125","1573-0565"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10994-021-06026-2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024369205","display_name":"Bj\u00f6rn Haddenhorst","orcid":"https://orcid.org/0000-0002-4023-6646"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Bj\u00f6rn Haddenhorst","raw_affiliation_strings":["Heinz Nixdorf Institute and Department of Computer Science, Paderborn University, Paderborn, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4023-6646","affiliations":[{"raw_affiliation_string":"Heinz Nixdorf Institute and Department of Computer Science, Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005338669","display_name":"Viktor Bengs","orcid":"https://orcid.org/0000-0001-6988-6186"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Viktor Bengs","raw_affiliation_strings":["Heinz Nixdorf Institute and Department of Computer Science, Paderborn University, Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Heinz Nixdorf Institute and Department of Computer Science, Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059439673","display_name":"Eyke H\u00fcllermeier","orcid":"https://orcid.org/0000-0002-9944-4108"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Eyke H\u00fcllermeier","raw_affiliation_strings":["Department of Computer Science, University of Munich (LMU), Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Munich (LMU), Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5024369205"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10483651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"110","issue":"8","first_page":"2063","last_page":"2084"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.8656944036483765},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7949026823043823},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5338726043701172},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47934919595718384},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.4636005461215973},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4497721195220947},{"id":"https://openalex.org/keywords/preference","display_name":"Preference","score":0.4301036596298218},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3749576508998871},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.333132803440094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32499897480010986},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3221397399902344},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3030630350112915},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1398892104625702},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11571097373962402}],"concepts":[{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.8656944036483765},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7949026823043823},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5338726043701172},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47934919595718384},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.4636005461215973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4497721195220947},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.4301036596298218},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3749576508998871},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.333132803440094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32499897480010986},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3221397399902344},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3030630350112915},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1398892104625702},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11571097373962402},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10994-021-06026-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10994-021-06026-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10994-021-06026-2.pdf","source":{"id":"https://openalex.org/S62148650","display_name":"Machine Learning","issn_l":"0885-6125","issn":["0885-6125","1573-0565"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning","raw_type":"journal-article"},{"id":"pmh:oai:epub.ub.uni-muenchen.de:91501","is_oa":true,"landing_page_url":"https://epub.ub.uni-muenchen.de/91501/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401845","display_name":"Open access LMU (Ludwid Maxmilian's Universitat Munchen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I8204097","host_organization_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","host_organization_lineage":["https://openalex.org/I8204097"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Machine Learning","raw_type":"doc-type:article"}],"best_oa_location":{"id":"doi:10.1007/s10994-021-06026-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10994-021-06026-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10994-021-06026-2.pdf","source":{"id":"https://openalex.org/S62148650","display_name":"Machine Learning","issn_l":"0885-6125","issn":["0885-6125","1573-0565"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5199999809265137,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G4034638064","display_name":null,"funder_award_id":"317046553","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320324816","display_name":"Universit\u00e4t Paderborn","ror":"https://ror.org/058kzsd48"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3177658582.pdf","grobid_xml":"https://content.openalex.org/works/W3177658582.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W43928053","https://openalex.org/W79079207","https://openalex.org/W145096669","https://openalex.org/W1532391944","https://openalex.org/W1815702575","https://openalex.org/W1994486739","https://openalex.org/W2006683286","https://openalex.org/W2009979684","https://openalex.org/W2011350083","https://openalex.org/W2012037220","https://openalex.org/W2013784666","https://openalex.org/W2044493620","https://openalex.org/W2045026797","https://openalex.org/W2049934117","https://openalex.org/W2063445365","https://openalex.org/W2079170310","https://openalex.org/W2081828561","https://openalex.org/W2136874873","https://openalex.org/W2145284847","https://openalex.org/W2164545125","https://openalex.org/W2167770337","https://openalex.org/W2171811879","https://openalex.org/W2184294966","https://openalex.org/W2249408652","https://openalex.org/W2255843478","https://openalex.org/W2572029201","https://openalex.org/W2602753196","https://openalex.org/W2614730337","https://openalex.org/W2624688904","https://openalex.org/W2666788291","https://openalex.org/W2739497747","https://openalex.org/W2751647711","https://openalex.org/W2763110165","https://openalex.org/W2803936341","https://openalex.org/W2829790400","https://openalex.org/W2883737864","https://openalex.org/W2932291267","https://openalex.org/W2950929549","https://openalex.org/W2963486287","https://openalex.org/W2964287878","https://openalex.org/W3015812362","https://openalex.org/W3128351426","https://openalex.org/W4230704549","https://openalex.org/W4236654676","https://openalex.org/W4256232412","https://openalex.org/W6601741120","https://openalex.org/W6631727996","https://openalex.org/W6673974147","https://openalex.org/W6740105432","https://openalex.org/W6743680971","https://openalex.org/W6750481014","https://openalex.org/W6753379124","https://openalex.org/W6761282680"],"related_works":["https://openalex.org/W4297795770","https://openalex.org/W1947281443","https://openalex.org/W2123134119","https://openalex.org/W1553139688","https://openalex.org/W2767187055","https://openalex.org/W2383282217","https://openalex.org/W2362009423","https://openalex.org/W4205262062","https://openalex.org/W2061331082","https://openalex.org/W2002629668"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"efficiency":[2,193],"of":[3,18,22,67,81,95,99,115,124,155,194],"state-of-the-art":[4],"algorithms":[5],"for":[6,121,145],"the":[7,46,53,65,79,82,93,111,146,152,192,195,199],"dueling":[8,147],"bandits":[9,148],"problem":[10,94],"is":[11,28,38,48,60,210],"essentially":[12],"due":[13],"to":[14,30,40,51,63,77,131,189,213],"a":[15,32,42,74,168,176,214],"clever":[16],"exploitation":[17],"(stochastic)":[19],"transitivity":[20,101,158,181],"properties":[21],"pairwise":[23],"comparisons:":[24],"If":[25],"one":[26],"arm":[27],"likely":[29,39,50],"beat":[31,41,52],"second":[33],"one,":[34,44],"which":[35,151],"in":[36,102,150],"turn":[37],"third":[43,54],"then":[45],"first":[47],"also":[49],"one.":[55],"By":[56],"now,":[57],"however,":[58],"there":[59],"no":[61],"way":[62],"test":[64],"validity":[66,154],"corresponding":[68],"assumptions,":[69],"although":[70],"this":[71,89,138],"would":[72],"be":[73,160],"key":[75],"prerequisite":[76],"guarantee":[78],"meaningfulness":[80],"results":[83],"produced":[84],"by":[85,174],"an":[86,103,142,187,205],"algorithm.":[87,197],"In":[88,198],"paper,":[90],"we":[91,140,185],"investigate":[92],"testing":[96,119,196],"different":[97],"forms":[98,123],"stochastic":[100,125,135,157,180],"online":[104],"manner.":[105],"We":[106],"derive":[107],"lower":[108],"bounds":[109],"on":[110,133,167],"expected":[112,206],"sample":[113,207],"complexity":[114,208],"any":[116],"sequential":[117],"hypothesis":[118,171],"algorithm":[120],"various":[122],"transitivity,":[126],"thereby":[127],"providing":[128],"additional":[129],"motivation":[130],"focus":[132],"weak":[134,156,179],"transitivity.":[136],"To":[137],"end,":[139],"introduce":[141],"algorithmic":[143],"framework":[144],"problem,":[149],"statistical":[153],"can":[159],"tested,":[161],"either":[162],"actively":[163],"or":[164],"passively,":[165],"based":[166],"multiple":[169],"binomial":[170],"test.":[172],"Moreover,":[173],"exploiting":[175],"connection":[177],"between":[178],"and":[182],"graph":[183],"theory,":[184],"suggest":[186],"enhancement":[188],"further":[190],"improve":[191],"active":[200],"setting,":[201],"both":[202],"variants":[203],"achieve":[204],"that":[209],"optimal":[211],"up":[212],"logarithmic":[215],"factor.":[216]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}