arXiv AI

FinDialogLens: Event Extraction over Multi-Party Dialogue for Missed-Trade Identification in Financial Chatrooms

arXiv AI
Jul 22

BatchDAG: LLM-Planned Execution Graphs for Scalable Ad-Hoc Analysis Over Enterprise Data

arXiv:2607. 18241v1 Announce Type: new Abstract: Large language models (LLMs) excel at analyzing individual documents but break down on exhaustive, cross-entity analytical questions over enterprise-scale datasets due to context overflow, loss of per-entity attribution, and linear latency from sequential tool calls.

By Anupreet Walia
arXiv AI
Sep 30

Mnemon: Raw Records, Fast Judgments, Slow Thoughts

Mnemon is a memory agent that stores conversations as raw, dated records and uses a fast System 1 decision model (Jev) to quickly judge the relevance of records, while a slow System 2 LLM plans searches and composes answers. The agent consolidates records into topic timelines and value histories in the background, enabling efficient retrieval without rewriting conversations into structured formats. Experiments show Mnemon achieving high scores on LoCoMo and LongMemEval‑S with low context length and cost, and Jev outperforming LLMs in evidence separation and speed.

By Guangren Wang
arXiv AI
Oct 7

AgentMemGate: Addressing Speculation Contamination in Conversational Assistant Memory

AgentMemGate is a write-time gate for conversational AI assistants that prevents speculation contamination in long‑term memory by classifying extracted statements as speculation, completed event, correction, or other. Speculations are kept outside memory until conditions allow promotion or deletion. The approach eliminates observed contamination and improves task accuracy from 65% to 95% on core benchmarks, with further gains on a harder held‑out set.

By Chirag Sharma, Benjamin Fowlersmith, Karime Maamari
arXiv Computation and Language
Aug 25

DelistBench: Evaluating Search-Enabled LLMs for Auditable Corporate-Event Database Completion

The paper introduces Search-to-Record, a database‑assurance task where search‑enabled large language models reconstruct corporate‑event records from public sources, and DelistBench, a 1,200‑record benchmark for security‑level delisting announcements. Five models were evaluated in both closed‑book and web‑enabled settings, showing that web access improves announcement‑date accuracy by 34.0–48.0 percentage points and event‑status accuracy by 2.8–21.7 points, with the best system achieving 81.5% overall joint accuracy within seven days. The study also demonstrates that low‑cost web systems can approach the best system’s accuracy and that risk‑based triage can identify low‑error subsets, though a significant portion of cases still requires review.

By Xuan Yao, Li Shuping, Dai Yang, Zhou Yi, Ke-Wei Huang
arXiv AI
Oct 7

Evaluating Escalation Signals for LLM Routing: Targets, Controls, and Five Ways to Fool Yourself

The paper investigates whether semantic entropy—a measure of disagreement among a language model’s sampled answers—can serve as a cheap signal for deciding when to route a query from a small to a larger language model. Experiments on GSM8K and other benchmarks show that semantic entropy can distinguish small‑model mistakes and improve routed accuracy, but the authors also reveal that a simple question‑difficulty rule can mimic its performance and that other factors (definition of success, benchmark design, live sampling cost) can undermine its effectiveness. They propose a checklist of checks to validate escalation signals and demonstrate how to predict when a cached‑outcome approach will fail. "whyItMatters":"The study highlights the importance of rigorous evaluation of escalation signals, showing that seemingly promising metrics can be misleading without proper controls and that practical routing decisions must account for cost and benchmark design."

By Ramin Pishehvar, Andrea Morandi, Mahesh Viswanathan
arXiv AI
Jun 18

Decoupling Search from Reasoning: A Vendor-Agnostic Grounding Architecture for LLM Agents

arXiv:2606. 18947v1 Announce Type: new Abstract: Production LLM agents increasingly depend on real-time search, yet native search grounding bundles retrieval policy, provider choice, evidence injection, cost, latency, and generation behavior behind a single model-provider boundary.

By Emmanuel Aboah Boateng, Kyle MacDonald, Amardeep Kumar, Siddharth Kodwani, Sudeep Das