Non-LLM extraction backend for graph indexing: 1000× cheaper, schema-bounded — where would it fit in GraphRAG? #2535
Jeffrey Romero Del Val (DeliVali)
started this conversation in
Community tools
Replies: 0 comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
Hi — long-time reader of this project's design docs. I built something adjacent to GraphRAG's indexing stage and I'd genuinely like this community's take on where (or whether) it fits.
The problem I was attacking
For high-volume corpora, the entity/relationship extraction stage is where GraphRAG's cost concentrates: every text unit goes through LLM calls, and re-indexing multiplies it. For always-on ingestion (agent memory, log streams) that cost structure makes "index everything" impractical.
What I built
A small non-autoregressive decoder (~37M params) that maps a sentence embedding (SONAR, Meta) directly to graph triples — entities + typed relations in one forward pass. No generation, no JSON parsing, no retries: malformed output is structurally impossible.
Repo (Apache-2.0, weights on HF, reproducible): https://github.com/DeliVali/cogito-estella
The honest tradeoff vs LLM extraction
This is not a drop-in replacement for GraphRAG's extractor. LLM extraction gives you open entity types, descriptions, and claims; mine works over a bounded vocabulary (20k entities / 60 relations currently) and emits bare typed triples. Where I think it fits:
Questions for this community
Not trying to sell anything — the thing is free and I'm one person. I'm trying to figure out if this direction is useful to people other than me, and this is the community that would know.
All reactions