arXiv AI

Ad Insertion in LLM-Generated Responses

arXiv Computation and Language
Sep 1

WildSEEK: Evaluating Language Models for Information-Seeking

WildSEEK is a new dataset of 3,000 real user information‑seeking queries, manually annotated for risk‑sensitive domains and whether the query is factoid or analytical. The accompanying evaluation framework tests LLM responses against four failure criteria—sycophantic behavior, overreliance, a default US‑centric perspective, and poor handling of vulnerable populations—finding higher failure rates for analytical queries. The authors also train classifiers on WildSEEK to analyze over 1.8 million realistic queries, revealing that more than a third are high‑risk and often analytical.

By Tanise Ceron, Joachim Baumann, Elisa Bassignana, Berat Cabuk, Dirk Hovy, Debora Nozza
arXiv AI
Jul 24

Benchmarking the Personalization Capabilities of Large Language Models

arXiv:2607. 20471v1 Announce Type: new Abstract: Personalization, the act of varying a message to induce action from a specific receiver while keeping sender, channel, and time fixed, has a long tradition in psychology and marketing as a two-party problem in which sender and receiver have independent objectives.

By Ashutosh Srivastava, Siddharth Yedlapati, Vinay Aggarwal, Yaman Kumar Singla, Shashwat Dixit, Jitendra Ajmera, Balaji Krishnamurthy
arXiv Machine Learning
Aug 28

Token-Level Advertising

The paper introduces the Latent Advertiser Mixture Auction (LAMA), a token‑level advertising framework that integrates advertiser influence directly into the text generation process. Advertisers provide local continuation values that shape next‑token policies, and the platform decodes these through a latent mixture while updating an allocation posterior. LAMA is shown to satisfy Markov DSIC and IR, achieve near‑optimal KL‑regularized welfare, and, in proof‑of‑concept experiments on commercial‑search queries, improve platform welfare and revenue without compromising user‑facing response quality.

By Hanbing Liu, Bowei Zhang, Changyuan Yu, Yinyu Ye, Qi Qi
arXiv Machine Learning
Oct 5

Intent-Hiding Jailbreaks: An Information-Theoretic Framework for Compositional Attacks

The paper introduces an information‑theoretic framework for studying intent‑hiding jailbreaks against large language models. It defines prior‑posterior matching, where auxiliary tasks are chosen so that the average probability of harmful intent in a bundle matches the overall prior, thereby concealing a harmful target. The authors analyze both query‑independent and query‑dependent settings, proving computational hardness for exact matching, deriving a water‑filling solution for fractional weights, and evaluating the trade‑off between bundle size and target preservation across several open‑source models.

By Fengwei Tian, Ravi Tandon
arXiv AI
Sep 12

Demystifying the Privacy-Utility Trade-off in LLM Interactions

The paper investigates how privacy-preserving sanitization of user context in large language model (LLM) interactions affects downstream performance. It identifies three mechanisms—Context‑Dependent Utility, Strategic Adaptation, and Combinatorial Interplay—that explain when and how to sanitize data. Based on these insights, the authors propose an intent‑driven local protection framework using a lightweight model (Veilmind‑4B) to dynamically extract, sanitize, and restore context, achieving lower privacy leakage while maintaining higher utility than existing baselines.

By Zhenhua Liu, Zhanxu Xie, Junjie Yu, Tong Zhu, Lijun Li, Wenliang Chen
arXiv Machine Learning
Jul 14

One Token Is Enough: Fingerprinting and Verifying Large Language Models from Single-Token Output Distributions

arXiv:2607. 10252v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly consumed through opaque serving chains - API aggregators, resellers, and inference providers - in which the client has no technical means to confirm that the model answering is the model advertised, and recent audits show that a substantial fraction of commercial endpoints deviate from the vendor's reference weights.

By Tomas Bruckner