中文

Chat & support: my new Discord server

Want to contribute? TheBloke's Patreon page

Wizard Mega 13B GPTQ

This repo contains 4bit GPTQ format quantised models of OpenAccess AI Collective's Wizard Mega 13B .

It is the result of quantising to 4bit using GPTQ-for-LLaMa .

Repositories available

How to easily download and use this model in text-generation-webui

Open the text-generation-webui UI as normal.

  • Click the Model tab .
  • Under Download custom model or LoRA , enter TheBloke/wizard-mega-13B-GPTQ .
  • Click Download .
  • Wait until it says it's finished downloading.
  • Click the Refresh icon next to Model in the top left.
  • In the Model drop-down : choose the model you just downloaded, wizard-mega-13B-GPTQ .
  • If you see an error in the bottom right, ignore it - it's temporary.
  • Fill out the GPTQ parameters on the right: Bits = 4 , Groupsize = 128 , model_type = Llama
  • Click Save settings for this model in the top right.
  • Click Reload the Model in the top right.
  • Once it says it's loaded, click the Text Generation tab and enter a prompt!
  • Provided files

    wizard-mega-13B-GPTQ-4bit-128g.no-act-order.safetensors

    This will work with all versions of GPTQ-for-LLaMa. It has maximum compatibility.

    It was created without --act-order to ensure compatibility with all UIs out there.

    • wizard-mega-13B-GPTQ-4bit-128g.safetensors
      • Works with all versions of GPTQ-for-LLaMa code, both Triton and CUDA branches
      • Works with text-generation-webui one-click-installers
      • Parameters: Groupsize = 128. No act-order.
      • Command used to create the GPTQ:
        python llama.py /workspace/models/openaccess-ai-collective_wizard-mega-13b c4 --wbits 4 --true-sequential --groupsize 128  --save_safetensors /workspace/wizard-mega-13b/gptq/wizard-mega-13B-GPTQ-4bit-128g.no-act-order.safetensors
        

    Discord

    For further support, and discussions on these models and AI in general, join us at:

    TheBloke AI's Discord server

    Thanks, and how to contribute.

    Thanks to the chirper.ai team!

    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 special mentions : 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.

    Thank you to all my generous patrons and donaters!

    Original Wizard Mega 13B model card

    Wizard Mega is a Llama 13B model fine-tuned on the ShareGPT , WizardLM , and Wizard-Vicuna datasets. These particular datasets have all been filtered to remove responses where the model responds with "As an AI language model...", etc or when the model refuses to respond.

    Release (Epoch Two)

    The Wizard Mega 13B SFT model is being released after two epochs as the eval loss increased during the 3rd (final planned epoch). Because of this, we have preliminarily decided to use the epoch 2 checkpoint as the final release candidate. https://wandb.ai/wing-lian/vicuna-13b/runs/5uebgm49

    Build

    Wizard Mega was built with Axolotl on 8xA100 80GB for 15 hours. The configuration to duplicate this build is provided in this repo's /config folder .

    Examples

    ### Instruction: write Python code that returns the first n numbers of the Fibonacci sequence using memoization.
    
    ### Assistant:
    ```python
    def fib(n):
        if n < 2:
            return n
        elif n in cache:
            return cache[n]
        else:
            a, b = 0, 1
            for i in range(2, n+1):
                cache[i] = a
                a, b = b, a + b
            return cache[n]
    
    def first_n(n):
        fib_list = [fib(i) for i in range(n+1)]
        return fib_list[:n]
    ```
    This function uses memoization to store the values of previous Fibonacci numbers in a cache. This way, if the same number is requested again, it can be returned immediately without recalculating it.
    The `first_n` function takes an integer `n` as input, and calculates the first n numbers of the Fibonacci sequence using memoization. It returns a list of those numbers.
    
    ### Instruction: Finish the joke, a mechanic and a car salesman walk into a bar...
    
    ### Assistant:  ...and the bartender says "Hey guys, what can I get for you?" The mechanic replies, "I'll have a beer, but make it a quick one. I have to fix this guy's car before he finds out I
     fiddled with his brakes." The salesman quips, "And I'll have a martini, shaken not stirred. After all, I have to sell this guy a car that doesn't break down on him within the first year of ownership."