Codegemma 7b

🚀 CodeGemma

CodeGemma is a collection of lightweight open code models built on top of Gemma. It offers different variants for code completion, generation, chat, and instruction - following tasks, providing high - performance open code - focused solutions.

🚀 Quick Start

To access CodeGemma on Hugging Face, you’re required to review and agree to Google’s usage license. To do this, please ensure you’re logged - in to Hugging Face and click the "Acknowledge license" button below. Requests are processed immediately.

✨ Features

• Multiple Variants: Available as a 7 billion pretrained variant for code completion and generation, a 7 billion parameter instruction - tuned variant for code chat and instruction following, and a 2 billion parameter pretrained variant for fast code completion.
• Diverse Functionality: Supports code completion, generation from natural language, code chat, and instruction following.

📦 Installation

No specific installation steps are provided in the original document.

💻 Usage Examples

Basic Usage

For Code Completion

from transformers import GemmaTokenizer, AutoModelForCausalLM

model_id = "google/codegemma-7b"
tokenizer = GemmaTokenizer.from_pretrained(model_id)
model = AutoModelForCausalLM.from_pretrained(model_id)

prompt = '''\
<|fim_prefix|>import datetime
def calculate_age(birth_year):
    """Calculates a person's age based on their birth year."""
    current_year = datetime.date.today().year
    <|fim_suffix|>
    return age<|fim_middle|>\
'''

inputs = tokenizer(prompt, return_tensors="pt").to(model.device)
prompt_len = inputs["input_ids"].shape[-1]
outputs = model.generate(**inputs, max_new_tokens=100)
print(tokenizer.decode(outputs[0][prompt_len:]))

For Code Generation

from transformers import GemmaTokenizer, AutoModelForCausalLM

tokenizer = GemmaTokenizer.from_pretrained("google/codegemma-7b")
model = AutoModelForCausalLM.from_pretrained("google/codegemma-7b")

input_text = "Write me a Python function to calculate the nth fibonacci number."
input_ids = tokenizer(input_text, return_tensors="pt")

outputs = model.generate(**input_ids)
print(tokenizer.decode(outputs[0]))

Advanced Usage

Handling Termination Tokens in Code Completion

FIM_PREFIX = '<|fim_prefix|>'
FIM_SUFFIX = '<|fim_suffix|>'
FIM_MIDDLE = '<|fim_middle|>'
FIM_FILE_SEPARATOR = '<|file_separator|>'

terminators = tokenizer.convert_tokens_to_ids([FIM_PREFIX, FIM_MIDDLE, FIM_SUFFIX, FIM_FILE_SEPARATOR])
terminators += [tokenizer.eos_token_id]

outputs = model.generate(
  **inputs,
  max_new_tokens=100,
  eos_token_id=terminators,
)

📚 Documentation

Model Information

Description

CodeGemma is a collection of lightweight open code models built on top of Gemma. CodeGemma models are text - to - text and text - to - code decoder - only models. There are a 7 billion pretrained variant for code completion and generation, a 7 billion parameter instruction - tuned variant for code chat and instruction following, and a 2 billion parameter pretrained variant for fast code completion.

Inputs and Outputs

• Inputs:
  • For pretrained model variants: code prefix and/or suffix for code completion and generation scenarios, or natural language text or prompt.
  • For instruction tuned model variant: natural language text or prompt.
• Outputs:
  • For pretrained model variants: fill - in - the - middle code completion, code and natural language.
  • For instruction tuned model variant: code and natural language.

Model Data

Training Dataset

Using Gemma as the base model, CodeGemma 2B and 7B pretrained variants are further trained on an additional 500 billion tokens of primarily English language data from publicly available code repositories, open source mathematics datasets and synthetically generated code.

Training Data Processing

• FIM Pretrained CodeGemma models focus on fill - in - the - middle (FIM) tasks. The models are trained to work with both PSM and SPM modes. Our FIM settings are 80% FIM rate with 50 - 50 PSM/SPM.
• Dependency Graph - based Packing and Unit Test - based Lexical Packing techniques: To improve model alignment with real - world applications, we structured training examples at the project/repository level to co - locate the most relevant source files within each repository. Specifically, we employed two heuristic techniques: dependency graph - based packing and unit test - based lexical packing.
• We developed a novel technique for splitting the documents into prefix, middle, and suffix to make the suffix start in a more syntactically natural point rather than purely random distribution.
• Safety: Similarly to Gemma, we deployed rigorous safety filtering including filtering personal data, CSAM filtering and other filtering based on content quality and safety in line with our policies.

Implementation Information

Hardware

CodeGemma was trained using the latest generation of Tensor Processing Unit (TPU) hardware (TPUv5e).

Software

Training was done using JAX and ML Pathways.

Evaluation Information

Evaluation Approach

We evaluate CodeGemma on a variety of academic benchmarks across several domains:

• Code completion benchmarks: HumanEval Single Line and Multiple Line Infilling
• Code generation benchmarks: HumanEval, MBPP, BabelCode (C++, C#, Go, Java, JavaScript, Kotlin, Python, Rust)
• Q&A: BoolQ, PIQA, TriviaQA
• Natural Language: ARC - Challenge, HellaSwag, MMLU, WinoGrande
• Math Reasoning: GSM8K, MATH

Evaluation Results

Coding Benchmarks

Natural Language Benchmarks

Ethics and Safety

Evaluation Approach

Our evaluation methods include structured evaluations and internal red - teaming testing of relevant content policies. Red - teaming was conducted by different teams with different goals and human evaluation metrics. These models were evaluated against categories relevant to ethics and safety, including:

• Human evaluation on prompts covering content safety and representational harms. See the Gemma model card for more details on evaluation approach.
• Specific testing of cyber - offence capabilities, focusing on testing autonomous hacking capabilities and ensuring potential harms are limited.

Evaluation Results

The results of ethics and safety evaluations are within acceptable thresholds for meeting internal policies for categories such as child safety, content safety, representational harms, memorization, large - scale harms. See the Gemma model card for more details.

Model Usage & Limitations

Intended Usage

• Code Completion: PT models can be used to complete code with an IDE extension.
• Code Generation: IT model can be used to generate code with or without an IDE extension.
• Code Conversation: IT model can power conversation interfaces which discuss code.
• Code Education: IT model supports interactive code learning experiences, aids in syntax correction or provides coding practice.

Known Limitations

Large Language Models (LLMs) have limitations based on their training data and the inherent limitations of the technology. See the Gemma model card for more details on the limitations of LLMs.

Ethical Considerations & Risks

The development of large language models (LLMs) raises several ethical concerns. We have carefully considered multiple aspects in the development of these models. Please refer to the same discussion in the Gemma model card for model details.

Benefits

At the time of release, this family of models provides high - performance open code - focused large language model implementations.

🔧 Technical Details

CodeGemma was trained using the latest generation of Tensor Processing Unit (TPU) hardware (TPUv5e) and software tools like JAX and ML Pathways. The training data processing involves techniques such as FIM task - focused training, dependency graph - based packing, and a novel document splitting technique.

📄 License

The model is under the gemma license.