RAPTOR: Dynamic Tree-Structured Summaries with LangChain - Advanced RAG

preview_player
Показать описание


Timestamps
0:00 What is RAPTOR?
1:02 Code Walkthrough
10:08 Dynamic Code in Action
Рекомендации по теме
Комментарии
Автор

Another great video from my birthplace. Thank you!
Why are you using a overlap at the chunks, when you have to join the chunks for clustering? Or does this have no effect?

ki-werkstatt
Автор

Thanks for this! I’ve been extending this to find values for n_neighbors, dims, etc that maximize the quality of the clusters. I’m applying this to 10-k filings which are pretty similar in overall “semantic” content and organization, so I’m hoping that as I process more 10-Ks, I’ll gradually find a set of parameters that generalizes well across most 10-ks. Kind of surprising that I haven’t seen anyone talk about this as far as RAPTOR

RiskSeeking-gimi
Автор

Hi, is line 157 in the code meant to come before the iteration summaries loop or after in line 165? i.e. are we updating the all_summaries field with the previous cluster texts or does it not matter? Otherwise we would be updating "iteration summaries["texts"]" with the same value as "iteration summaries["summaries"]"

patriciachirwa
Автор

Awesome. If I might suggest: how about a tutorial on CodeGen-specific advanced RAG, i.e. repository-wide code "understanding" and generation? :) Cheers!

robertputneydrake
Автор

Is this subject to loss in the middle problem?

lesptitsoiseaux
Автор

Thanks, why not using open source LLM and embeddings?

henkhbit
Автор

Ho it look like my idea in the previous video no ?
So you don’t need anymore the code ?

loicbaconnier