Skip to content

#RAG

0 today

Jun 10Wednesday

r/LocalLLaMA

ICML paper on predictable hallucination gate and ntkMirror open-weight implementation

An ICML 2026 paper presents an ISR=1 answer-abstain gate for evidence-grounded QA, and ntkMirror implements it for local open-weight models with multiple evidence orderings, reporting 0.0–0.7% hallucination at about 24% abstention in the held-out audit.

Why it matters: An ICML paper gates abstention on answer instability across repeated evidence orderings, and ships a training-free open implementation.

Jun 7Sunday

AI HOT (Curated Pool)

Harness-1: A 20B Stateful Retrieval Subagent Trained with Reinforcement Learning

UIUC and Chroma released Harness-1, a 20B-parameter retrieval subagent trained with reinforcement learning inside a stateful search harness, reporting 0.730 average curated recall across 8 benchmarks, 11.4 percentage points above the next-best open-source subagent and behind only Opus-4.6.

Why it matters: Harness-1 from UIUC and Chroma uses reinforcement learning to train a 20B-parameter retrieval sub-agent that remembers its last action during search before deciding the next query.

Jun 6Saturday

AI HOT (Curated Pool)

Google launches Agentic RAG framework for Gemini Enterprise Agent Platform

Google Research and Google Cloud introduced the Cross-Corpus Retrieval framework as Agentic RAG for Gemini Enterprise Agent Platform, using a multi-agent workflow to plan, rewrite, route, and iteratively search multiple data sources, with up to 34% higher accuracy than standard RAG on factual datasets.

Why it matters: Google Research and Google Cloud split retrieval across multiple agents on the Gemini enterprise agent platform, beating conventional RAG by up to 34% accuracy on factual datasets.

May 19Tuesday

Xinzhiyuan · WeChat

CUHK and Zhejiang University Question Whether AI Agent Memory Is Just a Memo

CUHK and Zhejiang University researchers argue that mainstream Agent memory is retrieval-based memo storage, not true memory, citing an Ω(k²) case requirement for compositional tasks and a PoisonedRAG result where 5 adversarial texts reached a 90% attack success rate.

Why it matters: Researchers at CUHK and Zhejiang University argue that mainstream AI agent memory modules are just retrieval-style memo pads, and that multi-step compositional tasks need a number of cases growing with k², pushing cost up.

May 15Friday

r/LocalLLaMA

MOOSE-Star (ICML 2026): 7B Model and 108K-Paper Dataset for Scientific Hypothesis Discovery

MiroMind researchers released the MOOSE-Star collection with three 7B models and TOMATO-Star, a dataset of 108,717 NCBI papers. MS-IR-7B reaches 54.37% inspiration-retrieval accuracy, uses DeepSeek-R1-Distill-Qwen-7B as its base, runs at about 14GB fp16, and supports llama.cpp, vLLM, and SGLang.

Why it matters: MiroMind released three 7B MOOSE-Star models and the 108,717-paper TOMATO-Star dataset, with weights and data available for reuse in scientific hypothesis discovery.

Apr 27Monday

Hacker News front page

TurboQuant: A First-Principles Walkthrough

TurboQuant walkthrough explains compressing AI vectors to 2–4 bits per coordinate. It uses random rotation to map high-dimensional coordinates to a fixed distribution, then reuses one codebook with no scale overhead, training, or calibration.

Why it matters: TurboQuant compresses high-dimensional vectors to 2 to 4 bits per coordinate, fixing the coordinate distribution with a random rotation and using a universal codebook instead of per-group scaling, with no training or calibration.

Apr 18Saturday

QbitAI · WeChat

RAG retrieves the right docs but still answers wrong? Saarland University team diagnoses why | ACL 2026

A Saarland University-led team introduced Disco-RAG, adding a 3-step “reading” layer between retrieval and generation, and says the paper was accepted as an ACL 2026 main-conference long paper. The post says it uses RST-based argument trees, cross-passage relation graphs, and outline generation with zero training; it reports gains on Loong, ASQA, and SciNews, but does not fully disclose the exact scores. The key claim is that many RAG failures come from reading and discourse understanding, not retrieval recall.

Why it matters: A Saarland University team traces RAG errors to document understanding in the generation step and proposes Disco-RAG, which builds argument trees with rhetorical structure theory and a cross-paragraph relation graph, with no extra training.