Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

Our OSS engineer Clelia Bertelli (๐Ÿฆ€/acc) recently built ๐—น๐—ถ๐˜๐—ฒ๐˜€๐—ฒ๐—ฎ๐—ฟ๐—ฐ๐—ต, a fully local document ingestion and retrieval CLI/TUI application powered by LiteParse โšก litesearch demonstrates how developers can assemble a high-performance, local-first retrieval pipeline using open tools from across the ecosystem: โ€ข Parsing: LiteParse, the fast and accurate document parser...

14,900 Aufrufe โ€ข vor 5 Monaten โ€ขvia X (Twitter)

0 Kommentare

Keine Kommentare verfรผgbar

Kommentare vom Original-Post werden hier angezeigt

ร„hnliche Videos

The latest RAG trend for the current agent harnesses (Codex, Cowork) is to do two passes of document processing to solve a knowledge work task over a data room of documents: 1๏ธโƒฃ A fast and light pass, oftentimes using a free/OSS doc parsing tool. This can be cheaply run across 10-100-1kโ€™s of files, and enables the agent to then do retrieval (e.g. grep, semantic) to find relevant subsets of context. 2๏ธโƒฃ A โ€œjust-in-timeโ€ VLM-based pass. Once the agent finds the relevant pages of context, it will screenshot the documents can call its own VLM (or write code) to dissect the pages. The issue with only using VLM-based OCR tools over massive ad-hoc customer file dumps is that itโ€™s slow and expensive. Doing JIT VLM OCR allows the agent to filter through the data cheaply, but still preserve accuracy for the context thatโ€™s needed for the task. The agent harnesses do two-pass document processing by default using off the shelf-tools: pdf2text as the first pass, and using itself (Opus 5) as the second pass. See the below video where Cowork runs over a bunch of PDFs to answer a question about a benchmark graph in the Kimi k3 paper. The main issues here with the โ€œout of the boxโ€ doc processing these agents offer are: * Opus 5 is not the best VLM for OCR. It is also way too expensive at scale and lacks grounding * The OSS tools like pypdf, pdf2text, may not be versatile enough as the first pass. * The agent will write a lot of throwaway code to rewrite things an OCR tool wouldโ€™ve provided out of the box, like chart processing, bounding boxes, confidence scores, leading to increased cost and speed. We have all the tools within LlamaIndex ๐Ÿฆ™ to help any agent do two-pass document processing with higher accuracy and lower cost. 1๏ธโƒฃ We have liteparse for the first pass - a free/OSS parser written in Rust thatโ€™s faster/more accurate than other OSS parsers, and supports 50+ document types 2๏ธโƒฃ We have LlamaParse for the second pass - an agentic document engine that uses VLMs+harnesses to achieve SOTA in accuracy and cost across various doc parsing and extraction tasks. It can be called from any agent harness as an MCP or skill. It takes in page numbers as input, so that the agent can choose to run LlamaParse over a subset of the doc instead of the full doc as a โ€œzoom-inโ€ pass. Come check it out! LiteParse: LlamaParse: All the relevant docs, including MCP, are here:

Jerry Liu

22,763 Aufrufe โ€ข vor 1 Monat

Web scraping will never be the same. (100% open-source visual search at scale) PixelRAG is a retrieval system that skips HTML parsing completely. Instead of scraping a page into text and embedding chunks, it screenshots the page and retrieves the image. A vision-language model reads the answer straight off the pixels. Why that matters: parsing is where web RAG quietly loses information. - A single HTML-to-text parser can drop 40%+ of a page. - Tables, charts, and layout get flattened or thrown out. - Swapping parsers alone can move accuracy ~10 points on the same docs. PixelRAG indexes the page a person actually sees. The team built a visual index of all of Wikipedia, 30M+ screenshots, and it still beats the strongest text RAG baseline by 18.1% on text-only QA. The repo also ships a Claude Code plugin that gives Claude eyes. It lets Claude screenshot any URL and read the rendered page instead of scraping the DOM. So you can hand it a live page, an arXiv paper, or your local site and ask what it actually looks like. One setup script. No MCP server, no backend. How the pipeline works: - Renders each document (web, PDF, image) to image tiles. - Embeds them with Qwen3-VL-Embedding, LoRA fine-tuned on screenshots. - Builds a FAISS index and serves a search API. A stronger reader model lifts accuracy with no re-indexing, since the index is just pixels. Everything is open-source under Apache-2.0. GitHub repo: Talking about RAG, I recently wrote an article on a new approach that makes retrieval much more efficient by cutting corpus size by 40x, reducing tokens per query by 3x, and improving vector search relevance by 2.3x. The article is quoted below.

