paper-with-me

Papers

Statistical Depth for Ranking and Characterizing Transformer-Based Text Embeddings

2023-10-23 · Parker Seegmiller, Sarah Masud Preum

The popularity of transformer-based text embeddings calls for better statistical tools for measuring distributions of such embeddings. One such tool would be a method for ranking texts within a corpus by centrality, i.e. assigning each text a number signifying how representative that text is of the corpus as a whole. However, an intrinsic center-outward ordering of high-dimensional text representations is not trivial. A statistical depth is a function for ranking k-dimensional objects by measuring centrality with respect to some observed k-dimensional distribution. We adopt a statistical depth to measure distributions of transformer-based text embeddings, transformer-based text embedding (TTE) depth, and introduce the practical use of this depth for both modeling and distributional inference in NLP pipelines. We first define TTE depth and an associated rank sum test for determining whether two corpora differ significantly in embedding space. We then use TTE depth for the task of in-context learning prompt selection, showing that this approach reliably improves performance over statistical baseline approaches across six text classification tasks. Finally, we use TTE depth and the associated rank sum test to characterize the distributions of synthesized and human-generated corpora, showing that five recent synthetic data augmentation processes cause a measurable distributional shift away from associated human-generated text.

📄 PDF Abstract BibTeX arXiv:2310.15010

Code (1)

pkseeg/tte_depth 공식 구현

Tasks

Data AugmentationIn-Context Learningtext-classificationText Classification

Similar Papers 제목 키워드 기반

Theory of Scaling Laws for In-Context Regression: Depth, Width, Context and Time

2025-10-01 · Blake Bordelon, Mary I. Letey, Cengiz Pehlevan arxiv

We study in-context learning (ICL) of linear regression in a deep linear self-attention model, characterizing how performance depends on various computational and statistical resources (width, depth, number of training s…

Statistical Depth Functions for Ranking Distributions: Definitions, Statistical Learning and Applications

2022-01-20 · Morgane Goibert, Stéphan Clémençon, Ekhine Irurozki, Pavlo Mozharovskyi

The concept of median/consensus has been widely investigated in order to provide a statistical summary of ranking data, i.e. realizations of a random permutation $\Sigma$ of a finite set, $\{1,\; \ldots,\; n\}$ with $n\g…

Novel Concepts

DRPose3D: Depth Ranking in 3D Human Pose Estimation

2018-05-23 · Min Wang, Xipeng Chen, Wentao Liu, Chen Qian 외

In this paper, we propose a two-stage depth ranking based method (DRPose3D) to tackle the problem of 3D human pose estimation. Instead of accurate 3D positions, the depth ranking can be identified by human intuitively an…

3D Human Pose Estimation3D Pose EstimationPose Estimation

Statistical Depth Meets Machine Learning: Kernel Mean Embeddings and Depth in Functional Data Analysis

2021-05-26 · George Wynne, Stanislav Nagy

Statistical depth is the act of gauging how representative a point is compared to a reference probability measure. The depth allows introducing rankings and orderings to data living in multivariate, or function spaces. T…

BIG-bench Machine Learning

Composite Re-Ranking for Efficient Document Search with BERT

2021-03-11 · Yingrui Yang, Yifan Qiao, Jinjin Shao, Mayuresh Anand 외

Although considerable efforts have been devoted to transformer-based ranking models for document search, the relevance-efficiency tradeoff remains a critical problem for ad-hoc ranking. To overcome this challenge, this p…

Re-Ranking