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 AI
Oct 7

Massive Activation Gating Channel in Large Language Models

The paper identifies a single input embedding channel, called the massive activation gating channel (MAGC), that controls the emergence of massive activations in large language models. When the MAGC value is sufficiently large or small, the spike feed‑forward network outputs exhibit exceptionally large magnitudes. The authors verify MAGC across six models and provide a theoretical explanation linking the channel to a quadratic form that mixes specific columns of the down‑projection matrix, which produce massive activations.

By Minjia Mao, Shi Chen, Bowen Yin, Xiao Fang
arXiv AI
Oct 7

OTel: Open Telco AI Datasets, Benchmarks, and Models

OTel is an open telecom AI resource that provides derived datasets for retrieval, reranking, instruction tuning, and safety/abstention, along with 30 full‑parameter post‑trained baselines covering 10 embedding models, 3 rerankers, and 17 language models. The project has seen significant community engagement, with over 16 million model downloads and more than 157 media mentions by May 2026. Post‑training on OTel data improves performance across all model families, achieving 93.1% NDCG@10 for embeddings, 0.947 MRR@10 for rerankers, and 87.8% correctness for language models.

By Farbod Tavakkoli, Gregory Diamos, Kenneth Church, David Kanter, Mark Austin, Imtiaz Karim, Mirza Masfiqur Rahman, Merouane Abdelkader Debbah, Zeinab Nezami, Ali Maatouk, Leandros Tassiulas, Rex Ying, Nick Sorros, Louis Powell, Nikolaos Vasiloglou, Ashish Vaswani, Somanshu Singla, Adarsh Chaluvaraju
arXiv AI
Oct 7

ShanLiangRen: A Nutrition Agent for Personalized Daily Meal Planning

ShanLiangRen is a nutrition agent designed to generate personalized daily meal plans that satisfy both user constraints and multidimensional nutritional goals. It transforms dietary specifications, nutrient data, user attributes, and natural language requirements into a constrained planning instance, then uses a retrieval‑augmented generation approach to narrow the candidate set from a large ingredient and recipe space. Finally, it refines plans via Pareto‑guided iterative revisions with an LLM, producing fully quantified meal plans with explicit ingredients, portion sizes, and compliance reports.

By Miao Xie, Xiao Zhang, Yuan Wang, Ruixin Zhu, Chunli Lv
arXiv AI
Oct 7

CACHEFORGE: LLM-Guided End-to-End Generative Cache Replacement Policy for Performance and Hardware Efficiency

CACHEFORGE introduces a novel framework that uses a large language model (LLM) to evolve cache‑replacement policies end‑to‑end. In each iteration, the LLM generates new C++ replacement logic, which is evaluated by a trace‑based simulator and refined through reward shaping, structural checks, and mutation. The resulting policies are compact, hardware‑aware, and outperform existing CRC‑2 baselines on SPEC CPU2006, achieving significant improvements in hit rate and IPC across diverse workloads.

By Kaushal Mhapsekar, Bita Aslrousta, Brijesh Kumar Bhayana, Paula Contreras, Azam Ghanbari, Ethan Goodman, Anna Andriiko, Samira Mirbagher Ajorpaz
arXiv AI
Oct 7

Voice "Cloning" is Style Transfer

arXiv:2605.16578v4 Announce Type: replace-cross Abstract: Artificially generated speech is increasingly embedded in everyday life. Voice cloning in particular enables applications where identity pres...

By Kaitlyn Zhou, Federico Bianchi, Martijn Bartelds, Anna Pot, Yongchan Kwon, James Zou
arXiv Machine Learning
Oct 7

Sample-Optimal Estimation of the Fr\'echet Inception Distance

The paper investigates the sample complexity of estimating the Fréchet Inception Distance (FID) between high‑dimensional Gaussian distributions when one distribution is known. It establishes tight bias and variance bounds for the empirical plug‑in estimator, shows how higher‑order extrapolation reduces bias, and introduces a new Relative Taylor Debiasing (RTD) algorithm that achieves optimal sample complexity. Experiments on synthetic data and ImageNet confirm the theoretical predictions and demonstrate RTD’s superior accuracy with limited samples.

By Ziyun Chen, Jerry Li, Kevin Tian, Yusong Zhu