2d reduction is only to visualize the flow of an article. When we chunk, we chunk on the full dimensions. Sorry, the article does not have more details. My bad. Will add more details along with the code doing this also.
1,078 karma · joined September 17, 2010
2d reduction is only to visualize the flow of an article. When we chunk, we chunk on the full dimensions. Sorry, the article does not have more details. My bad. Will add more details along with the code doing this also.
A couple of corrections: I never meant to say our method was superior. We have not done any benchmarks etc enough to write a paper. We have just been using this approach in our RAG pipeline and we have been happy with it. Sorry, will add a disclaimer in the post.
Agreed. For semantic chunking, only read and compare works best. Not sure how to scale that to a bench mark. Guess for the PG essay, only PG can answer if the topics align with his thoughts :)[https://x.com/nutanc/status/1838813258972549549]
We will release the algorithm. I just put this out on Hackernews thinking this will also not be noticed as my all other posts :)
But looks like some interest is there. Will post a follow up update soon. Sorry for the lack of details on the original post.
Will share more details soon.
robots.txt exists, but is mainly for crawling and also not sure anyone follows it or even if they don't follow what's the punishment.
Actually this opens up a bigger question. What if I like an open source project but don't like its license. I can just prompt AI by giving it the open source code and ask it to rewrite it or write in some other language. Have to look up the rules if this is allowed or will be considered copying and how will a judge prove?
Education has a lot more edge cases than driving.
Sick and tired of these default opt in explicit opt out legalese.
The default should be opt out.
Just stop using my data.
We have done one round of content cleaning, hope to have most of the content with no issues by this month end.
This is a free website for math content from grade 6-10th. This fits with our design philosophy. Want to see if we can make something interactive with vector-graph
I mean textbooks are cool. But with the tools available to us we should be able to make almost any textbook interactive. It will need effort, pedagogy, programming skills and design. But it's certainly worth it.
Making an effort with this. Started with 6th to 10th grade math. Let's see how this goes.
1. Stuff does not have longevity. This is because most of the new tools are outside curriculum. This does not encourage students to learn something extra.
2. Proprietary. Books providing add ons have a different goal. They want to sell their books. So the addons or just that. Add ons. They are not complete.
These were some of the thoughts which encouraged us to build [1]. Keep it curriculum focused so kids don't learn anything extra. No books to sell :)
We believe the brain does not do nonlinear maps!
The approach is used to solve other problems and papers have been published under https://www.researchgate.net/profile/K-Eswaran
We are currently trying a build a full fledged LLM using just this approach(no LLM training etc) and also an ASR. We should have something to share in a couple of months.
There is a mathematical proof that binary representation is enough to capture the latent space. And in fact we don't even need to do "training" to get that representation.
The practical application we tried out for this algorithm was to create an alternate space for mpnet embeddings of Wikipedia paragraphs. Using Bit embedding we are able to represent 36 million passages of Wikipedia in 2GB.(https://gpt3experiments.substack.com/p/building-a-vector-dat...)
https://speech-kws.ozonetel.com/wiki
Thanks to @CohereAI for releasing the Wikipedia embedding dataset. I saw that for 36 million passages the embedding size would be around 120 GB. So if I had to host the embeddings and enable neural search on this dataset I will have to do LLM ops and runs vectorDB clusters. This was a good dataset to test out the efficacy of the Alpes KE Sieve algorithm. We built an embedding space based on @huggingface all-mpnet-base-v2 model. We created two models, one with 540 dimension bit embedding(small) and another with 2200 dimension bit embedding(large). We were able to embed all the 36 million passages in 2GB and 10GB respectively.So you can now have local wikipedia vector search locally. Since the size is so small, we just used np.array and no vector databases. You can test it out in the link above and share your feedback.
Will do a bigger blog post soon on the approach. Can mail you some details if you are interested.
I actually see that commandbar.com has an intercom chat widget.