HackerTrans
トップ新着トレンドコメント過去質問紹介求人

lee1012

no profile record

投稿

[untitled]

1 ポイント·投稿者 lee1012·2 か月前·0 コメント

[untitled]

1 ポイント·投稿者 lee1012·4 か月前·0 コメント

[untitled]

1 ポイント·投稿者 lee1012·5 か月前·0 コメント

[untitled]

1 ポイント·投稿者 lee1012·6 か月前·0 コメント

コメント

lee1012
·3 か月前·議論
[dead]
lee1012
·6 か月前·議論
static embedding models im finding quite fast lee101/gobed https://github.com/lee101/gobed is 1ms on gpu :) would need to be trained for code though the bigger code llm embeddings can be high quality too so its just yea about where is ideal on the pareto fronteir really , often yea though your right it tends to be bm25 or rg even for code but yea more complex solutions are kind of possible too if its really important the search is high quality
lee1012
·6 か月前·議論
lee101/gobed https://github.com/lee101/gobed static embedding models so they are embedded in milliseconds and on gpu search with a cagra style on gpu index with a few things for speed like int8 quantization on the embeddings and fused embedding and search in the same kernel as the embedding really is just a trained map of embeddings per token/averaging