Skip to content
Open access

DESS: A Robust Uncertainty Layer for Embedding-Space Models

Aug 2026 · KI - Künstliche Intelligenz · 0 citations · 8 references

TL;DR

DESS is introduced, a lightweight uncertainty layer that augments an existing embedding model with a predicted mean vector and an independent per-dimension spread vector that provides a modular, geometry-aware uncertainty layer for embedding-space models, provided its spread is calibrated to local embedding geometry.

Abstract

Embedding-space systems usually retrieve, rank, or recommend from a single point representation, even when the task would benefit from uncertainty or controlled diversity. We introduce DESS, a lightweight uncertainty layer that augments an existing embedding model with a predicted mean vector and an independent per-dimension spread vector. DESS is trained with deterministic element-wise losses, requires no sampling during training, and maps inference-time samples back to available outputs by nearest-neighbor selection, leaving the trained predictor decoupled from a fixed output dictionary. The central question is whether such a simple diagonal uncertainty layer is meaningful and safe in high-dimensional embedding spaces. We show that the learned spread captures real local geometry: on 20 Newsgroups sentence-transformer embeddings, it is strongly rank-correlated with empirical within-class variation (Spearman $$\rho = 0.94$$ ). However, it is not epistemic uncertainty: the spread norm performs at chance for held-out-class OOD detection (AUROC 0.49). We then show that inference-time sampling is governed by concentration of measure, with sample displacement concentrating near the spread-vector norm. This yields a training-set geometric rule for choosing the spread multiplier $$\beta $$ , which predicts the safe sampling regime on AG News. On SQID/ESCI reranking, the strongest DESS variant preserves the frozen SBERT query embedding as the mean and learns only local spread; with $$\beta = 0.09$$ , sampled reranking matches the SBERT-text baseline without surpassing multimodal fusion or cross-encoder systems. DESS therefore provides a modular, geometry-aware uncertainty layer for embedding-space models, provided its spread is calibrated to local embedding geometry.

Read PDF

Similar papers

Open access 2026

Progressive Multi-Objective Optimization for Improved t-SNE Embeddings

A progressive multi-objective optimization framework is proposed that enhances t-SNE by integrating complementary loss functions, including a ranking-aware divergence (KLmax) and a Wasserstein-based term for global alignment.

S. Belhaouari, Skander Bensegueni, Lyes Fennour et al. · 0 citations
Book Open access Jul 2026

Scaling and Stabilizing Large-Scale Embedding-Based Retrieval

A unified pipeline deployed at Walmart that addresses both signal quality and model evolution is presented, and a Warm-Start Distillation technique that transfers domain-specific expertise from the legacy model to the new backbone is introduced.

Zhen Yang, Juexin Lin, Hongwei Shang et al. · 1 citation
Open access Aug 2026

Do Retrieval-Trained Embeddings Help Linear Contextual Bandits?

Text embeddings from retrieval-tuned (dual-encoder) models are increasingly used as context features in contextual bandits for recommendation, on the assumption that an embedding space optimized for inner-product similarity will speed up a linear exploration policy. This study tests that assumption with a controlled, shared-encoder design: the same BERT-base model in two forms, vanilla (mean-pooled) and retrieval-fine-tuned (MS MARCO dot-product), used as frozen bandit context. Experiments span three datasets (MIND, MovieLens-1M, Amazon CDs and Vinyl), two linear policies (LinUCB and linear Thompson sampling), and two dimensionality-reduction methods (PCA and random projection), over 20 seeds. Neither the training objective nor the reduction method determines performance on its own; cumulative regret is governed by their interaction, which is dataset-dependent. On MovieLens the reduction reverses the encoder ranking (PCA favors the retrieval-tuned encoder, random projection the vanilla one), with large effects in both directions, while on MIND the encoders are close. The reduction method can be the larger lever, moving up to 34% of the learnable margin. A ridge-regression probe on the candidate contexts screens the reduction choice offline, without running the bandit. For linear exploration policies, the encoder and the reduction should be treated as a joint choice rather than assuming retrieval-tuned embeddings are universally preferable.

Mustafa Canim · 0 citations
Preprint Aug 2026

Beyond a Bag of Features: Set-Level Instability in Sparse Autoencoders

It is found that SAE activation sets do not recover human category boundaries or within-category typicality more faithfully than dense embeddings or residual-stream states, but instead track model-internal similarity structure.

Nikolai Bolik, Lennart Stöpler, Artur Andrzejak · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.