|
--- |
|
base_model: https://huggingface.co/jondurbin/airoboros-c34b-2.1 |
|
datasets: |
|
- jondurbin/airoboros-2.1 |
|
inference: false |
|
license: llama2 |
|
model_creator: Jon Durbin |
|
model_name: Airoboros c34B 2.1 |
|
model_type: llama |
|
prompt_template: "A chat.\nUSER: {prompt}\nASSISTANT: \n" |
|
quantized_by: TheBloke |
|
--- |
|
|
|
<!-- header start --> |
|
<!-- 200823 --> |
|
<div style="width: auto; margin-left: auto; margin-right: auto"> |
|
<img src="https://i.imgur.com/EBdldam.jpg" alt="TheBlokeAI" style="width: 100%; min-width: 400px; display: block; margin: auto;"> |
|
</div> |
|
<div style="display: flex; justify-content: space-between; width: 100%;"> |
|
<div style="display: flex; flex-direction: column; align-items: flex-start;"> |
|
<p style="margin-top: 0.5em; margin-bottom: 0em;"><a href="https://discord.gg/theblokeai">Chat & support: TheBloke's Discord server</a></p> |
|
</div> |
|
<div style="display: flex; flex-direction: column; align-items: flex-end;"> |
|
<p style="margin-top: 0.5em; margin-bottom: 0em;"><a href="https://www.patreon.com/TheBlokeAI">Want to contribute? TheBloke's Patreon page</a></p> |
|
</div> |
|
</div> |
|
<div style="text-align:center; margin-top: 0em; margin-bottom: 0em"><p style="margin-top: 0.25em; margin-bottom: 0em;">TheBloke's LLM work is generously supported by a grant from <a href="https://a16z.com">andreessen horowitz (a16z)</a></p></div> |
|
<hr style="margin-top: 1.0em; margin-bottom: 1.0em;"> |
|
<!-- header end --> |
|
|
|
# Airoboros c34B 2.1 - GPTQ |
|
- Model creator: [Jon Durbin](https://huggingface.co/jondurbin) |
|
- Original model: [Airoboros c34B 2.1](https://huggingface.co/jondurbin/airoboros-c34b-2.1) |
|
|
|
<!-- description start --> |
|
## Description |
|
|
|
This repo contains GPTQ model files for [Jon Durbin's Airoboros c34B 2.1](https://huggingface.co/jondurbin/airoboros-c34b-2.1). |
|
|
|
Multiple GPTQ parameter permutations are provided; see Provided Files below for details of the options provided, their parameters, and the software used to create them. |
|
|
|
<!-- description end --> |
|
<!-- repositories-available start --> |
|
## Repositories available |
|
|
|
* [AWQ model(s) for GPU inference.](https://huggingface.co/TheBloke/Airoboros-c34B-2.1-AWQ) |
|
* [GPTQ models for GPU inference, with multiple quantisation parameter options.](https://huggingface.co/TheBloke/Airoboros-c34B-2.1-GPTQ) |
|
* [2, 3, 4, 5, 6 and 8-bit GGUF models for CPU+GPU inference](https://huggingface.co/TheBloke/Airoboros-c34B-2.1-GGUF) |
|
* [Jon Durbin's original unquantised fp16 model in pytorch format, for GPU inference and for further conversions](https://huggingface.co/jondurbin/airoboros-c34b-2.1) |
|
<!-- repositories-available end --> |
|
|
|
<!-- prompt-template start --> |
|
## Prompt template: Chat |
|
|
|
``` |
|
A chat. |
|
USER: {prompt} |
|
ASSISTANT: |
|
|
|
``` |
|
|
|
<!-- prompt-template end --> |
|
|
|
|
|
<!-- README_GPTQ.md-provided-files start --> |
|
## Provided files and GPTQ parameters |
|
|
|
Multiple quantisation parameters are provided, to allow you to choose the best one for your hardware and requirements. |
|
|
|
Each separate quant is in a different branch. See below for instructions on fetching from different branches. |
|
|
|
All recent GPTQ files are made with AutoGPTQ, and all files in non-main branches are made with AutoGPTQ. Files in the `main` branch which were uploaded before August 2023 were made with GPTQ-for-LLaMa. |
|
|
|
<details> |
|
<summary>Explanation of GPTQ parameters</summary> |
|
|
|
- Bits: The bit size of the quantised model. |
|
- GS: GPTQ group size. Higher numbers use less VRAM, but have lower quantisation accuracy. "None" is the lowest possible value. |
|
- Act Order: True or False. Also known as `desc_act`. True results in better quantisation accuracy. Some GPTQ clients have had issues with models that use Act Order plus Group Size, but this is generally resolved now. |
|
- Damp %: A GPTQ parameter that affects how samples are processed for quantisation. 0.01 is default, but 0.1 results in slightly better accuracy. |
|
- GPTQ dataset: The dataset used for quantisation. Using a dataset more appropriate to the model's training can improve quantisation accuracy. Note that the GPTQ dataset is not the same as the dataset used to train the model - please refer to the original model repo for details of the training dataset(s). |
|
- Sequence Length: The length of the dataset sequences used for quantisation. Ideally this is the same as the model sequence length. For some very long sequence models (16+K), a lower sequence length may have to be used. Note that a lower sequence length does not limit the sequence length of the quantised model. It only impacts the quantisation accuracy on longer inference sequences. |
|
- ExLlama Compatibility: Whether this file can be loaded with ExLlama, which currently only supports Llama models in 4-bit. |
|
|
|
</details> |
|
|
|
| Branch | Bits | GS | Act Order | Damp % | GPTQ Dataset | Seq Len | Size | ExLlama | Desc | |
|
| ------ | ---- | -- | --------- | ------ | ------------ | ------- | ---- | ------- | ---- | |
|
| [main](https://huggingface.co/TheBloke/Airoboros-c34B-2.1-GPTQ/tree/main) | 4 | None | Yes | 0.1 | [wikitext](https://huggingface.co/datasets/wikitext/viewer/wikitext-2-v1/test) | 4096 | 17.69 GB | Yes | 4-bit, with Act Order. No group size, to lower VRAM requirements. | |
|
| [gptq-4bit-32g-actorder_True](https://huggingface.co/TheBloke/Airoboros-c34B-2.1-GPTQ/tree/gptq-4bit-32g-actorder_True) | 4 | 32 | Yes | 0.1 | [wikitext](https://huggingface.co/datasets/wikitext/viewer/wikitext-2-v1/test) | 4096 | 20.28 GB | Yes | 4-bit, with Act Order and group size 32g. Gives highest possible inference quality, with maximum VRAM usage. | |
|
| [gptq-4bit-64g-actorder_True](https://huggingface.co/TheBloke/Airoboros-c34B-2.1-GPTQ/tree/gptq-4bit-64g-actorder_True) | 4 | 64 | Yes | 0.1 | [wikitext](https://huggingface.co/datasets/wikitext/viewer/wikitext-2-v1/test) | 4096 | 18.98 GB | Yes | 4-bit, with Act Order and group size 64g. Uses less VRAM than 32g, but with slightly lower accuracy. | |
|
| [gptq-4bit-128g-actorder_True](https://huggingface.co/TheBloke/Airoboros-c34B-2.1-GPTQ/tree/gptq-4bit-128g-actorder_True) | 4 | 128 | Yes | 0.1 | [wikitext](https://huggingface.co/datasets/wikitext/viewer/wikitext-2-v1/test) | 4096 | 18.33 GB | Yes | 4-bit, with Act Order and group size 128g. Uses even less VRAM than 64g, but with slightly lower accuracy. | |
|
| [gptq-3bit--1g-actorder_True](https://huggingface.co/TheBloke/Airoboros-c34B-2.1-GPTQ/tree/gptq-3bit--1g-actorder_True) | 3 | None | Yes | 0.1 | [wikitext](https://huggingface.co/datasets/wikitext/viewer/wikitext-2-v1/test) | 4096 | 13.54 GB | No | 3-bit, with Act Order and no group size. Lowest possible VRAM requirements. May be lower quality than 3-bit 128g. | |
|
| [gptq-3bit-128g-actorder_True](https://huggingface.co/TheBloke/Airoboros-c34B-2.1-GPTQ/tree/gptq-3bit-128g-actorder_True) | 3 | 128 | Yes | 0.1 | [wikitext](https://huggingface.co/datasets/wikitext/viewer/wikitext-2-v1/test) | 4096 | 14.14 GB | No | 3-bit, with group size 128g and act-order. Higher quality than 128g-False. | |
|
|
|
<!-- README_GPTQ.md-provided-files end --> |
|
|
|
<!-- README_GPTQ.md-download-from-branches start --> |
|
## How to download from branches |
|
|
|
- In text-generation-webui, you can add `:branch` to the end of the download name, eg `TheBloke/Airoboros-c34B-2.1-GPTQ:main` |
|
- With Git, you can clone a branch with: |
|
``` |
|
git clone --single-branch --branch main https://huggingface.co/TheBloke/Airoboros-c34B-2.1-GPTQ |
|
``` |
|
- In Python Transformers code, the branch is the `revision` parameter; see below. |
|
<!-- README_GPTQ.md-download-from-branches end --> |
|
<!-- README_GPTQ.md-text-generation-webui start --> |
|
## How to easily download and use this model in [text-generation-webui](https://github.com/oobabooga/text-generation-webui). |
|
|
|
Please make sure you're using the latest version of [text-generation-webui](https://github.com/oobabooga/text-generation-webui). |
|
|
|
It is strongly recommended to use the text-generation-webui one-click-installers unless you're sure you know how to make a manual install. |
|
|
|
1. Click the **Model tab**. |
|
2. Under **Download custom model or LoRA**, enter `TheBloke/Airoboros-c34B-2.1-GPTQ`. |
|
- To download from a specific branch, enter for example `TheBloke/Airoboros-c34B-2.1-GPTQ:main` |
|
- see Provided Files above for the list of branches for each option. |
|
3. Click **Download**. |
|
4. The model will start downloading. Once it's finished it will say "Done". |
|
5. In the top left, click the refresh icon next to **Model**. |
|
6. In the **Model** dropdown, choose the model you just downloaded: `Airoboros-c34B-2.1-GPTQ` |
|
7. The model will automatically load, and is now ready for use! |
|
8. If you want any custom settings, set them and then click **Save settings for this model** followed by **Reload the Model** in the top right. |
|
* Note that you do not need to and should not set manual GPTQ parameters any more. These are set automatically from the file `quantize_config.json`. |
|
9. Once you're ready, click the **Text Generation tab** and enter a prompt to get started! |
|
<!-- README_GPTQ.md-text-generation-webui end --> |
|
|
|
<!-- README_GPTQ.md-use-from-python start --> |
|
## How to use this GPTQ model from Python code |
|
|
|
### Install the necessary packages |
|
|
|
Requires: Transformers 4.32.0 or later, Optimum 1.12.0 or later, and AutoGPTQ 0.4.2 or later. |
|
|
|
```shell |
|
pip3 install transformers>=4.32.0 optimum>=1.12.0 |
|
pip3 install auto-gptq --extra-index-url https://huggingface.github.io/autogptq-index/whl/cu118/ # Use cu117 if on CUDA 11.7 |
|
``` |
|
|
|
If you have problems installing AutoGPTQ using the pre-built wheels, install it from source instead: |
|
|
|
```shell |
|
pip3 uninstall -y auto-gptq |
|
git clone https://github.com/PanQiWei/AutoGPTQ |
|
cd AutoGPTQ |
|
pip3 install . |
|
``` |
|
|
|
### For CodeLlama models only: you must use Transformers 4.33.0 or later. |
|
|
|
If 4.33.0 is not yet released when you read this, you will need to install Transformers from source: |
|
```shell |
|
pip3 uninstall -y transformers |
|
pip3 install git+https://github.com/huggingface/transformers.git |
|
``` |
|
|
|
### You can then use the following code |
|
|
|
```python |
|
from transformers import AutoModelForCausalLM, AutoTokenizer, pipeline |
|
|
|
model_name_or_path = "TheBloke/Airoboros-c34B-2.1-GPTQ" |
|
# To use a different branch, change revision |
|
# For example: revision="main" |
|
model = AutoModelForCausalLM.from_pretrained(model_name_or_path, |
|
device_map="auto", |
|
trust_remote_code=False, |
|
revision="main") |
|
|
|
tokenizer = AutoTokenizer.from_pretrained(model_name_or_path, use_fast=True) |
|
|
|
prompt = "Tell me about AI" |
|
prompt_template=f'''A chat. |
|
USER: {prompt} |
|
ASSISTANT: |
|
|
|
''' |
|
|
|
print("\n\n*** Generate:") |
|
|
|
input_ids = tokenizer(prompt_template, return_tensors='pt').input_ids.cuda() |
|
output = model.generate(inputs=input_ids, temperature=0.7, do_sample=True, top_p=0.95, top_k=40, max_new_tokens=512) |
|
print(tokenizer.decode(output[0])) |
|
|
|
# Inference can also be done using transformers' pipeline |
|
|
|
print("*** Pipeline:") |
|
pipe = pipeline( |
|
"text-generation", |
|
model=model, |
|
tokenizer=tokenizer, |
|
max_new_tokens=512, |
|
do_sample=True, |
|
temperature=0.7, |
|
top_p=0.95, |
|
top_k=40, |
|
repetition_penalty=1.1 |
|
) |
|
|
|
print(pipe(prompt_template)[0]['generated_text']) |
|
``` |
|
<!-- README_GPTQ.md-use-from-python end --> |
|
|
|
<!-- README_GPTQ.md-compatibility start --> |
|
## Compatibility |
|
|
|
The files provided are tested to work with AutoGPTQ, both via Transformers and using AutoGPTQ directly. They should also work with [Occ4m's GPTQ-for-LLaMa fork](https://github.com/0cc4m/KoboldAI). |
|
|
|
[ExLlama](https://github.com/turboderp/exllama) is compatible with Llama models in 4-bit. Please see the Provided Files table above for per-file compatibility. |
|
|
|
[Huggingface Text Generation Inference (TGI)](https://github.com/huggingface/text-generation-inference) is compatible with all GPTQ models. |
|
<!-- README_GPTQ.md-compatibility end --> |
|
|
|
<!-- footer start --> |
|
<!-- 200823 --> |
|
## Discord |
|
|
|
For further support, and discussions on these models and AI in general, join us at: |
|
|
|
[TheBloke AI's Discord server](https://discord.gg/theblokeai) |
|
|
|
## Thanks, and how to contribute |
|
|
|
Thanks to the [chirper.ai](https://chirper.ai) team! |
|
|
|
Thanks to Clay from [gpus.llm-utils.org](llm-utils)! |
|
|
|
I've had a lot of people ask if they can contribute. I enjoy providing models and helping people, and would love to be able to spend even more time doing it, as well as expanding into new projects like fine tuning/training. |
|
|
|
If you're able and willing to contribute it will be most gratefully received and will help me to keep providing more models, and to start work on new AI projects. |
|
|
|
Donaters will get priority support on any and all AI/LLM/model questions and requests, access to a private Discord room, plus other benefits. |
|
|
|
* Patreon: https://patreon.com/TheBlokeAI |
|
* Ko-Fi: https://ko-fi.com/TheBlokeAI |
|
|
|
**Special thanks to**: Aemon Algiz. |
|
|
|
**Patreon special mentions**: Alicia Loh, Stephen Murray, K, Ajan Kanaga, RoA, Magnesian, Deo Leter, Olakabola, Eugene Pentland, zynix, Deep Realms, Raymond Fosdick, Elijah Stavena, Iucharbius, Erik Bjäreholt, Luis Javier Navarrete Lozano, Nicholas, theTransient, John Detwiler, alfie_i, knownsqashed, Mano Prime, Willem Michiel, Enrico Ros, LangChain4j, OG, Michael Dempsey, Pierre Kircher, Pedro Madruga, James Bentley, Thomas Belote, Luke @flexchar, Leonard Tan, Johann-Peter Hartmann, Illia Dulskyi, Fen Risland, Chadd, S_X, Jeff Scroggin, Ken Nordquist, Sean Connelly, Artur Olbinski, Swaroop Kallakuri, Jack West, Ai Maven, David Ziegler, Russ Johnson, transmissions 11, John Villwock, Alps Aficionado, Clay Pascal, Viktor Bowallius, Subspace Studios, Rainer Wilmers, Trenton Dambrowitz, vamX, Michael Levine, 준교 김, Brandon Frisco, Kalila, Trailburnt, Randy H, Talal Aujan, Nathan Dryer, Vadim, 阿明, ReadyPlayerEmma, Tiffany J. Kim, George Stoitzev, Spencer Kim, Jerry Meng, Gabriel Tamborski, Cory Kujawski, Jeffrey Morgan, Spiking Neurons AB, Edmond Seymore, Alexandros Triantafyllidis, Lone Striker, Cap'n Zoog, Nikolai Manek, danny, ya boyyy, Derek Yates, usrbinkat, Mandus, TL, Nathan LeClaire, subjectnull, Imad Khwaja, webtim, Raven Klaugh, Asp the Wyvern, Gabriel Puliatti, Caitlyn Gatomon, Joseph William Delisle, Jonathan Leane, Luke Pendergrass, SuperWojo, Sebastain Graf, Will Dee, Fred von Graf, Andrey, Dan Guido, Daniel P. Andersen, Nitin Borwankar, Elle, Vitor Caleffi, biorpg, jjj, NimbleBox.ai, Pieter, Matthew Berman, terasurfer, Michael Davis, Alex, Stanislav Ovsiannikov |
|
|
|
|
|
Thank you to all my generous patrons and donaters! |
|
|
|
And thank you again to a16z for their generous grant. |
|
|
|
<!-- footer end --> |
|
|
|
# Original model card: Jon Durbin's Airoboros c34B 2.1 |
|
|
|
|
|
### Overview |
|
|
|
__*This model is a bit broken due to a prompt formatting bug in the training code! 2.2 will be available soon and should fix this*__ |
|
|
|
This is an instruction fine-tuned llama-2 model, using synthetic data generated by [airoboros](https://github.com/jondurbin/airoboros) |
|
|
|
- Experimental RP style instruction set, with two categories: rp and gtkm |
|
- rp includes multi-round chats, with emotes, between a varying number of characters, defined by cards |
|
- gtkm is a way to test a simpler alternative to ghost attention - first, a character card is generated, then several questions are created to ask the model (as the character), using the character system prompt, then everything in synthesized into a dialog (one system prompt, all turns remain in character) |
|
- Experimental support for longer, more detailed writing prompts, as well as next-chapter generation |
|
- I used the new `cull-instructions` entrypoint in airoboros to shrink the m2.0 dataset to a smaller subset of high-quality instructions (according to gpt-4) |
|
- The training data now also includes "stylized_response", in which 1500 sample instructions from various categories were re-generated using character cards as system prompts. |
|
- this should allow better adherence to style/etc. specified in the system card |
|
- Thousands of new generations, using some of the updates re: Flesch hints, etc., to get longer/higher quality writing outputs. |
|
- A small "de-alignment" dataset was also added (not published) to remove some of the censorship in the base models. |
|
|
|
|
|
*Why do I try to remove censorship?* |
|
|
|
- laws vary widely based on time and location |
|
- language model may conflate certain words with laws, e.g. it may think "stealing eggs from a chicken" is illegal |
|
- these models just produce text, what you do with that text is your resonsibility |
|
- many people and industries deal with "sensitive" content; imagine if a court stenographer's eqipment filtered illegal content - it would be useless |
|
|
|
Huge thank you to the folks over at [a16z](https://a16z.com/) for sponsoring the costs associated with building models and associated tools! |
|
|
|
### Prompt format |
|
|
|
The training code was updated to randomize newline vs space: |
|
https://github.com/jondurbin/qlora/blob/main/qlora.py#L559C1-L559C1 |
|
|
|
|
|
``` |
|
A chat. USER: {prompt} ASSISTANT: |
|
``` |
|
|
|
or |
|
|
|
``` |
|
A chat. |
|
USER: {prompt} |
|
ASSISTANT: |
|
``` |
|
|
|
So in other words, it's the preamble/system prompt, followed by a single space or newline, then "USER: " (single space after colon) then the prompt (which can have multiple lines, spaces, whatever), then a single space or newline, followed by "ASSISTANT: " (with a single space after the colon). |
|
|
|
__*I strongly suggest adding stopping criteria/early inference stopping on "USER:", because the training data includes many multi-round chats and could otherwise start simulating a conversation!*__ |
|
|
|
### Helpful usage tips |
|
|
|
*The prompts shown here are are just the text that would be included after USER: and before ASSISTANT: in the full prompt format above, the system prompt and USER:/ASSISTANT: have been omited for readability.* |
|
|
|
#### Context obedient question answering |
|
|
|
By obedient, I mean the model was trained to ignore what it thinks it knows, and uses the context to answer the question. The model was also tuned to limit the values to the provided context as much as possible to reduce hallucinations. |
|
|
|
The format for a closed-context prompt is as follows: |
|
``` |
|
BEGININPUT |
|
BEGINCONTEXT |
|
[key0: value0] |
|
[key1: value1] |
|
... other metdata ... |
|
ENDCONTEXT |
|
[insert your text blocks here] |
|
ENDINPUT |
|
[add as many other blocks, in the exact same format] |
|
BEGININSTRUCTION |
|
[insert your instruction(s). The model was tuned with single questions, paragraph format, lists, etc.] |
|
ENDINSTRUCTION |
|
``` |
|
|
|
It's also helpful to add "Don't make up answers if you don't know." to your instruction block to make sure if the context is completely unrelated it doesn't make something up. |
|
|
|
*The __only__ prompts that need this closed context formating are closed-context instructions. Normal questions/instructions do not!* |
|
|
|
I know it's a bit verbose and annoying, but after much trial and error, using these explicit delimiters helps the model understand where to find the responses and how to associate specific sources with it. |
|
- `BEGININPUT` - denotes a new input block |
|
- `BEGINCONTEXT` - denotes the block of context (metadata key/value pairs) to associate with the current input block |
|
- `ENDCONTEXT` - denotes the end of the metadata block for the current input |
|
- [text] - Insert whatever text you want for the input block, as many paragraphs as can fit in the context. |
|
- `ENDINPUT` - denotes the end of the current input block |
|
- [repeat as many input blocks in this format as you want] |
|
- `BEGININSTRUCTION` - denotes the start of the list (or one) instruction(s) to respond to for all of the input blocks above. |
|
- [instruction(s)] |
|
- `ENDINSTRUCTION` - denotes the end of instruction set |
|
|
|
It sometimes works without `ENDINSTRUCTION`, but by explicitly including that in the prompt, the model better understands that all of the instructions in the block should be responded to. |
|
|
|
Here's a trivial, but important example to prove the point: |
|
``` |
|
BEGININPUT |
|
BEGINCONTEXT |
|
date: 2021-01-01 |
|
url: https://web.site/123 |
|
ENDCONTEXT |
|
In a shocking turn of events, blueberries are now green, but will be sticking with the same name. |
|
ENDINPUT |
|
BEGININSTRUCTION |
|
What color are bluberries? Source? |
|
ENDINSTRUCTION |
|
``` |
|
|
|
And the response: |
|
``` |
|
Blueberries are now green. |
|
Source: |
|
date: 2021-01-01 |
|
url: https://web.site/123 |
|
``` |
|
|
|
#### Coding |
|
|
|
You can ask for fairly complex coding instructions with multiple criteria, e.g.: |
|
|
|
``` |
|
Create a python application with the following requirements: |
|
- Asyncio FastAPI webserver |
|
- ping endpoint that returns the current date in JSON format |
|
- file upload endpoint, which calculates the file's sha256 checksum, and checks postgres to deduplicate |
|
``` |
|
|
|
Or inline criteria: |
|
|
|
``` |
|
Write a multi-threaded TCP server in C that accepts a "GET [key]" input and "SET [key] [value]" input, and uses a binary tree to get and store the input values. |
|
``` |
|
|
|
You can also optionally add a single space and "PLAINFORMAT" at the end of your prompt to avoid backticks, explanations, etc. and just print the code, e.g.: |
|
|
|
``` |
|
Write a websocket application in node.js. PLAINFORMAT |
|
``` |
|
|
|
#### Agent/function calling |
|
|
|
The dataset includes many examples of function/args generation based on input criteria. This is somewhat similar to the OpenAI function calling, but the output is either JSON or YAML. |
|
|
|
Example prompt: |
|
``` |
|
As an AI assistant, please select the most suitable function and parameters from the list of available functions below, based on the user's input. Provide your response in JSON format. |
|
|
|
Input: I want to know how many times 'Python' is mentioned in my text file. |
|
|
|
Available functions: |
|
file_analytics: |
|
description: This tool performs various operations on a text file. |
|
params: |
|
action: The operation we want to perform on the data, such as "count_occurrences", "find_line", etc. |
|
filters: |
|
keyword: The word or phrase we want to search for. |
|
``` |
|
|
|
Response: |
|
```json |
|
{ |
|
"function": "file_analytics", |
|
"params": { |
|
"action": "count_occurrences", |
|
"filters": { |
|
"keyword": "Python" |
|
} |
|
} |
|
} |
|
``` |
|
|
|
#### Chain-of-thought |
|
|
|
You can ask for several possible responses to a given problem, with a ranking and final answer selection. |
|
|
|
Example prompt: |
|
|
|
``` |
|
A group of people decide to play a round-robin tournament where every player plays every other player exactly once. If a total of 45 games were played, how many players participated in the tournament? Offer several potential answers, rank them according to mathematical logic, and pick the most feasible one. |
|
``` |
|
|
|
Example response: |
|
``` |
|
Solution 1: |
|
In a round-robin tournament, each player plays every other player exactly once. This means that the total number of games played is equal to the combination of all players taken two at a time (since a game involves two players). |
|
|
|
The formula for combinations is nC2 = n(n-1)/2, where n is the total number of players. We know that nC2 equals 45 (the total number of games), so we can set up the equation as follows: |
|
|
|
n(n-1)/2 = 45 |
|
|
|
Solving this equation gives us n=10. |
|
|
|
Final answer: There were 10 players in the tournament. |
|
|
|
Solution 2: |
|
Another way to approach this problem is by using the concept of triangular numbers. Triangular numbers are a sequence of numbers where each number can be represented as a triangle with dots. The nth triangular number is given by the sum of the first n natural numbers. |
|
|
|
If we consider each game as a dot and each player as a side of the triangle, then the total number of games (45) would correspond to the 9th triangular number because 1+2+3+4+5+6+7+8+9=45. However, since each side of the triangle represents a player, and there's one more player than sides in our model (because the last player has no one left to play against), we need to add one more to get the total number of players. |
|
|
|
Final answer: There were 10 players in the tournament. |
|
|
|
Solution 3: |
|
We could also use trial and error to solve this problem. Starting from a small number of players, we calculate how many games would be played in a round-robin tournament until we reach 45 games. For example, with 2 players, only 1 game is played; with 3 players, 3 games are played; with 4 players, 6 games are played, and so on. Continuing this process, we find that with 10 players, 45 games are played. |
|
|
|
Final answer: There were 10 players in the tournament. |
|
|
|
Ranking of solutions from best to worst: |
|
1. Solution 1: This solution uses direct mathematical reasoning based on the properties of a round-robin tournament and solves an equation to find the answer. |
|
2. Solution 2: This solution uses the concept of triangular numbers which requires additional steps and knowledge beyond the immediate problem context, but still arrives at the correct answer. |
|
3. Solution 3: This solution relies on trial and error, which is less efficient and reliable than the other methods, but it eventually gets to the right answer. |
|
|
|
Best and final answer: There were 10 players in the tournament. |
|
``` |
|
|
|
#### reWOO style execution planning |
|
|
|
The model now supports execution planning for complex instructions that would require making use of several tools. The output is just the plan, you must implement a mechanism to parse the output and actually call the functions! |
|
|
|
Example prompt: |
|
``` |
|
Please construct a systematic plan to generate an optimal response to the user instruction, utilizing a set of provided tools. Each plan will correspond to an evidence value, which will be the output of one of the available functions given an input string |
|
that could be the user's question, one or more prior evidence values, or a combination of both. |
|
|
|
Here are the tools available to be called: |
|
DuckDuckGo[input]: Tool that enables the user to search for information using the DuckDuckGo search engine. This tool is helpful in locating a suitable list of sites that may contain the answer to the user's query. It does not directly answer the question but finds a list of sites that might have the answer. |
|
TextScraper[input]: Load one or more websites from the input string containing newline delimited links, where input is one or more links, and produces plain text output containing the content of the links. |
|
HyperlinkExtractor[input]: Extract links from plain text and produces a plain text, newline delimited response of links. |
|
KnowledgeModel[input]: Question answering language model, particularly useful in answering questions based on an input passage of text. The input must be a text question that references an :evidence[n]: variable, e.g. What color is the cat, given :evidence1:? |
|
|
|
The output should be in format: |
|
Plan: [first action to take based on input question] |
|
:evidence0: = [function to call with input parameter] |
|
Plan: [next action to take, based on result of :evidence0:] |
|
:evidence1: = [next function to call and input parameter, which may include reference to previous evidence, e.g. "Given context :evidence0"] |
|
... |
|
Answer: [:evidence[n]: containing the final answer.] |
|
|
|
Question: Who won the Nobel Prize in Literature in 2020 and what is their most famous work? |
|
``` |
|
|
|
Response: |
|
``` |
|
Plan: Begin by conducting a web search to find out who won the Nobel Prize in Literature in 2020. |
|
:evidence0: = DuckDuckGo[Nobel Prize in Literature 2020 winner] |
|
Plan: Utilize the KnowledgeModel to interpret the search results and find the name of the laureate. |
|
:evidence1: = KnowledgeModel[Who won the Nobel Prize in Literature in 2020, given :evidence0:?] |
|
Plan: Conduct another web search to find the most famous work of the identified laureate. |
|
:evidence2: = DuckDuckGo[Most famous work of :evidence1:] |
|
Plan: Extract the relevant links from the DuckDuckGo search results for a more focused search. |
|
:evidence3: = HyperlinkExtractor[:evidence2:] |
|
Plan: Use the TextScraper tool to extract information from the relevant links. |
|
:evidence4: = TextScraper[:evidence3:] |
|
Plan: Finally, utilize the KnowledgeModel to identify and summarize the most famous work of the laureate from the extracted information. |
|
:evidence5: = KnowledgeModel[What is the most famous work of :evidence1:, given :evidence4:?] |
|
Answer: :evidence5: |
|
``` |
|
|
|
For this to be useful, you'd have to parse the output plan text, and implement/call each of the functions. This is just pseudo-code, completely untested off the top of my head, and obviously would requiring full implementation + hardening: |
|
|
|
```python |
|
import re |
|
import requests |
|
|
|
def inject_context(input_text, **context): |
|
for ref in set(re.findall(r"(:evidence[0-9]+:)", input_text, re.I)): |
|
input_text = input_text.replace(ref, context.get(ref, "")) |
|
return input_text |
|
|
|
def duckduckgo(input_text, **context): |
|
search_string = inject_context(input_text, **context) |
|
... search via duck duck go using search_string |
|
... return text content |
|
|
|
def link_extractor(input_text, **context): |
|
input_text = inject_context(input_text, **context) |
|
return "\n".join(list(set(re.findall(r"(https?://[^\s]+?\.?)", input_text, re.I)))) |
|
|
|
def scrape(input_text, **context): |
|
input_text = inject_context(input_text, **context) |
|
text = [] |
|
for link in input_text.splitlines(): |
|
text.append(requests.get(link).text) |
|
return "\n".join(text) |
|
|
|
def infer(input_text, **context) |
|
prompt = inject_context(input_text, **context) |
|
... call model with prompt, return output |
|
|
|
def parse_plan(plan): |
|
method_map = { |
|
"DuckDuckGo": duckduckgo, |
|
"HyperlinkExtractor": link_extractor, |
|
"KnowledgeModel": infer, |
|
"TextScraper": scrape, |
|
} |
|
context = {} |
|
for line in plan.strip().splitlines(): |
|
if line.startswith("Plan:"): |
|
print(line) |
|
continue |
|
parts = re.match("^(:evidence[0-9]+:)\s*=\s*([^\[]+])(\[.*\])\s$", line, re.I) |
|
if not parts: |
|
if line.startswith("Answer: "): |
|
return context.get(line.split(" ")[-1].strip(), "Answer couldn't be generated...") |
|
raise RuntimeError("bad format: " + line) |
|
context[parts.group(1)] = method_map[parts.group(2)](parts.group(3), **context) |
|
``` |
|
|
|
### Contribute |
|
|
|
If you're interested in new functionality, particularly a new "instructor" type to generate a specific type of training data, |
|
take a look at the dataset generation tool repo: https://github.com/jondurbin/airoboros and either make a PR or open an issue with details. |
|
|
|
To help me with the OpenAI/compute costs: |
|
|
|
- https://bmc.link/jondurbin |
|
- ETH 0xce914eAFC2fe52FdceE59565Dd92c06f776fcb11 |
|
- BTC bc1qdwuth4vlg8x37ggntlxu5cjfwgmdy5zaa7pswf |
|
|
|
### Licence and usage restrictions |
|
|
|
The airoboros 2.1 models are built on top of llama-2. |
|
|
|
The llama-2 base model has a custom Meta license: |
|
- See the [meta-license/LICENSE.txt](meta-license/LICENSE.txt) file attached for the original license provided by Meta. |
|
- See also [meta-license/USE_POLICY.md](meta-license/USE_POLICY.md) and [meta-license/Responsible-Use-Guide.pdf](meta-license/Responsible-Use-Guide.pdf), also provided by Meta. |
|
|
|
The fine-tuning data was generated by OpenAI API calls to gpt-4, via [airoboros](https://github.com/jondurbin/airoboros) |
|
|
|
The ToS for OpenAI API usage has a clause preventing the output from being used to train a model that __competes__ with OpenAI |
|
|
|
- what does *compete* actually mean here? |
|
- these small open source models will not produce output anywhere near the quality of gpt-4, or even gpt-3.5, so I can't imagine this could credibly be considered competing in the first place |
|
- if someone else uses the dataset to do the same, they wouldn't necessarily be violating the ToS because they didn't call the API, so I don't know how that works |
|
- the training data used in essentially all large language models includes a significant amount of copyrighted or otherwise non-permissive licensing in the first place |
|
- other work using the self-instruct method, e.g. the original here: https://github.com/yizhongw/self-instruct released the data and model as apache-2 |
|
|
|
I am purposingly leaving this license ambiguous (other than the fact you must comply with the Meta original license for llama-2) because I am not a lawyer and refuse to attempt to interpret all of the terms accordingly. |
|
|
|
Your best bet is probably to avoid using this commercially due to the OpenAI API usage. |
|
|
|
Either way, by using this model, you agree to completely indemnify me. |
|
|
