update README
Browse files
README.md
CHANGED
@@ -18,10 +18,10 @@ Users need to make their own assessment regarding any obligations or responsibil
|
|
18 |
### Performance on CoIR Benchmark
|
19 |
| Model | Model Size | CoIR AVG (NDCG@10) |
|
20 |
|-----------------------|------------|---------------------|
|
21 |
-
| SFR-Embedding-Code | 2B |
|
22 |
| CodeSage-Large-v2 | 1.3B | 64.2 |
|
23 |
| CodeSage-Large | 1.3B | 61.0 |
|
24 |
-
| SFR-Embedding-Code | 400M | 61.9 |
|
25 |
| CodeRankEmbed | 137M | 60.1 |
|
26 |
| CodeSage-Base | 356M | 57.5 |
|
27 |
| Voyage-Code-002 | - | 56.3 |
|
@@ -45,9 +45,9 @@ import torch.nn.functional as F
|
|
45 |
from transformers import AutoModel, AutoTokenizer
|
46 |
|
47 |
input_texts = [
|
|
|
48 |
"def quick_sort(arr):\n if len(arr) <= 1:\n return arr\n pivot = arr[len(arr) // 2]\n left = [x for x in arr if x < pivot]\n middle = [x for x in arr if x == pivot]\n right = [x for x in arr if x > pivot]\n return quick_sort(left) + middle + quick_sort(right)",
|
49 |
"def bubble_sort(arr):\n n = len(arr)\n for i in range(n):\n for j in range(0, n-i-1):\n if arr[j] > arr[j+1]:\n arr[j], arr[j+1] = arr[j+1], arr[j]\n return arr",
|
50 |
-
"how to implement quick sort in Python?"
|
51 |
]
|
52 |
|
53 |
model_path = 'Salesforce/SFR-Embedding-Code-400M_R'
|
|
|
18 |
### Performance on CoIR Benchmark
|
19 |
| Model | Model Size | CoIR AVG (NDCG@10) |
|
20 |
|-----------------------|------------|---------------------|
|
21 |
+
| **SFR-Embedding-Code** | 2B | 67.4 |
|
22 |
| CodeSage-Large-v2 | 1.3B | 64.2 |
|
23 |
| CodeSage-Large | 1.3B | 61.0 |
|
24 |
+
| **SFR-Embedding-Code** | 400M | 61.9 |
|
25 |
| CodeRankEmbed | 137M | 60.1 |
|
26 |
| CodeSage-Base | 356M | 57.5 |
|
27 |
| Voyage-Code-002 | - | 56.3 |
|
|
|
45 |
from transformers import AutoModel, AutoTokenizer
|
46 |
|
47 |
input_texts = [
|
48 |
+
"how to implement quick sort in Python?",
|
49 |
"def quick_sort(arr):\n if len(arr) <= 1:\n return arr\n pivot = arr[len(arr) // 2]\n left = [x for x in arr if x < pivot]\n middle = [x for x in arr if x == pivot]\n right = [x for x in arr if x > pivot]\n return quick_sort(left) + middle + quick_sort(right)",
|
50 |
"def bubble_sort(arr):\n n = len(arr)\n for i in range(n):\n for j in range(0, n-i-1):\n if arr[j] > arr[j+1]:\n arr[j], arr[j+1] = arr[j+1], arr[j]\n return arr",
|
|
|
51 |
]
|
52 |
|
53 |
model_path = 'Salesforce/SFR-Embedding-Code-400M_R'
|