Chat & support: my new Discord server

Want to contribute? TheBloke's Patreon page

Jon Durbin的Airoboros 13B GPT4 GPTQ

这些文件是 Jon Durbin's Airoboros 13B GPT4 的GPTQ 4bit模型文件。

这是使用 GPTQ-for-LLaMa 进行4bit量化的结果。

其他可用的存储库

• 4-bit GPTQ models for GPU inference
• 4-bit, 5-bit and 8-bit GGML models for CPU(+GPU) inference
• Unquantised fp16 model in pytorch format, for GPU inference and for further conversions

如何轻松下载和使用此模型在text-generation-webui中

下载模型

点击"模型"选项卡。

在"下载自定义模型或LoRA"下，输入"TheBloke/airoboros-13b-gpt4-GPTQ"。

点击"下载"。

等待直到显示下载完成。

取消勾选"自动加载模型"。

点击左上角"模型"旁的"刷新"图标。

与AutoGPTQ一起使用（如果已安装）

在"模型下拉菜单"中选择刚下载的模型，即"airoboros-13b-gpt4-GPTQ"。

在"GPTQ"下，勾选"AutoGPTQ"。

点击右上角"为此模型保存设置"。

点击右上角"重新加载模型"。

一旦显示加载完成，点击"文本生成"选项卡并输入提示！

与GPTQ-for-LLaMa一起使用

在"模型下拉菜单"中选择刚下载的模型，即"airoboros-13b-gpt4-GPTQ"。

如果在右下角看到错误，请忽略它-这是暂时的。

在右侧填写GPTQ参数：Bits = 4，Groupsize = 128，model_type = Llama

点击右上角"为此模型保存设置"。

点击右上角"重新加载模型"。

一旦显示加载完成，点击"文本生成"选项卡并输入提示！

提供的文件

airoboros-13b-gpt4-GPTQ-4bit-128g.no-act.order.safetensors

这个文件可与GPTQ-for-LLaMa的所有版本以及AutoGPTQ一起使用。

它是使用airoboros-13b-gpt4-GPTQ-4bit-128g.no-act.order.safetensors创建的

• 与GPTQ-for-LLaMa代码的所有版本（包括Triton和CUDA分支）兼容
• 与AutoGPTQ兼容
• 与text-generation-webui的一键安装程序兼容
• 参数：Groupsize = 128。Act Order/desc_act = False。

Discord

获取进一步支持以及对这些模型和人工智能的讨论，请加入：

TheBloke AI's Discord server

致谢以及如何贡献

感谢 chirper.ai 团队！

我收到很多人询问他们是否可以做出贡献。我喜欢提供模型和帮助人们，也很愿意能够花更多时间这样做，以及扩展到新的项目，如精细调整/训练。

如果您有能力和愿意做出贡献，我将非常感激，并将帮助我继续提供更多的模型，并开始新的人工智能项目。

捐助者将优先获得有关所有AI / LLM /模型问题和请求的支持，进入私人Discord房间，以及其他好处。

• Patreon: https://patreon.com/TheBlokeAI
• Ko-Fi: https://ko-fi.com/TheBlokeAI

Patreon特别提到：Aemon Algiz，Dmitriy Samsonov，Nathan LeClaire，Trenton Dambrowitz，Mano Prime，David Flickinger，vamX，Nikolai Manek，senxiiz，Khalefa Al-Ahmad，Illia Dulskyi，Jonathan Leane，Talal Aujan，V. Lukas，Joseph William Delisle，Pyrater，Oscar Rangel，Lone Striker，Luke Pendergrass，Eugene Pentland，Sebastain Graf，Johann-Peter Hartman。

感谢所有慷慨的赞助者和捐助者！

原始模型卡片：Jon Durbin的Airoboros 13B GPT4

概述

这是使用完全合成的训练数据通过 https://github.com/jondurbin/airoboros 创建的13b参数LlaMa模型的微调版本。

增加了上下文大小到4096。

用于微调此模型的数据集可在 here 中获得，具体用途为：

