Retrieval-augmented generation

Retrieval pipelines, vector search, chunking and reranking: how models are grounded in a corpus instead of their weights.

6,126 stories · RSS feed

arXiv Machine Learning
Oct 8

Leaner Transformers Can Easily Learn to Cluster

arXiv:2610. 09760v1 Announce Type: new Abstract: Transformers have in-context learning capabilities, where some known learning algorithms can be executed in the forward pass through the model.

By Charlotte Park, Kenneth L. Clarkson, Lior Horesh, Takuya Ito, Parikshit Ram
arXiv AI
Oct 7

CausalBind: Causal Modeling and Learning for Protein-Molecule Virtual Screening

CausalBind introduces a causal modeling framework for protein‑molecule virtual screening that focuses on sparse cross‑modality interactions rather than dense holistic alignment. By formalizing a V‑structure causal model with Heckman‑style selection, the authors prove that latent interaction concepts are identifiable only under sparsity constraints and propose three implementation variants. Experiments on DUD‑E and LIT‑PCBA benchmarks demonstrate that all variants outperform strong retrieval baselines, especially in early enrichment and out‑of‑distribution generalization.

By Loka Li, Jin Tian, Kun Zhang
arXiv AI
Oct 7

STRUCTURALCOST: A controlled reading time dataset for modeling human sentence processing difficulty

STRUCTURALCOST is a self‑paced reading dataset comprising 475 participants and 40,800 observations that isolates the processing cost of long‑distance subject‑verb dependency resolution. The study replicates a known psycholinguistic finding at NLP scale: human reading times at the main verb increase with dependency length, driven by syntactic embedding beyond linear distance. Various language models—n‑gram, SSMs, and transformers—partially mirror this graded difficulty profile but consistently underestimate the integration cost humans incur, a gap that persists across architectures and model sizes.

By Nina Nusbaumer, Iria de-Dios-Flores, Corentin Bel, Christophe Pallier, Guillaume Wisniewski, Beno\^it Crabb\'e
arXiv Machine Learning
Oct 7

Beyond Marginal Monitoring: Distributed Joint-Distribution Testing for Data Concept Drift in Large Scale E-Commerce Operations

The paper evaluates five multivariate two-sample drift detectors on large‑scale e‑commerce data, including a 137.5‑million‑row Trendyol feature table. Distributed Maximum Mean Discrepancy with Random Fourier Features on Apache Spark shows strong performance, achieving a Pearson correlation of 0.940 with expected drift magnitude, an 80.4% true positive rate, and a 3.2% false positive rate. In contrast, the per‑dimension Kolmogorov‑Smirnov test fails due to statistic saturation from ID‑like columns, and detectors struggle under weak drift configurations, underscoring limitations in current sampling designs and sensitivity analysis.

By Cagdas Pullu, Mahmut Emir Arslan, Bugra Balkac, Aylin Ondersev Balta, Cihangir Celal Palaci, Fikri Cem Yilmaz, Altan Cakir
arXiv Machine Learning
Oct 7

Multi-Probe Zero Collision Hash (MPZCH): Mitigating Embedding Collisions and Enhancing Model Freshness in Large-Scale Recommenders

The paper introduces Multi-Probe Zero Collision Hash (MPZCH), an indexing mechanism that uses linear probing to reduce or eliminate collisions in embedding tables for large-scale recommendation systems. MPZCH employs auxiliary tensors and CUDA kernels to support configurable probing and active eviction, thereby retiring obsolete IDs and resetting reassigned slots to prevent stale embeddings. Experiments show that MPZCH achieves zero collisions for user embeddings, improves item embedding freshness and quality, and maintains training and inference performance comparable to existing methods.

By Ziliang Zhao, Bi Xue, Emma Lin, Tianqi Lu, Mengjiao Zhou, Kaustubh Vartak, Shakhzod Ali-Zade, Tao Li, Bin Kuang, Rui Jian, Bin Wen, Dennis van der Staay, Yixin Bao, Xiujin Li, Chao Deng, Henry Wei, Songbin Liu, Qifan Wang, Kai Ren
arXiv Machine Learning
Oct 7

Reperesentation Geometry Matters for Planning with JEPA World Models

The paper introduces SCALE (State-CAlibrated Latent Embeddings), a technique that aligns pairwise latent distances with task-relevant state-space distances in joint-embedding predictive world models. By adding SCALE to the LeWorldModel (LeWM) objective, the authors preserve LeWM’s architecture while ensuring that latent geometry reflects meaningful task outcomes. Experiments demonstrate that SCALE improves planning success across manipulation and navigation tasks with various solvers, and the authors analyze how the method reshapes representation geometry to support planning.

By Jiaming Hu, Yan Zheng, Shi Bo, Tian Wang, Florian Dubost, Alejandro Mottini, Junze Liu, Arvind Srinivasan, Kai Zhong, Kun Qian, Sharon Gao, Qingjun Cui
arXiv Computation and Language
Oct 7

Forecasting the Growth of Social Media Information Cascades: Towards Human-in-the-Loop Misinformation Triage

The paper presents a method for early triage of misinformation by forecasting the future growth of social media information cascades from the first 30 minutes of activity. Using features such as node count, structural depth entropy, and temporal arrival entropy, the combined model improves predictive accuracy on 352 test trees, especially for high‑activity cascades. Additionally, the study analyzes early reply patterns in PHEME threads and evaluates evidence retrieval in a Check‑COVID setting, proposing an integrated human‑review system that leverages these early signals for misinformation triage.

By Ansh Gupta, Abhiram Gorle, Aayush Rajesh, Tsachy Weissman
arXiv Computation and Language
Oct 7

Enhancing High-order Interaction Awareness in LLM-based Recommender Model

The paper introduces ELMRec, an enhanced LLM-based recommender that improves high-order interaction awareness by using whole-word embeddings to better interpret graph-constructed user-item interactions without graph pre-training. It also identifies that LLMs tend to prioritize earlier user interactions over recent ones and proposes a reranking solution. ELMRec achieves superior performance compared to state-of-the-art methods in both direct and sequential recommendation tasks.

By Xinfeng Wang, Jin Cui, Fumiyo Fukumoto, Yoshimi Suzuki
arXiv Computer Vision
Oct 7

Beyond the Embedding Bottleneck: Adaptive Retrieval-Augmented 3D CT Report Generation

The paper identifies a representational bottleneck in 3D CT embeddings that limits pathology coverage in automated radiology reports. It introduces AdaRAG-CT, an adaptive retrieval-augmented framework that supplements visual features with controlled textual retrieval to improve report generation. On the CT-RATE benchmark, AdaRAG-CT achieves state‑of‑the‑art clinical efficacy, raising Clinical F1 from 0.420 to 0.480.

By Renjie Liang, Yiling Ma, Yang Xing, Zhengkang Fan, Jinqian Pan, Chengkun Sun, Li Li, Kuang Gong, Jie Xu