Register and share your invite link to earn from video plays and referrals.

Search results for RAGツアー
RAGツアー community
One keyword maps to one global community path.
Create community
People
Not Found
Tweets including RAGツアー
RAG and agent memory get used as synonyms. They aren't. RAG reads from a corpus that someone else wrote: docs, a wiki, a product catalogue. The agent only reads. Agent memory starts when the agent writes back: → a preference the user mentioned → the outcome of a task it just finished → a correction someone made to its answer Writing back changes the problem. You now decide what is worth keeping. You merge the new fact with what's already stored, and you handle the old fact it contradicts. Cognee's agent memory guide puts it in one line: "The moment your system starts writing back — capturing facts, recording previous interactions, or storing the outcomes of its own work — you've moved beyond RAG into agentic memory." Read-only retrieval is a search problem. Read-write retrieval is a data-management problem. Read more here:
Show more
RAG's "more precision means more latency" dilemma, tackled by using topics as a compass 🧭 Title: MCompassRAG: Topic Metadata as a Semantic Compass for Paragraph-Level Retrieval URL: 🧭 Overview A metadata-guided retrieval framework that uses topic-level signals as a "semantic compass" to select relevant evidence at the paragraph level. It aims to improve precision and efficiency at the same time. ❓ Challenges Solved RAG faces a precision-vs-efficiency trade-off. ・Fine-grained chunks raise precision but increase candidates, latency, and cost ・Larger chunks reduce candidates but introduce semantic noise from mixed topics This is acute in deep-research tasks needing fast, precise retrieval over large datasets. 💡 Methodology & Proposed Approach ・It enriches chunk representations with topic metadata within the same embedding space ・It uses LLM-teacher distillation to train a lightweight retriever ・This enables topic-aware retrieval with no additional LLM calls at inference time The core is combining metadata with dense embeddings and distilling into a lightweight retriever. 📊 Experimental Results ・Information efficiency: 8.24% average improvement across six benchmarks ・Latency: over 5x lower than the strongest efficient RAG baselines ・Code is available in a public repository It achieves this precision-and-speed balance without extra LLM calls at inference. #RAG# #Retrieval#
Show more
Enterprise RAG needs more than vectors. Hologres stores searchable text with embeddings, uses HGraph for vector retrieval, queries relationships with Cypher, and composes results with SQL. Break free from single-retrieval limits. Deliver a complete "decision evidence package" to significantly boost search efficiency in complex scenarios and elevate business decision-making. 🚀📊 #RAG# #Hologres# #MultiModalSearch#
Show more
Great RAG paper from IBM. There are some really good ideas on how to solve common RAG issues. It's well known that retrievers chunk long documents by length, which discards the hierarchy the document already has. So they propose using a table of contents. A table of contents helps to encodes exactly the global structure that chunking throws away. STAIR uses that table of contents as the addressing scheme for a generative retriever, so the model stores and retrieves information from its own parameters against a structure the corpus supplies. On SearchTome, it reaches Recall@1 of 82.6 percent against 76.9 percent for a fine-tuned Differentiable Search Index, a statistically significant gap, with BM25 at 59.5 percent and DPR at 68.7 percent. Hallucination stays below 0.05 percent, which is the standing objection to generative retrieval and the reason grounding the address space in a real hierarchy is worth the extra structure. The ablations also show it generalizes where very few training samples exist. Paper:
Show more
Cutting RAG inference costs 6x starts with deciding what never reaches the LLM
The weak link in RAG may be the retriever, not the generator. This paper proposes finding evidence by navigating documents instead of searching an index. Title: Retriever-Free Retrieval: Navigating Documents with Decision Models URL: DecisionRAG organizes the corpus as a tree and lets a decision model (Jev) judge many candidates at once, expanding only the top branches. No task-specific training and no first-stage retriever. Three highlights: 🧭 Shared context makes scores comparable Candidates are judged together, so a plausible one scores lower when a clearly better one is present. On MultiDoc2Dial, scoring passages together instead of page by page lifts R@1 from 36.7% to 44.4%. 🌲 Navigation that scales logarithmically With a branching factor of 100, 10^9 passages need about five stages, roughly one second. On Natural Questions, keeping about 15% of clusters matches scoring all pages at about one-fifth of the cost. ⚡ On par or better than GPT-5 reranking, faster and cheaper Natural Questions Hit@1 is 65.4 vs. 60.8 for GPT-5 reranking. Latency is 0.68-1.76 s vs. 11.8-15.0 s. Pruning is irreversible, though, and quality depends on the hierarchy. It reframes retrieval as exploration rather than reranking. #RAG# #InformationRetrieval#
Show more
The path from "RAG is ded" to "Math is ded" was weirdly short.
Jev for RAG in almost all cases you trust the semantic matching capability of Jev more than dot product similarity very useful as the direct similarity metric in small data cases and a great reranker with big data
Show more