• 小知识
• 数学/推理（虽然效果不佳）
• 编码
• 多项选择和填空题
• 遵守上下文的问题回答
• 心智理论
• 其他/综合

此模型是使用FastChat的一个分支进行微调的，因此使用了标准的vicuna模板：

USER:
[prompt]

<\s>
ASSISTANT:

对我来说，最重要的部分是上下文服从的问题回答支持，无需进行大量的提示工程。

用法

最简单的方法是使用我的FastChat分支，它与原版大致相同，但允许增加上下文长度并支持多行输入：

pip install git+https://github.com/jondurbin/FastChat

然后，你可以这样调用它（在下载模型之后）：

python -m fastchat.serve.cli
  --model-path airoboros-13b-gpt4 \
  --temperature 0.5 \
  --max-new-tokens 4096 \
  --context-length 4096 \
  --conv-template vicuna_v1.1 \
  --no-history

上下文服从的问题回答

通过服从，我指的是模型经过训练忽略其认为自己所知道的内容，并使用上下文来回答问题。模型还被调整为尽可能地限制值在提供的上下文中，以减少错误想象。

封闭上下文提示的格式如下：

BEGININPUT
BEGINCONTEXT
url: https://some.web.site/123
date: 2023-06-01
... 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

这里有一个微不足道但重要的示例来证明这一点：

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

响应：

Blueberries are now green.
Source:
date: 2021-01-01
url: https://web.site/123

这是另一个例子，从多个输入块中提取并连接两者。

提示：

BEGININPUT
BEGINCONTEXT
name: John Doe
date: June 3, 2023
ticket number: JIRA-12345
ENDCONTEXT
Summary:Search results missing random items

Description:
I encountered a bug while performing a search within the application.
It appears that the search results are missing random items that should be displayed.
This issue is affecting the accuracy and completeness of the search functionality.

Steps to Reproduce:
1. Log in to the application.
2. Navigate to the search feature.
3. Enter a search query that should return multiple results.
4. Observe the displayed search results.

Expected Results:
The search results should include all relevant items matching the search query.

Actual Results:
The search results occasionally exclude random items that should be displayed.
It seems that the missing items do not follow a specific pattern or criteria.
Upon multiple search attempts, different items are omitted each time, making it difficult to predict which items will be missing.
ENDINPUT

BEGININPUT
BEGINCONTEXT
date: 2023-06-05
user: Jack Johnson
pr: 23441
ENDCONTEXT
This pull request closes bug report JIRA-12345.

The issue was that the pagination code was using page size plus one instead of page size.
ENDINPUT

BEGININSTRUCTION
Do we have any bug reports related to search results?  If so, were they fixed?  Source?
ENDINSTRUCTION

回答：

Yes, there is a bug report related to search results. The issue was fixed in pull request 23441 dated 2023-06-05. The user associated with the pull request is Jack Johnson.

Reference(s):
date: 2023-06-05
user: Jack Johnson
pr: 23441

其他内容

更好的编码

例子：

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

响应（输出是Markdown，所以这只是复制粘贴）

要使用给定的要求创建一个Python应用程序，可以按照以下步骤进行操作：

安装所需的软件包：

pip install asyncio fastapi uvicorn

创建一个名为main.py的新文件，并添加以下代码：

import asyncio
from fastapi import FastAPI, HTTPException
from pydantic import BaseModel
from typing import List
from uvicorn.request import Request

app = FastAPI()


class FileModel(BaseModel):
    id: str
    file: str


@app.post("/upload", response_model=FileModel)
async def upload_file(file_model: FileModel):
    # Check if the file is valid
    if not file_model.file:
        raise HTTPException(status_code=400, detail="File must be provided")

    # Calculate the sha256 checksum of the file
    sha256_checksum = await calculate_sha256(file_model.file)

    # Insert the file into the database
    await insert_into_db(file_model.id, sha256_checksum)

    return {"sha256_checksum": sha256_checksum}


