mlsanityData to 13 Oct 2026

Gamifying optimization: a Wasserstein distance-based analysis of human search

arXiv 2112.06292 ↗First posted 12 Dec 2021math.OC cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

The main objective of this paper is to outline a theoretical framework to characterise humans' decision-making strategies under uncertainty, in particular active learning in a black-box optimization task and trading-off between information gathering (exploration) and reward seeking (exploitation). Humans' decisions making according to these two objectives can be modelled in terms of Pareto rationality. If a decision set contains a Pareto efficient strategy, a rational decision maker should always select the dominant strategy over its dominated alternatives. A distance from the Pareto frontier determines whether a choice is Pareto rational. To collect data about humans' strategies we have used a gaming application that shows the game field, with previous decisions and observations, as well as the score obtained. The key element in this paper is the representation of behavioural patterns of human learners as a discrete probability distribution. This maps the problem of the characterization of humans' behaviour into a space whose elements are probability distributions structured by a distance between histograms, namely the Wasserstein distance (WST). The distributional analysis gives new insights about human search strategies and their deviations from Pareto rationality. Since the uncertainty is one of the two objectives defining the Pareto frontier, the analysis has been performed for three different uncertainty quantification measures to identify which better explains the Pareto compliant behavioural patterns. Beside the analysis of individual patterns WST has also enabled a global analysis computing the barycenters and WST k-means clustering. A further analysis has been performed by a decision tree to relate non-Paretian behaviour, characterized by exasperated exploitation, to the dynamics of the evolution of the reward seeking process.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 15 of its 61 references that are in the map. First posted on arXiv 12 Dec 2021.

Builds on

15 of 61 references.

References · 15

  1. 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,340
  2. 2020A Review of Uncertainty Quantification in Deep Learning: Techniques, Applications and Challengescited by 817
  3. 2020Efficiently Sampling Functions from Gaussian Process Posteriorscited by 126
  4. 2017Thinking Fast and Slow: Optimization Decomposition Across Timescalescited by 60
  5. 2019Tree-Sliced Variants of Wasserstein Distancescited by 54
  6. 2019Greed is Good: Exploration and Exploitation Trade-offs in Bayesian Optimisationcited by 48
  7. 2015Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Supportcited by 30
  8. 2020Mean-Variance Analysis in Bayesian Optimization under Uncertaintycited by 18
  9. 2019Global optimization via inverse distance weighting and radial basis functionscited by 16
  10. 2015The Human Kernelcited by 11
  11. 2020Wasserstein Exponential Kernelscited by 10
  12. 2018Hybrid Wasserstein Distance and Fast Distribution Clusteringcited by 9
3 more
  1. 2020Modelling Human Active Search in Optimizing Black-box Functionscited by 3
  2. 2019Fortified Test Functions for Global Optimization and the Power of Multiple Runscited by 2
  3. 2021On the use of Wasserstein metric in topological clustering of distributional datacited by 1

Built on by

Not cited yet.