Skip to main navigation Skip to search Skip to main content

Non-deterministic Behavior of Ranking-Based Metrics When Evaluating Embeddings

Anguelos Nicolaou*, Sounak Dey, Vincent Christlein, Andreas Maier, Dimosthenis Karatzas

*Corresponding author for this work

Research output: Chapter in BookChapterResearchpeer-review

Abstract

Embedding data into vector spaces is a very popular strategy of pattern recognition methods. When distances between embeddings are quantized, performance metrics become ambiguous. In this paper, we present an analysis of the ambiguity quantized distances introduce and provide bounds on the effect. We demonstrate that it can have a measurable effect in empirical data in state-of-the-art systems. We also approach the phenomenon from a computer security perspective and demonstrate how someone being evaluated by a third party can exploit this ambiguity and greatly outperform a random predictor without even access to the input data. We also suggest a simple solution making the performance metrics, which rely on ranking, totally deterministic and impervious to such exploits.

Original languageEnglish
Title of host publicationReproducible Research in Pattern Recognition - Second International Workshop, RRPR 2018, Revised Selected Papers
EditorsBertrand Kerautret, Miguel Colom, Daniel Lopresti, Pascal Monasse, Hugues Talbot
Pages71-82
Number of pages12
DOIs
Publication statusPublished - 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11455 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Adversarial
  • Deterministic
  • mAP
  • Performance evaluation
  • Precision
  • Ranking
  • Recall
  • Word spotting

Fingerprint

Dive into the research topics of 'Non-deterministic Behavior of Ranking-Based Metrics When Evaluating Embeddings'. Together they form a unique fingerprint.

Cite this