async def calculate_sha256(file_path: str) -> str:
    # Implement the sha256 calculation logic here
    pass


async def insert_into_db(file_id: str, sha256_checksum: str) -> None:
    # Implement the database insertion logic here
    pass


async def get_current_date():
    return {"date": datetime.now().isoformat()}


async def main():
    # Start the FastAPI webserver
    app.run(debug=True)


if __name__ == "__main__":
    await main()

将calculate_sha256()和insert_into_db()函数的内容替换为适当的代码。例如：

async def calculate_sha256(file_path: str) -> str:
    import hashlib
    file_path = Path(file_path).read_text()
    hash_obj = hashlib.sha256()
    hash_obj.update(file_path)
    sha256_checksum = hash_obj.hexdigest()
    return sha256_checksum


async def insert_into_db(file_id: str, sha256_checksum: str) -> None:
    import psycopg2
    conn = psycopg2.connect(database="your_database", user="your_user", password="your_password")
    cursor = conn.cursor()

    query = f"INSERT INTO your_table (id, sha256_checksum) VALUES (%s, %s);"
    cursor.execute(query, (file_id, sha256_checksum))
    conn.commit()

    cursor.close()
    conn.close()

将get_current_date()函数的内容替换为适当的代码。例如：

async def get_current_date():
    return {"date": datetime.now().isoformat()}

运行应用程序：

uvicorn main:app --reload

现在，你的FastAPI Web服务器有一个返回当前日期的JSON格式的ping端点，以及一个计算文件的SHA256校验和并检查Postgres进行去重的上传端点。

用C编写一个多线程的TCP服务器，接受"GET [key]"输入和"SET [key] [value]"输入，并使用二叉树来获取和存储输入值。

以下是使用C编写的一个简单实现的多线程TCP服务器，可以接受"GET [key]"和"SET [key] [value]"输入，并使用二叉树存储输入值。

#include <stdio.h>
#include <stdlib.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <unistd.h>
#include <string.h>
#include <pthread.h>

#define MAX_KEY_LEN 256
#define MAX_VALUE_LEN 256

typedef struct Node {
    char key[MAX_KEY_LEN];
    char value[MAX_VALUE_LEN];
    struct Node* left;
    struct Node* right;
} TreeNode;

TreeNode* tree = NULL;

void insert(char* key, char* value) {
    TreeNode* parent = (TreeNode*)malloc(sizeof(TreeNode));
    if (!parent) {
        perror("malloc failed");
        exit(1);
    }

    strcpy(parent->key, key);
    strcpy(parent->value, value);

    parent->left = parent->right = NULL;

    if (!tree) {
        tree = parent;
    } else {
        insert(parent->key, parent->value);
    }
}

char* search(char* key) {
    TreeNode* current = tree;
    while (current != NULL) {
        if (strcmp(key, current->key) == 0) {
            return current->value;
        }
        current = current->right;
    }

    return NULL;
}

void print_tree() {
    TreeNode* current = tree;
    while (current != NULL) {
        printf("%s = %s\n", current->key, current->value);
        current = current->right;
    }
}

void* accept_client(void* args) {
    int client_socket = *(int*)args;
    char buffer[1024];

    while (1) {
        ssize_t bytes_received = recv(client_socket, buffer, sizeof(buffer), 0);
        if (bytes_received <= 0) {
            close(client_socket);
            break;
        }

        char* input = buffer;
        char* input_token;

        while ((input_token = strtok(input, " \n")) != NULL) {
            switch (input_token[0]) {
                case 'G':
                    if (!search(input_token)) {
                        perror("Value not found");
                        exit(1);
                    }
                    printf("%s = %s\n", input_token, search(input_token));
                    break;

                case 'S':
                    if (!strcmp(input_token, "SET")) {
                        char* key = strtok(NULL, " \n");
                        char* value = strtok(NULL, " \n");
                        if (!key || !value) {
                            perror("Invalid input");
                            exit(1);
                        }

                        insert(key, value);
                        printf("%s set %s to %s\n", input_token, key, value);
                    } else {
                        perror("Invalid command");
                        exit(1);
                    }
                    break;

                default:
                    perror("Invalid input");
                    exit(1);
            }

            input = strtok(NULL, " \n");
        }
    }

    return NULL;
}

