Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
liukidar
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
1.
▲
by
liukidar
7mo ago
Ahah, indeed that's true... That's why we've just released Smooth CLI ( https://docs.smooth.sh/cli/overview ) and the SKILL.md (smooth-sdk/skills/smooth-browser/SKILL.md) associated with it.
2.
▲
Show HN: Smooth – Faster, cheaper browser agent API
(smooth.sh)
54 points
by
liukidar
1y ago
|
16 comments
3.
▲
by
liukidar
2y ago
LLMs are only used to construct the graph, to navigate it we use an algorithmic approach. As of now, what we do is very similar to HippoRAG ( https://github.com/OSU-NLP-Group/HippoRAG ), their paper can give a good overv
4.
▲
by
liukidar
2y ago
That would be awesome, we have a discord you can join and we can talk there (link is in the github repo, message Antonio) or you can message antonio [at] circlemind.com
5.
▲
by
liukidar
2y ago
Thanks for sharing! These are all very helpful insights! We'll keep this in mind :)
6.
▲
by
liukidar
2y ago
We are building connectors for that, so it will soon :) At the moment we are using python-igraph (which does everything locally) as we wanted to offer something as ready to use as possible.
7.
▲
by
liukidar
2y ago
This is super interesting! Thanks for sharing. Here we are talking of graphs in the milions nodes/edges, so efficiency is not that big of a deal, since anyway things are gonna be parsed by a LLM to craft an asnwer which will always be
8.
▲
by
liukidar
2y ago
We have tried from small novels to full documentations of some milion tokens and both seem to create interesting graphs, it would be great to hear some feedback as more people start using it :)
9.
▲
by
liukidar
2y ago
Hey! Our todo list is a bit swamped with things right now, but we'll try to have a look at that as soon as possible. On the Ollama github I found contrasting information: https://github.com/ollama/ollama/issue
10.
▲
by
liukidar
2y ago
It is to mark the package as private (in the sense that for normal usage you shouldn't need it). We are still writing the documentation on how to customize every little bit of the graph construction and querying pipeline, once that is
11.
▲
by
liukidar
2y ago
The graph is currently stored using python-igraph. The codebase is designed such that it is easy to integrate any graphdb by writing a light wrapper around it (we will provide support to stuff like neo4j in the near future). We haven't
12.
▲
by
liukidar
2y ago
Exactly! Also PageRank is used to navigate the graph and find "missing links" between the concepts selected from the query using semantic search via LLMs (so to be able to find information to answer questions that require multi-ho
13.
▲
Show HN: FastGraphRAG – Better RAG using good old PageRank
(github.com)
457 points
by
liukidar
2y ago
|
119 comments