mlsanityData to 7 Oct 2026

Expertise Trees Resolve Knowledge Limitations in Collective Decision-Making

arXiv 2305.01063 ↗First posted 2 May 2023cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Experts advising decision-makers are likely to display expertise which varies as a function of the problem instance. In practice, this may lead to sub-optimal or discriminatory decisions against minority cases. In this work we model such changes in depth and breadth of knowledge as a partitioning of the problem space into regions of differing expertise. We provide here new algorithms that explicitly consider and adapt to the relationship between problem instances and experts' knowledge. We first propose and highlight the drawbacks of a naive approach based on nearest neighbor queries. To address these drawbacks we then introduce a novel algorithm - expertise trees - that constructs decision trees enabling the learner to select appropriate models. We provide theoretical insights and empirically validate the improved performance of our novel approach on a range of problems for which existing methods proved to be inadequate.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 7 of its 29 references that are in the map. First posted on arXiv 2 May 2023.

Builds on

7 of 29 references.

References · 7

  1. 2014OpenML: networked science in machine learningcited by 523
  2. 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 195
  3. 2013Finite-Time Analysis of Kernelised Contextual Banditscited by 177
  4. 2018Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Samplingcited by 166
  5. 2015Explore no more: Improved high-probability regret bounds for non-stochastic banditscited by 120
  6. 2021Towards Unbiased and Accurate Deferral to Multiple Expertscited by 71
  7. 2021Dealing with Expert Bias in Collective Decision-Makingcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.