FLARE: Task-agnostic embedding model evaluation through a normalization process
Not on the map. Why?
Abstract (arXiv)
When task-specific labels are not available, it becomes difficult to select an embedding model for a specific target corpus. Existing labelless measures based on kernel estimators or Gaussian mixes fail in high-dimensional space, resulting in unstable rankings. We propose a flow-based labelless representation embedding evaluation (FLARE), which utilizes normalized streams to estimate information sufficiency directly from log-likelihood and avoid distance-based density estimation. We give a finite sample boundary, indicating that the estimation error depends on the intrinsic dimension of the data manifold rather than the original embedding dimension. On 11 datasets and 8 embedders, FLARE reached Spearman's ρ of 0.90 under the supervised benchmark and remained stable in high-dimensional embeddings (d ≥ 3,584) as the existing labelless baseline collapsed.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 32 references that are in the map. First posted on arXiv 19 Apr 2026.
Builds on
22 of 32 references.
References · 22
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2015Variational Inference with Normalizing Flowscited by 2,161
- 2016Density estimation using Real NVPcited by 2,029
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
- 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,216
- 2024M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillationcited by 1,050
- 2023Towards General Text Embeddings with Multi-stage Contrastive Learningcited by 705
- 2019Neural Spline Flowscited by 590
- 2019On Variational Bounds of Mutual Informationcited by 550
- 2019Intrinsic dimension of data representations in deep neural networkscited by 276
10 more
- 2020CLUB: A Contrastive Log-ratio Upper Bound of Mutual Informationcited by 233
- 2024Generative Representational Instruction Tuningcited by 227
- 2025On the Theoretical Limitations of Embedding-Based Retrievalcited by 98
- 2021IsoScore: Measuring the Uniformity of Embedding Space Utilizationcited by 52
- 2025FinMTEB: Finance Massive Text Embedding Benchmarkcited by 18
- 2025Almost AI, Almost Human: The Challenge of Detecting AI-Polished Writingcited by 17
- 2021Scaling Properties of Deep Residual Networkscited by 16
- 2024AIR-Bench: Automated Heterogeneous Information Retrieval Benchmarkcited by 12
- 2024When is an Embedding Model More Promising than Another?cited by 7
- 2025BhashaBench V1: A Comprehensive Benchmark for the Quadrant of Indic Domainscited by 6
Built on by
Not cited yet.