Akshay ๐Ÿš€

947,346 Aufrufe โ€ข vor 3 Monaten

Researchers built a new RAG approach that: - does not need a vector DB. - does not embed data. - involves no chunking. - performs no similarity search. And it hit 98.7% accuracy on a financial benchmark (SOTA). Here's the core problem with RAG that this new approach solves: Traditional RAG chunks documents, embeds them into vectors, and retrieves based on semantic similarity. But similarity โ‰  relevance. When you ask "What were the debt trends in 2023?", a vector search returns chunks that look similar. But the actual answer might be buried in some Appendix, referenced on some page, in a section that shares zero semantic overlap with your query. Traditional RAG would likely never find it. PageIndex (open-source) solves this. Instead of chunking and embedding, PageIndex builds a hierarchical tree structure from your documents, like an intelligent table of contents. Then it uses reasoning to traverse that tree. For instance, the model doesn't ask: "What text looks similar to this query?" Instead, it asks: "Based on this document's structure, where would a human expert look for this answer?" That's a fundamentally different approach with: - No arbitrary chunking that breaks context. - No vector DB infrastructure to maintain. - Traceable retrieval to see exactly why it chose a specific section. - The ability to see in-document references ("see Table 5.3") the way a human would. But here's the deeper issue that it solves. Vector search treats every query as independent. But documents have structure and logic, like sections that reference other sections and context that builds across pages. PageIndex respects that structure instead of flattening it into embeddings. Do note that this approach may not make sense in every use case since traditional vector search is still fast, simple, and works well for many applications. But for professional documents that require domain expertise and multi-step reasoning, this tree-based, reasoning-first approach shines. For instance, PageIndex achieved 98.7% accuracy on FinanceBench, significantly outperforming traditional vector-based RAG systems on complex financial document analysis. Everything is fully open-source, so you can see the full implementation in GitHub and try it yourself. I have shared the GitHub repo in the replies!

Avi Chawla

973,719 Aufrufe โ€ข vor 8 Monaten

Traditional data pipelines don't work for RAG applications. There are 3 issues with them: โ€‹ 1. Traditional data engineering solutions are optimized to handle structured data. RAG applications rely primarily on unstructured data. โ€‹ 2. The connector ecosystem to load data from unstructured data sources is very immature. โ€‹ 3. Traditional solutions do not offer any way to transform unstructured data into an optimized vector search index. โ€‹ The goal of a RAG Pipeline is to solve these problems. โ€‹ The number one objective is to create a reliable vector search index using factual knowledge and relevant context. This sounds easy, but it's one of the biggest challenges we face when building RAG applications. โ€‹ At a high level, there are four different stages in the architecture of a RAG pipeline: โ€‹ 1. Ingestion: Here is where the pipeline loads the information from the data source. โ€‹ 2. Extraction: Where the pipeline processes the input data and decides how to retrieve the text contained inside them. โ€‹ 3. Transform: Where the pipeline chunks the data and generates document embeddings. โ€‹ 4. Load: Where the pipeline creates a search index in a vector database and loads the document embeddings. โ€‹ There are different rabbit holes at each one of these stages. Here are three of them: โ€‹ 1. Ingesting data once is simple. The hard part is refreshing the vector database whenever the original data source changes. โ€‹ 2. Extracting the content of a plain text document is simple. The hard part is to extract content from complex documents containing tables, images, or cross-references. โ€‹ 3. A simple continual chunking strategy with an overlap is simple. The hard part is to find the optimal strategy for your specific knowledge base and the way you are planning to query it. โ€‹ In the attached video, I'll show you how you can build an enterprise-grade RAG Pipeline that solves every one of the above problems. โ€‹ I'll use Vectorize. They partnered with me on this post. You can use them to build RAG pipelines optimized for accurate context retrieval. โ€‹ โ€‹ If you have a few documents lying around, set up a free account and give it a try.

