Saltar a la navegació principal Saltar a la cerca Vés al contingut principal

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

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

*Autor corresponent d’aquest treball

Producció científica: Capítol de llibreCapítolRecercaAvaluat per experts

Resum

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.

Idioma originalAnglès
Títol de la publicacióReproducible Research in Pattern Recognition - Second International Workshop, RRPR 2018, Revised Selected Papers
EditorsBertrand Kerautret, Miguel Colom, Daniel Lopresti, Pascal Monasse, Hugues Talbot
Pàgines71-82
Nombre de pàgines12
DOIs
Estat de la publicacióPublicada - 2019

Sèrie de publicacions

NomLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volum11455 LNCS
ISSN (imprès)0302-9743
ISSN (electrònic)1611-3349

Fingerprint

Navegar pels temes de recerca de 'Non-deterministic Behavior of Ranking-Based Metrics When Evaluating Embeddings'. Junts formen un fingerprint únic.

Com citar-ho