arXiv AI

Human Preference aligned Tabular Similarity

arXiv:2607. 24880v1 Announce Type: cross Abstract: Task-agnostic tabular embeddings are increasingly used for similarity search in real-world business systems such as Product Lifecycle Management (PLM).

arXiv Machine Learning
Sep 4

Towards Universal Tabular Embeddings: A Benchmark Across Data Tasks

The paper introduces TEmBed, a unified benchmark for evaluating tabular embeddings across four representation levels—cell, row, column, and table—using a diverse set of models. It demonstrates that the best model depends on the specific task and representation level, providing practical guidance for selecting embeddings in real-world applications. The study aims to facilitate the development of more general-purpose tabular representation models.

By Liane Vogel, Kavitha Srinivas, Niharika D'Souza, Sola Shirai, Oktie Hassanzadeh, Horst Samulowitz
arXiv Machine Learning
Oct 23

PAIR: Preference-Aligned Intent Retrieval for Premium People Recommendation at LinkedIn

The paper introduces PAIR, a retrieval framework that aligns with user intent preferences rather than relying on profile similarity for premium people recommendation on LinkedIn. It uses an exposure‑conditioned multi‑negative contrastive objective and incorporates click history with positional encoding to update user representations efficiently. The model, with 0.6 B parameters, achieves a MAR@100 of 0.45 on LinkedIn’s premium retrieval task.

By Zhongkai Shangguan, Yanbin Kang, Yihan Cao, Ruijie Jiang, Qiannan Yin, Chang Yue, Zijian Zhou, Girish Kathalagiri, Changshuai Wei, Zhengming Xing
arXiv AI
Aug 26

Preference Data Selection for Mitigating the Alignment Tax in Large Language Models

The paper introduces BALIGN, a balanced data selection strategy designed to reduce catastrophic forgetting—referred to as the alignment tax—in large language models during preference-based alignment. By analyzing preference optimization gradients, the authors identify three data-centric features that influence parameter drift: the reference model's log-probability margin, token length differences between chosen and rejected responses, and TF‑IDF similarity to general capability corpora. BALIGN aggregates these features into a composite risk score to filter out high-risk preference samples, thereby preserving foundational capabilities while maintaining alignment gains with minimal computational overhead.

By Minsu Kim, Jianxun Lian, Xing Xie, Steven Euijong Whang
arXiv Computation and Language
Aug 27

E2Rank: Unifying Text Embedding and Listwise Reranking for Effective and Efficient Search

E2Rank (Efficient Embedding-based Ranking) is a unified framework that extends a single text embedding model to perform both retrieval and listwise reranking. By treating the listwise prompt—constructed from the query and its top‑K candidates—as a pseudo‑relevance feedback query, E2Rank reranks via cosine similarity against precomputed document embeddings, avoiding costly autoregressive decoding. The approach achieves state‑of‑the‑art results on BEIR, competitive performance on the reasoning‑intensive BRIGHT benchmark, lower latency than existing LLM‑based rerankers, and improved embedding performance on MTEB—all within a single model.

By Qi Liu, Yanzhao Zhang, Mingxin Li, Dingkun Long, Pengjun Xie, Jiaxin Mao