Retrieval-augmented generation

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

6,375 stories · RSS feed

arXiv Computation and Language
Sep 11

Leveraging LLMs for Context-Aware Implicit Textual and Multimodal Hate Speech Detection

The paper explores using a large language model (LLM) to generate background context for social media posts and tests four ways to integrate this context into a Sentence-BERT (SBERT) hate‑speech detection classifier. The methods include text concatenation, embedding concatenation, hierarchical transformer fusion, and LLM‑driven text enhancement. Experiments on the Latent Hatred dataset of implicitly hateful tweets and the MAMI dataset of misogynous memes show that adding generated context can raise F1 scores by up to 3 points in textual and 6 points in multimodal settings compared to a zero‑context baseline, with embedding concatenation yielding the best results.

By Joshua Wolfe Brook, Ilia Markov
arXiv AI
Sep 11

The Menu Is an Execution Prior: State-Path Tool Menus for Online Agents

The paper introduces the State-Path Tool Menu, a method that presents agents with a short, ordered subset of tools before execution, ensuring that both the final action and its prerequisite tools are available in a usable sequence. By learning a pre‑execution route from the request state to the desired outcome, the menu acts as an execution prior, encoding which tools can run from the current state, how outputs satisfy later inputs, and recurring orders from training paths. Experiments on ToolBench show that this approach boosts online success from 0.737 to 0.898 and outperforms several baselines while covering more complete tool chains with fewer tools.

By Bo Yan, Weikai Lin, Song Wang
arXiv AI
Sep 11

Query Brand Entity Linking in E-Commerce Search

The paper "Query Brand Entity Linking in E-Commerce Search" addresses the challenge of matching short, unstructured user search queries to the correct brand entities in large e‑commerce catalogs. It proposes two scalable solutions: a cascaded pipeline that first detects brand mentions and then disambiguates them, and a single‑stage extreme multiclass classifier that directly maps queries to brand identifiers. Extensive multilingual evaluation and an online experiment show that both methods significantly improve brand recall while preserving high precision, resulting in measurable gains in customer engagement.

By Dong Liu, Sreyashi Nag
arXiv Computation and Language
Sep 11

IndicTriMix: Developing Language Identification Datasets and Models for Tri-Language Code-Mixing

IndicTriMix presents a new benchmark and models for token‑level language identification in tri‑language code‑mixed text involving Hindi, Gujarati, and Bengali. The authors reformulate the task as sequence labeling and fine‑tune transformer models MuRIL and XLM‑RoBERTa, evaluating them on manually annotated test sets. They also introduce two code‑mixing generation methods using parallel sentences and release the datasets and fine‑tuned models for public use.

By Pruthwik Mishra, Rudra Trivedi, Avi Patel, Ashok Urlana, Shrikant Malviya
arXiv Computation and Language
Sep 11

Towards Reliable Medical LLMs: Benchmarking and Enhancing Confidence Estimation of Large Language Models in Medical Consultation

The paper introduces the first benchmark for evaluating confidence estimation in large language models during multi‑turn medical consultations, combining three types of medical data and an information sufficiency gradient to capture how confidence and correctness evolve as evidence accumulates. Experiments with 27 methods reveal that token‑level and consistency‑level confidence approaches are limited by medical data, and that medical reasoning must be judged on both diagnostic accuracy and information completeness. Building on these findings, the authors propose MedConf, a retrieval‑augmented, linguistically grounded self‑assessment framework that aligns patient information with supporting, missing, and contradictory relations, producing interpretable confidence estimates that outperform existing methods across multiple datasets and LLMs.

By Zhiyao Ren, Yibing Zhan, Siyuan Liang, Guozheng Ma, Baosheng Yu, Dacheng Tao
arXiv Statistics ML
Sep 11

Learning-Based Surrogate Method for Stochastic Optimization under Decision-Dependent Uncertainty with Adaptive Random Designs

The paper introduces a learning-based surrogate approach for stochastic optimization problems where uncertainty depends on the decision, modeled via a nonparametric regression. It constructs a surrogate that embeds iteratively updated Jacobian estimates, using an adaptive random design that focuses sampling near the current iterate to achieve dimension‑independent convergence of the Jacobian estimates. The resulting learning‑based stochastic prox‑linear (L‑SPL) algorithm demonstrates nonasymptotic convergence rates and outperforms existing methods in sample efficiency and objective value in numerical experiments.

By Boyang Shen, Junyi Liu
arXiv Computation and Language
Sep 11

CMNIE: An Information Extraction Benchmark for Chinese Military News

CMNIE is a new benchmark for extracting structured information from Chinese military news, covering event triggers, arguments, named entities, and entity relations under a unified schema. The dataset contains 13,000 manually annotated instances with 7 event types, 10 argument roles, 7 entity types, and 8 relation types. Experiments show that current supervised models, zero‑shot LLMs, and fine‑tuned LLMs struggle with relation extraction and exact span matching, highlighting the challenge of joint structured extraction in this domain.

By Yan Yu, Mengna Zhu, Zhenyu Song, Hao Yang, Haiwen Chen, Mao Wang
arXiv Computation and Language
Sep 11