int main() {
    int server_socket = socket(AF_INET, SOCK_STREAM, 0);
    if (server_socket < 0) {
        perror("socket failed");
        exit(1);
    }

    struct sockaddr_in server_addr;
    memset(&server_addr, 0, sizeof(server_addr));
    server_addr.sin_family = AF_INET;
    server_addr.sin_port = htons(8080);
    server_addr.sin_addr.s_addr = INADDR_ANY;

    if (bind(server_socket, (struct sockaddr*)&server_addr, sizeof(server_addr)) < 0) {
        perror("bind failed");
        exit(1);
    }

    if (listen(server_socket, 5) < 0) {
        perror("listen failed");
        exit(1);
    }

    pthread_t accept_thread;
    pthread_create(&accept_thread, NULL, accept_client, &server_socket);

    char* client_input;
    int client_socket = accept(server_socket, (struct sockaddr*)NULL, NULL);
    if (client_socket < 0) {
        perror("accept failed");
        exit(1);
    }

    while (1) {
        sleep(1);

        char buffer[1024];
        ssize_t bytes_received = recv(client_socket, buffer, sizeof(buffer), 0);
        if (bytes_received <= 0) {
            close(client_socket);
            break;
        }

        client_input = buffer;
        parse_input(client_input);
    }

    close(client_socket);
    pthread_join(accept_thread, NULL);

    return 0;
}

要编译和运行此代码，将其保存到一个名为multi_threaded_tcp_server.c的文件中，然后使用以下命令：

gcc -o multi_threaded_tcp_server multi_threaded_tcp_server.c
./multi_threaded_tcp_server

此实现创建了一个简单的二叉树来存储输入值。accept()函数为每个客户端连接创建一个新线程，该线程处理传入数据并将其转发到主线程。主线程解析输入字符串并处理SET和GET命令。

请注意，此代码不适用于生产环境，并且应该通过改进错误处理、安全检查以及用于二叉树的更有效的数据结构来改进。

文字游戏/琐事

USER: This anagram of "silent" is what you do when paying attention and hearing someone.
ASSISTANT: listen

USER: Give me a list of 7 words that start with EN
ASSISTANT: 1. Endlessly
2. Enthusiastically
3. Enormously
4. Enveloping
5. Enduring
6. Enlightening
7. Encouraging

多项选择

USER: Which of the following astronomical objects is composed primarily of ice and rock, and is located in the Kuiper Belt?

A) Mercury
B) Venus
C) Pluto
D) Jupiter
ASSISTANT: [C, Pluto]

写作 以海盗船长的方式写一封辞职信，辞去你的清洁工职位。

回答：

ASSISTANT: Captain Jack Sparrow here, as ye be knowin', has been forced to abandon me post as Janitor o' th' Festering Cesspool, which be a filthy hole o' water that we be callin' home.

Ye may be thinkin' what could ha' driven me to leave me duties an' take me leave o' this sorry establishment? Well, ye'd be right in thinkin' so, for it be th' greed o' them what runs th' place that be drivin' me away. They've been fattenin' their pockets on me back while I've been slavin' me guts out cleanin' up their messes.

No more, me hearties! Me time o' servin' th' rich an' powerful be done, an' I'm takin' me leave o' this stinkin' hole forever! Me destiny lies elsewhere, an' it be time I pursued it. Ye may think ye've seen th' last o' me, but ye'd be wrong, for th' winds o' change be blowin', an' me ship be ready to set sail on th' high seas o' justice.

So, farewell ye scurvy dogs, ye who've made me life a living hell. I leave ye with me favorite saying: "ARRRGGGHHH, ye scurvy dogs!" An' remember, ye ain't never gonna see me comin', for me shadow be castin' long an' dark on th' horizon</summary>