Loading video...

Video Failed to Load

Go Home

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,856 views โ€ข 3 months ago โ€ขvia X (Twitter)

0 Comments

No comments available

Comments from the original post will appear here

Related Videos

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 ๐Ÿš€

937,884 views โ€ข 28 days ago

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

972,347 views โ€ข 5 months ago

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,441 views โ€ข 1 year ago

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

73,767 views โ€ข 3 months ago

GeoLibre v1.2.0 is here! GeoLibre is a free and open-source, lightweight, cloud-native GIS platform for visualizing, exploring, and analyzing geospatial data. One application that runs everywhere: in your web browser, as a native desktop app, on your phone, and inside a Jupyter notebook. No account, no server, no cost. Everything runs locally and your data stays private. This release packs in 35+ pull requests of new capabilities. A few highlights: - Run SQL right in the browser. The SQL Workspace pairs DuckDB Spatial with a new in-browser PostGIS engine (PGlite), so you can query layers, local files, and remote URLs without a server. - A smarter attribute table. Add fields, run a field calculator, and explore your data with a built-in Charts panel (histogram, scatter, bar, line, and box plots). - More ways to add data. OpenStreetMap PBF extracts, Cloud-Optimized NetCDF/HDF via kerchunk, georeferenced video overlays, authenticated 3D Tiles, and a Layer builder for custom overlays. - Better visualization. Heatmap rendering, point clustering, and H3 hexagonal grids for spatial binning. - New analysis and routing. A Directions plugin, plus Spatial Join, Select by Value, and Select by Location vector tools. - Print and share. A print layout composer that exports your map to PNG or PDF. - Work faster. A command palette (Ctrl/Cmd + K), global keyboard shortcuts, and undo/redo for layer and style operations. - Built for everyone. New internationalization framework, an accessibility pass with automated axe checks, an installable offline-capable PWA web build, React error boundaries, and Playwright end-to-end tests. Try the live demo: Star it on GitHub: Docs and roadmap: Release notes: #GIS #OpenSource #Geospatial #MapLibre #WebGIS #DuckDB #GeoLibre

Qiusheng Wu

39,608 views โ€ข 1 month ago