MisEdu-RAG: A Misconception-Aware Dual-Hypergraph RAG for Novice Math Teachers

MisEdu‑RAG is a dual‑hypergraph retrieval‑augmented generation framework designed to help novice math teachers diagnose and remediate student misconceptions. It structures pedagogical knowledge as a concept hypergraph and real student mistake cases as an instance hypergraph, performing two‑stage retrieval to ground responses in both layers. On the MisstepMath dataset, MisEdu‑RAG outperforms baseline models, improving token‑F1 by 10.95% and achieving up to 15.3% higher quality across five dimensions, especially in diversity and empowerment.

By Zhihan Guo, Yuting Lu, Jionghao Lin
arXiv Computer Vision
Sep 11

FastMap: Real-Time Semantic Map Completion via Bitwise Masked Modeling

FastMap is a lightweight two‑stage framework that completes top‑down categorical semantic maps in real time. It first compresses map patches into compact bitwise tokens using a lookup‑free BitVAE, producing a 0.41 GB model that is 3.7× smaller than prior masked‑modeling baselines. A Masked AutoEncoder transformer then reconstructs missing tokens in a single forward pass (0.011 s per map), and an object‑aware masking strategy enables goal‑conditioned generation without extra inference cost. On the Gibson benchmark, FastMap attains 34.10 % mIoU and 45.84 % semantic Success Rate, more than doubling the previous best, and achieves an 83.8 % Success Rate on downstream ObjectNav, the highest among compared navigation methods.

By Yijie Deng, Shuaihang Yuan, Congcong Wen, Hao Huang, Anthony Tzes
arXiv Computation and Language
Sep 11

Augustinian BabyLM: What Ostensive Definition Can and Cannot Teach a Small Language Model

The paper introduces an experiment where a small masked language model (DeBERTa) is initialized with visual embeddings for tokens that correspond to image regions, following St. Augustine’s ostensive definition of word learning. The visual initialization leaves a measurable imprint that persists through training, yet it does not improve performance on most BabyLM benchmarks that test abstract grammatical knowledge. However, the seeded models show a consistent advantage in zero‑shot object‑property tasks and in a custom Visual‑Property Swap benchmark that probes color, material, size, and shape knowledge, with the advantage confined to the seeded words and transferable to newly seeded words.

By Lisa Bylinina
arXiv Machine Learning
Sep 11

A Dynamic Fusion Large Language Model for Traffic Flow Prediction

The paper introduces DF-LLM, a Dynamic Fusion Large Language Model designed for traffic flow prediction. It combines a spatiotemporal embedding module, a fusion module that uses graph convolution to capture spatial topology and dynamic dependencies, and an LLM backbone with differentiated parameter adaptation and context aggregation attention. Experiments on four datasets demonstrate that DF-LLM outperforms existing methods in predictive accuracy.

By Xue Qiu, Jianli Xiao
arXiv Computation and Language
Sep 11

LLM-Anchored Paralinguistic Enrichment for Alzheimer's Disease Detection

The paper introduces LLM-Anchored Paralinguistic Enrichment (LAPE), a method that enhances language model representations with speech-based paralinguistic cues such as pauses and word elongations. LAPE incorporates three innovations: prosodic event textualization, lexico-prosodic unitization and chunking, and text-anchored paralinguistic fusion using NormGate. Evaluations on the ADReSS and ADReSSo datasets show that LAPE achieves state‑of‑the‑art performance in detecting Alzheimer’s disease from speech.

By Xiao Wei, Yuqin Lin, Yaru Cao, Jinyu Li, Bin Wen, Kai Li, Yueying Chen, Longbiao Wang, Jianwu Dang
arXiv Machine Learning
Sep 11

VikingRAG: Accurate and Token-efficient Retrieval-augmented Generation over Structured Documents

VikingRAG is a directory‑aware semantic data management system that reduces token usage in retrieval‑augmented generation by tightly integrating semantic and structural access. It employs multi‑round retrieval traces as reusable experience edges and an adaptive escalation strategy to avoid unnecessary multi‑round exploration. Experiments show that VikingRAG achieves comparable accuracy to state‑of‑the‑art methods while using only 11.6%–51.9% of their tokens, and further reductions to 5.1%–32.5% with trace reuse and escalation.

By Peiyuan Gao, Gaoyuan Zhang, Haojie Qin, Yahui Sun, Qianyi Zhang, Yunhao Zhang, Zeyu Wang, Wei Lu
arXiv Computation and Language
Sep 11

Xiaomi-CocktailASR-1 Technical Report

Xiaomi-CocktailASR-1 is an LLM-based end‑to‑end target‑speaker ASR architecture that uses reference speech as voiceprint prompts to transcribe a target speaker directly from mixed audio, eliminating the need for speech separation. It retains competitive single‑speaker performance comparable to mainstream ASR models and introduces a negative sample rejection capability, outputting empty text when the target speaker is absent. The system also supports a Chain‑of‑Thought reasoning mode and achieves state‑of‑the‑art performance on synthetic and real‑world multispeaker benchmarks, effectively addressing the cocktail party problem with a unified architecture.

