Dense Vector Retrieval Models

Dense Vector Retrieval Models is a retrieval framework that represents queries and documents as dense, low-dimensional vectors in a continuous semantic space, enabling relevance scoring through geometric similarity measures rather than sparse term-based matching.

11

Publications

3.3K

Citations

56

Authors

15

Institutions

Publications per year

2017–2026

11

Authors

56

  1. VK
    Vladimir Karpukhin

    Meta (Israel), Israel

    3 publications · 3.1K citations

    3

    h-index

  2. PL
    Patrick Lewis

    Meta (Israel), Israel

    3 publications · 3.1K citations

    3

    h-index

  3. SR
    Sebastian Riedel

    University College London, United Kingdom

    3 publications · 3.1K citations

    3

    h-index

  4. HK
    Heinrich Küttler

    Meta (Israel), Israel

    2 publications · 3K citations

    2

    h-index

  5. TR
    Tim Rocktäschel

    University College London, United Kingdom

    2 publications · 3K citations

    2

    h-index

1–5 of 56

Venues

  1. arXiv (Cornell University)

    Repository · 2 publications · 3.1K citations

    2

    h-index

  2. 1

    h-index

  3. Big Data and Cognitive Computing

    1 publications · 45 citations

    1

    h-index

  4. 1

    h-index

  5. UCL Discovery (University College London)

    Repository · 1 publications · 18 citations

    1

    h-index

1–5