|
--- |
|
license: apache-2.0 |
|
language: |
|
- en |
|
inference: |
|
parameters: |
|
max_new_tokens: 64 |
|
do_sample: true |
|
repetition_penalty: 1.2 |
|
no_repeat_ngram_size: 5 |
|
eta_cutoff: 0.0006 |
|
renormalize_logits: true |
|
widget: |
|
- text: My name is El Microondas the Wise and |
|
example_title: El Microondas |
|
- text: Kennesaw State University is a public |
|
example_title: Kennesaw State University |
|
- text: >- |
|
Bungie Studios is an American video game developer. They are most famous for |
|
developing the award winning Halo series of video games. They also made |
|
Destiny. The studio was founded |
|
example_title: Bungie |
|
- text: The Mona Lisa is a world-renowned painting created by |
|
example_title: Mona Lisa |
|
- text: >- |
|
The Harry Potter series, written by J.K. Rowling, begins with the book |
|
titled |
|
example_title: Harry Potter Series |
|
- text: >- |
|
Question: I have cities, but no houses. I have mountains, but no trees. I |
|
have water, but no fish. What am I? |
|
|
|
Answer: |
|
example_title: Riddle |
|
- text: The process of photosynthesis involves the conversion of |
|
example_title: Photosynthesis |
|
- text: >- |
|
Jane went to the store to buy some groceries. She picked up apples, oranges, |
|
and a loaf of bread. When she got home, she realized she forgot |
|
example_title: Story Continuation |
|
- text: >- |
|
Problem 2: If a train leaves Station A at 9:00 AM and travels at 60 mph, and |
|
another train leaves Station B at 10:00 AM and travels at 80 mph, when will |
|
they meet if the distance between the stations is 300 miles? |
|
|
|
To determine |
|
example_title: Math Problem |
|
- text: In the context of computer programming, an algorithm is |
|
example_title: Algorithm Definition |
|
pipeline_tag: text-generation |
|
tags: |
|
- smol_llama |
|
- llama2 |
|
datasets: |
|
- JeanKaddour/minipile |
|
- pszemraj/simple_wikipedia_LM |
|
- BEE-spoke-data/wikipedia-20230901.en-deduped |
|
- mattymchen/refinedweb-3m |
|
--- |
|
|
|
|
|
# smol_llama-101M-GQA |
|
|
|
A small 101M param (total) decoder model. This is the first version of the model. |
|
|
|
- 768 hidden size, 6 layers |
|
- GQA (24 heads, 8 key-value), context length 1024 |
|
- train-from-scratch |
|
|
|
For the chat version of this model, please [see here](https://youtu.be/dQw4w9WgXcQ?si=3ePIqrY1dw94KMu4) |
|
|
|
--- |
|
|
|
|