By Yiru Zhang, Hang Su, Lichun Fan, Ying Zeng, Chang Liu, Yifeng Wang, Yuquan Liang, Tao Li, Lian Li, Wenhao Yang, Jian Luan, Cong Zou, Heng Qu
arXiv Computer Vision
Sep 11

SegKAN: High-Resolution Medical Image Segmentation with Long-Distance Dependencies

SegKAN is a new model for high‑resolution medical image segmentation that tackles fragmentation and noise in hepatic vessel CT scans. It replaces the standard embedding module with a novel convolutional network to smooth noise and avoid gradient explosion, and reinterprets spatial relationships between Patch blocks as temporal relationships to better capture positional dependencies. Experiments on a hepatic vessel dataset show a 1.78% improvement in Dice score over the current state‑of‑the‑art model, indicating that the new structure enhances segmentation performance for extended objects.

By Shengbo Tan, Rundong Xue, Shipeng Luo, Zeyu Zhang, Xinran Wang, Lei Zhang, Daji Ergu, Zhang Yi, Yang Zhao, Ying Cai
arXiv Machine Learning
Sep 11

AI Economist Agent: An Agentic Framework for Evidence-Based Economic and Financial Analysis with RAG, Knowledge Graphs, and Large Language Models

The paper introduces an AI economist agent that integrates large language models, retrieval‑augmented generation, knowledge graphs, and quantitative models to conduct evidence‑based economic and financial scenario analysis. The framework orchestrates LLM agents to plan analyses, retrieve relevant evidence, and structure economic mechanisms, while registered quantitative models produce numerical outcomes and predefined tests validate intermediate results for inclusion in the final report. Applied to European macro‑financial stress scenarios and bank capital analysis, the empirical study demonstrates the agent’s ability to combine flexible evidence retrieval and scenario construction while maintaining traceability to sources and explicit model calculations.

By Masahiro Kato
arXiv Machine Learning
Sep 11

Enabling Knowledge Graph Understanding at Scale with the EXplore Your Graphs ENgine (EXYGEN)

The paper introduces EXYGEN, a framework that enables conversational access to large knowledge graphs by combining VoID descriptions, ShEx schemas, retrieved triples, and example question‑query pairs in a retrieval‑augmented generation pipeline. On the SciQA benchmark, this approach achieves an exact‑match score of 0.419 without fine‑tuning any large language model, and shows that larger general‑purpose LLMs can outperform smaller code‑specialized ones when provided sufficient context. To scale metadata generation for very large KGs, the authors propose a predicate‑coverage‑aware parallel graph sampling strategy that preserves structural diversity, reduces runtime by over 80× on OpenCitations Meta and GESIS, and is the only tractable method for obtaining complete metadata on ORKG.

By Harshdeep Singh, Yurui Zhu, Giovanni Colavizza, Matteo Romanello
arXiv Machine Learning
Sep 11

When do cheap embeddings beat protein language models? A theoretically-grounded hashing sketch for biological sequence classification

The paper introduces Murmur2Vec, a lightweight, alignment‑free embedding that uses k‑mer counts hashed with MurmurHash to create a compact representation for biological sequences. It provides a full theoretical analysis, including bias/variance formulas, a Johnson–Lindenstrauss‑style concentration bound, and an excess‑risk bound that clarifies the trade‑off between hash‑table size and classifier performance. Empirically, Murmur2Vec matches or surpasses a fine‑tuned 650M‑parameter ESM‑2 protein language model across several classification tasks, including SARS‑CoV‑2 spike lineage and HIV‑1 Env subtype identification.

By Sarwan Ali, Taslim Murad, Imdadullah Khan, Safi Faizullah
arXiv Machine Learning
Sep 11

Project Qualia: Recovering Experiential Music Structure from Session Co-occurrence Data

Project Qualia investigates whether experiential similarity between songs can be extracted from listening behavior. Using 1.29 billion scrobbles from 9,396 users, the authors trained a Word2Vec model (Song2Vec) on session data, then applied an artist‑residual procedure to isolate artist‑independent signals. The residual embeddings still contained strong cross‑artist similarity, forming coherent genre and era clusters, demonstrating that experiential structure exists beyond artist identity.

By Nizam Mohammed, Abu B. S. Rahman, Dimuthu D. K. Arachchige
arXiv Machine Learning
Sep 11

Sequence-Informed Geometric Evaluation of RNA 3D Structures

The paper introduces SIRGE, a sequence-informed geometric evaluator for RNA 3D structures that integrates nucleotide embeddings from a pretrained RNA language model into structural representations. SIRGE demonstrates superior performance over existing evaluators in Kendall–τ alignment, Top‑1 selection, and Top‑3 ranking. Controlled experiments reveal that sequence conditioning corrects errors of a purely geometric model and enhances target‑level ranking, suggesting that pretrained sequence representations provide complementary ranking information to geometric reasoning.

By Andrea Zerio, Yighua Yao, Alessandro Micheli, Roland G. Huber, Mile Sikic, Samir Bhatt, Andres R. Masegosa, Yuangang Pan