Santiago

40,627 Aufrufe โ€ข vor 1 Jahr

Sharing a super simple, user-owned memory module we've been playing around: nanomem The basic idea is to treat memory as a pure intelligence problem: ingestion, structuring, and (selective) retrieval are all just LLM calls & agent loops on a on-device markdown file tree. Each file lists a set of facts w/ metadata (timestamp, confidence, source, etc.); no embeddings/RAG/training of any kind. For example: - `nanomem add ` starts an agent loop to walk the tree, read relevant files, and edit. - `nanomem retrieve ` walks the tree and returns a single summary string (possibly assembled from many subtrees) related to the query. Whatโ€™s nice about this approach is that the memory system is, by construction: 1. partitionable (human/agents can easily separate `hobbies/snowboard.md` from `tax/residency.md` for data minimization + relevance) 2. portable and user-owned (itโ€™s just text files) 3. interpretable (you know exactly whatโ€™s written and you can manually edit) 4. forward-compatible (future models can read memory files just the same, and memory quality/speed improves as models get better) 5. modularized (you can optimize ingestion/retrieval/compaction prompts separately) Privacy & utility. I'm most excited about the ability to partition + selectively disclose memory at inference-time. Selective disclosure helps with both privacy (principle of least privilege & โ€œneed-to-knowโ€) and utility (as too much context for a query can harm answer quality). Composability. An inference-time memory module means: (1) you can run such a module with confidential inference (LLMs on TEEs) for provable privacy, and (2) you can selectively disclose context over unlinkable inference of remote models (demo below). We built nanomem as part of the Open Anonymity project ( but itโ€™s meant to be a standalone module for humans and agents (e.g., you can write a SKILL for using the CLI tool). Still polishing the rough edges! - GitHub (MIT): - Blog: - Beta implementation in chat client soon: Work done with amazing project co-leads Amelia Kuang Coco Xu Erik Chi !!

Ken Liu

75,023 Aufrufe โ€ข vor 5 Monaten

๐Ÿš€ GeoLibre just passed 5,000 stars on GitHub, in only two months! GeoLibre went public on May 27, and the community has already pushed it past 5,100 stars and 500+ forks. Thank you to everyone who starred, forked, filed issues, opened pull requests, and shared the project. For those just discovering it: GeoLibre is a free and open-source, lightweight, cloud-native GIS platform for visualizing, exploring, and analyzing geospatial data. It runs everywhere you do, in the web browser, on the desktop, on mobile, and inside Jupyter notebooks, all while keeping your data local and private. Key features of GeoLibre: - Runs anywhere: the same app ships as a native desktop app, a browser web app, a native Android app, and a Jupyter widget. - Local and private by default: load and analyze GeoJSON, GeoParquet, GeoPackage, Shapefile, COG, LiDAR, 3D Tiles, and more, right in the browser. - Powered by open source: built on MapLibre GL JS, DuckDB-WASM Spatial, Tauri, React, and TypeScript. - Spatial SQL in the browser: query your data with DuckDB Spatial, PostGIS via PGlite, and Apache Sedona. - Extensible: a growing plugin system for cloud data, federal web services, and custom tools. - Supports 12 planetary basemaps: Earth, Mars, the Moon, Mercury, Venus, and more. Two months in, we have already shipped 25 releases, the latest being v2.4.0. There is a lot more to come, and the best way to shape it is to jump in. Try it out - Launch GeoLibre Web: - GitHub: - Documentation: - Release notes: If GeoLibre is useful to you, a star on GitHub and a share here go a long way. Thank you for an incredible first two months. #geospatial #opensource #MapLibre #GeoLibre

Qiusheng Wu

94,705 Aufrufe โ€ข vor 1 Monat