Towards Data Science

When Labels Say No, But Embeddings Say Yes

The article "When Labels Say No, But Embeddings Say Yes" discusses how conventional retrieval metrics can overlook meaningful similarities between items. It highlights the limitations of relying solely on labels for evaluation and suggests that embeddings can capture nuanced relationships that labels miss. The piece underscores the importance of considering alternative metrics to better assess similarity in data retrieval tasks.

Towards Data Science
Oct 14

How Do Word Embeddings Capture Relationships Between Words?

The article explores how word embeddings encode relationships between words within a learned vector space. It explains the mechanisms by which words become related through their positions and distances in that space. The post provides insights into the underlying processes that allow embeddings to capture semantic connections.

By Nikhil Dasari
Towards Data Science
Aug 20

Three Kinds of RAG Corpus, and What It Costs to Build for the Wrong One

The article explains that enterprise document intelligence can be categorized into three distinct corpus types, each requiring a specific architecture. It outlines how to determine the shape of a document collection through three key questions. The piece also discusses the costs associated with building a system for the incorrect corpus type.

By angela shi
Towards Data Science
Aug 26

How Does a RAG Reranker Really Work?

The article "How Does a RAG Reranker Really Work?" explores the inner workings of Retrieval-Augmented Generation (RAG) rerankers, focusing on how data scientists explain the model’s operations behind the scenes. It discusses the impact of these insights on architecture decisions within enterprise document intelligence, specifically in the context of Enterprise Document Intelligence Vol.1 #2D. The piece highlights the importance of transparent model explanations for effective enterprise RAG implementation.

By Kezhan Shi
arXiv AI
Sep 1

E-SENS: Exclusion-Sensitive Penalization for Negative-Constraint Retrieval

E‑SENS is a training‑free reranking technique designed to improve negative‑constraint retrieval in retrieval‑augmented language models. It works by extracting a compact ‘trap query’ that represents the excluded concept and subtracting the similarity of this trap query from the original retrieval score, thereby reducing the influence of documents that mention the excluded concept. Experiments on the ExcluIR benchmark demonstrate that E‑SENS achieves a clear recall‑violation trade‑off across four embedding models and effectively reduces trap retrieval while preserving recall.

By Yerang Kim, Jiyoon Myung, Joohyung Han