Downloads · 30 days
782
13% of all-time downloads
RichardErkhov/internlm_-_AlchemistCoder-L-7B-gguf
internlm_-_AlchemistCoder-L-7B-gguf is a machine learning model from RichardErkhov. Use it for the machine learning task on the model card, and read the license before you ship it in a product.
Downloads · 30 days
782
13% of all-time downloads
All-time downloads
6K
Public
Repo size
81.6 GB
Likes
0
Public
Click a slice to open those files.
.gguf88.7 GB · 100%
From the Hugging Face model README
Quantization made by Richard Erkhov.
AlchemistCoder-L-7B - GGUF
| Name | Quant method | Size |
|---|---|---|
| AlchemistCoder-L-7B.Q2_K.gguf | Q2_K | 2.36GB |
| AlchemistCoder-L-7B.IQ3_XS.gguf | IQ3_XS | 2.6GB |
| AlchemistCoder-L-7B.IQ3_S.gguf | IQ3_S | 2.75GB |
| AlchemistCoder-L-7B.Q3_K_S.gguf | Q3_K_S | 2.75GB |
| AlchemistCoder-L-7B.IQ3_M.gguf | IQ3_M | 2.9GB |
| AlchemistCoder-L-7B.Q3_K.gguf | Q3_K | 3.07GB |
| AlchemistCoder-L-7B.Q3_K_M.gguf | Q3_K_M | 3.07GB |
| AlchemistCoder-L-7B.Q3_K_L.gguf | Q3_K_L | 3.35GB |
| AlchemistCoder-L-7B.IQ4_XS.gguf | IQ4_XS | 3.4GB |
| AlchemistCoder-L-7B.Q4_0.gguf | Q4_0 | 3.56GB |
| AlchemistCoder-L-7B.IQ4_NL.gguf | IQ4_NL | 3.58GB |
| AlchemistCoder-L-7B.Q4_K_S.gguf | Q4_K_S | 3.59GB |
| AlchemistCoder-L-7B.Q4_K.gguf | Q4_K | 3.8GB |
| AlchemistCoder-L-7B.Q4_K_M.gguf | Q4_K_M | 3.8GB |
| AlchemistCoder-L-7B.Q4_1.gguf | Q4_1 | 3.95GB |
| AlchemistCoder-L-7B.Q5_0.gguf | Q5_0 | 4.33GB |
| AlchemistCoder-L-7B.Q5_K_S.gguf | Q5_K_S | 4.33GB |
| AlchemistCoder-L-7B.Q5_K.gguf | Q5_K | 4.45GB |
| AlchemistCoder-L-7B.Q5_K_M.gguf | Q5_K_M | 4.45GB |
| AlchemistCoder-L-7B.Q5_1.gguf | Q5_1 | 4.72GB |
| AlchemistCoder-L-7B.Q6_K.gguf | Q6_K | 5.15GB |
| AlchemistCoder-L-7B.Q8_0.gguf | Q8_0 | 6.67GB |
license: apache-2.0 tags:
[🤗 HuggingFace] [📃 Paper] [🌐 Project Page]
Abstract: Open-source Large Language Models (LLMs) and their specialized variants, particularly Code LLMs, have recently delivered impressive performance. However, previous Code LLMs are typically fine-tuned on single-source data with limited quality and diversity, which may insufficiently elicit the potential of pre-trained Code LLMs. In this paper, we present AlchemistCoder, a series of Code LLMs with enhanced code generation and generalization capabilities fine-tuned on multi-source data. To achieve this, we pioneer to unveil inherent conflicts among the various styles and qualities in multi-source code corpora and introduce data-specific prompts with hindsight relabeling, termed AlchemistPrompts, to harmonize different data sources and instruction-response pairs. Additionally, we propose incorporating the data construction process into the fine-tuning data as code comprehension tasks, including instruction evolution, data filtering, and code review. Extensive experiments demonstrate that AlchemistCoder holds a clear lead among all models of the same size (6.7B/7B) and rivals or even surpasses larger models (15B/33B/70B), showcasing the efficacy of our method in refining instruction-following capabilities and advancing the boundaries of code intelligence.
import torch
from transformers import AutoModelForCausalLM, AutoTokenizer
tokenizer = AutoTokenizer.from_pretrained("internlm/AlchemistCoder-L-7B", trust_remote_code=True)
model = AutoModelForCausalLM.from_pretrained("internlm/AlchemistCoder-L-7B", trust_remote_code=True, torch_dtype=torch.bfloat16).cuda()
model = model.eval()
input_text = "Implement the Dijkstra algorithm in Python"
inputs = tokenizer(input_text, return_tensors="pt").to(model.device)
outputs = model.generate(**inputs, max_length=128)
print(tokenizer.decode(outputs[0], skip_special_tokens=True))
Please refer to AlchemistCoder and InternLM.
AlchemistCoder is built with InternLM and OpenCompass. Thanks for their awesome work!
If you have any questions, please create an issue on this repository or contact us at:
If you find our work useful, please consider citing:
@misc{song2024alchemistcoder,
title={AlchemistCoder: Harmonizing and Eliciting Code Capability by Hindsight Tuning on Multi-source Data},
author={Zifan Song and Yudong Wang and Wenwei Zhang and Kuikun Liu and Chengqi Lyu and Demin Song and Qipeng Guo and Hang Yan and Dahua Lin and Kai Chen and Cairong Zhao},
year={2024},
eprint={2405.19265},
archivePrefix={arXiv},
primaryClass={cs.CL}
}