Saved in:
Bibliographic Details
Main Authors: Mironov, Mikhail, Prokhorenkova, Liudmila
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2410.14556
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915342436007936
author Mironov, Mikhail
Prokhorenkova, Liudmila
author_facet Mironov, Mikhail
Prokhorenkova, Liudmila
contents This paper addresses the problem of quantifying diversity for a set of objects. First, we conduct a systematic review of existing diversity measures and explore their undesirable behavior in certain cases. Based on this review, we formulate three desirable properties (axioms) of a reliable diversity measure: monotonicity, uniqueness, and continuity. We show that none of the existing measures has all three properties and thus these measures are not suitable for quantifying diversity. Then, we construct two examples of measures that have all the desirable properties, thus proving that the list of axioms is not self-contradictory. Unfortunately, the constructed examples are too computationally expensive (NP-hard) for practical use. Thus, we pose an open problem of constructing a diversity measure that has all the listed properties and can be computed in practice or proving that all such measures are NP-hard to compute.
format Preprint
id arxiv_https___arxiv_org_abs_2410_14556
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Measuring Diversity: Axioms and Challenges
Mironov, Mikhail
Prokhorenkova, Liudmila
Machine Learning
This paper addresses the problem of quantifying diversity for a set of objects. First, we conduct a systematic review of existing diversity measures and explore their undesirable behavior in certain cases. Based on this review, we formulate three desirable properties (axioms) of a reliable diversity measure: monotonicity, uniqueness, and continuity. We show that none of the existing measures has all three properties and thus these measures are not suitable for quantifying diversity. Then, we construct two examples of measures that have all the desirable properties, thus proving that the list of axioms is not self-contradictory. Unfortunately, the constructed examples are too computationally expensive (NP-hard) for practical use. Thus, we pose an open problem of constructing a diversity measure that has all the listed properties and can be computed in practice or proving that all such measures are NP-hard to compute.
title Measuring Diversity: Axioms and Challenges
topic Machine Learning
url https://arxiv.org/abs/2410.14556