mirror of
https://github.com/huggingface/candle.git
synced 2025-06-18 19:47:12 +00:00
79eab519fd
* Fix phi example * Remove the cuda mention. --------- Co-authored-by: Laurent <laurent.mazare@gmail.com>
79 lines
2.5 KiB
Markdown
79 lines
2.5 KiB
Markdown
# candle-phi: 1.3b and 2.7b LLM with state of the art performance for <10b models.
|
|
|
|
[Phi-1.5](https://huggingface.co/microsoft/phi-1_5) and
|
|
[Phi-2](https://huggingface.co/microsoft/phi-2) are language models using
|
|
only 1.3 and 2.7 billion parameters but with state of the art performance compared to
|
|
models with up to 10 billion parameters.
|
|
|
|
The candle implementation provides both the standard version as well as a
|
|
quantized variant.
|
|
|
|
## Running some examples
|
|
|
|
For the v2 version.
|
|
```bash
|
|
$ cargo run --example phi --release -- --prompt "def print_prime(n): " --model 2
|
|
def print_prime(n):
|
|
if n <= 1:
|
|
print("Not a prime number")
|
|
else:
|
|
for i in range(2, int(n**0.5)+1):
|
|
if (n % i) == 0:
|
|
print("Not a prime number")
|
|
break
|
|
else:
|
|
print("Prime number")
|
|
|
|
|
|
# Driver code
|
|
n = 17
|
|
print_prime(n)
|
|
```
|
|
|
|
For the v1.5 version.
|
|
```bash
|
|
$ cargo run --example phi --release -- --prompt "def print_prime(n): "
|
|
|
|
def print_prime(n):
|
|
print("Printing prime numbers")
|
|
for i in range(2, n+1):
|
|
if is_prime(i):
|
|
print(i)
|
|
|
|
def is_prime(n):
|
|
if n <= 1:
|
|
return False
|
|
for i in range(2, int(math.sqrt(n))+1):
|
|
if n % i == 0:
|
|
return False
|
|
return True
|
|
|
|
$ cargo run --example phi --release -- \
|
|
--prompt "Explain how to find the median of an array and write the corresponding python function.\nAnswer:" \
|
|
--quantized --sample-len 200
|
|
|
|
Explain how to find the median of an array and write the corresponding python function.
|
|
Answer: The median is the middle value in an array. If the array has an even number of elements, the median is the average of the two middle values.
|
|
|
|
def median(arr):
|
|
arr.sort()
|
|
n = len(arr)
|
|
if n % 2 == 0:
|
|
return (arr[n//2 - 1] + arr[n//2]) / 2
|
|
else:
|
|
return arr[n//2]
|
|
```
|
|
|
|
This also supports the [Puffin Phi v2
|
|
model](https://huggingface.co/teknium/Puffin-Phi-v2) for human interaction.
|
|
```
|
|
$ cargo run --example phi --release -- \
|
|
--prompt "USER: What would you do on a sunny day in Paris?\nASSISTANT:" \
|
|
--sample-len 200 --model puffin-phi-v2 --quantized
|
|
USER: What would you do on a sunny day in Paris?
|
|
ASSISTANT: On a sunny day in Paris, you could visit the Musée du Louvre to admire the famous
|
|
painting "Mona Lisa" by Leonardo da Vinci. You might also want to stroll along the Champs-Élysées
|
|
and enjoy the beautiful architecture of the buildings around you. Don't forget to stop by a café
|
|
for a cup of coffee and to soak up the sun!"
|
|
```
|