pith. sign in

arxiv: 1412.6568 · v3 · pith:L7L75S7Inew · submitted 2014-12-20 · 💻 cs.CL · cs.LG

Improving zero-shot learning by mitigating the hubness problem

classification 💻 cs.CL cs.LG
keywords mappedvectorszero-shotcorrectimagelabelsneighboursproblem
0
0 comments X
read the original abstract

The zero-shot paradigm exploits vector-based word representations extracted from text corpora with unsupervised methods to learn general mapping functions from other feature spaces onto word space, where the words associated to the nearest neighbours of the mapped vectors are used as their linguistic labels. We show that the neighbourhoods of the mapped elements are strongly polluted by hubs, vectors that tend to be near a high proportion of items, pushing their correct labels down the neighbour list. After illustrating the problem empirically, we propose a simple method to correct it by taking the proximity distribution of potential neighbours across many mapped vectors into account. We show that this correction leads to consistent improvements in realistic zero-shot experiments in the cross-lingual, image labeling and image retrieval domains.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adversarial Hubness in Multi-Modal Retrieval

    cs.CR 2024-12 unverdicted novelty 7.0

    Adversarial hubs can be generated to be retrieved as top-1 for over 84% of test queries in text-to-image retrieval, far exceeding natural hubs.

  2. SATTC: Structure-Aware Label-Free Test-Time Calibration for Cross-Subject EEG-to-Image Retrieval

    cs.CV 2026-03 conditional novelty 6.0

    SATTC improves top-k accuracy in cross-subject EEG-to-image retrieval by fusing geometric whitening and structural nearest-neighbor experts on the similarity matrix without labels.

  3. Unsupervised Adversarial Graph Alignment with Graph Embedding

    cs.SI 2019-07 unverdicted novelty 6.0

    UAGA aligns two graph embedding spaces via adversarial training in a fully unsupervised setting, with an incremental extension iUAGA that uses discovered pseudo-anchors to refine both embeddings and alignments.

  4. One Single Hub Text Breaks CLIP: Identifying Vulnerabilities in Cross-Modal Encoders via Hubness

    cs.CL 2026-04 unverdicted novelty 5.0

    A single hub text can unreasonably match many images in CLIP-based similarity, exposing vulnerabilities in cross-modal encoders for caption evaluation and retrieval.