2 versions
The latest open source large language model released by Meta. The structure of this implementation of the model was inspired by Andrej Karpathy's llama.c, and originally written in Mojo by Aydyn Tairov. The model itself has been constructed from end to end using the MAX Graph API.
Read the code and instructions, and run on desktop.
2 versions
The latest open source large language model released by Meta. The structure of this implementation of the model was inspired by Andrej Karpathy's llama.c, and originally written in Mojo by Aydyn Tairov. The model itself has been constructed from end to end using the MAX Graph API.
Read the code and instructions, and run on desktop.
Language: Python
API: MAX Graph
This pipeline demonstrates text completion from an initial prompt using the Llama 3.1 large language model. The model itself has been constructed in Python using the MAX Graph API.
The MAX Graph API provides an accessible interface to the construction of flexible accelerated compute graphs, which are then optimized by the MAX Engine's advanced graph compiler. This pipeline showcases how a large language model can be fully defined using Python and MAX Graphs and then compiled for optimal inference performance via the MAX Engine.
Llama 3.1 is an open source large language model released by Meta. The structure of this implementation was inspired by Andrej Karpathy's llama2.c and its Mojo port by Aydyn Tairov.
The text completion demo is compatible with the the official Llama 3 text completion demo.
The default settings for this pipeline use the 8B set of pretrained weights in
q4_k
quantized encodings.
Install MAX:
If MAX is not already installed, follow the installation instructions to set it up on your system.
Clone the MAX examples repository:
If you don't already have a local clone of this repository, create one via:
git clone https://github.com/modularml/max.git
The following instructions assume that you're present within this pipeline's directory, and you can change to it after cloning:
cd max/pipelines/python/
Run the text completion demo:
On first execution, the tokenizer library and model weights will be
downloaded and placed in a local .cache/
directory in your current path.
The model will then be compiled and text completion will begin from the
specified prompt.
All of the pipelines have been configured to use a common driver, located in the directory hosting all MAX Graph examples. Assuming you're starting at the path of this README, the command invocation will look like:
python3 pipelines.py llama3 --prompt "I believe the meaning of life is"
The following command-line options are available to customize operation of the pipeline:
--max-length
: Controls the maximum length of the text sequence
(includes the input tokens).
(Default value: 512)--max-new-tokens
: The maximum number of new tokens to generate. If a -1
value is provided, the model will continue to generate tokens for the entire
context length. (Default value: -1)
--model-path
to specify locally downloaded full-precision weights for use
in the model.
Valid values: q4_0
, q4_k
, q6_k
, float32
.
(Default value: float32
).--prompt
: The text prompt to use for further generation.--quantization-encoding
: The encoding to use for a datatype that can be
quantized to a low bits per weight format. The options for quantized formats
will download and cache default weights, but float32
requires the use of--serialized-model-path
: If specified, tries to load a serialized model
from this path.--version
: Selects which version in the Llama 3 family to use.
Valid values: 3
, 3.1
.
(Default value: 3.1
)--weight-path
: Overrides the default URL, and allows for an
already-downloaded pretrained weight file to be used with the model.214 lines - 7.29 KB
Graph
# ===----------------------------------------------------------------------=== #
# Copyright (c) 2024, Modular Inc. All rights reserved.
#
# Licensed under the Apache License v2.0 with LLVM Exceptions:
# https://llvm.org/LICENSE.txt
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
# ===----------------------------------------------------------------------=== #
from dataclasses import dataclass
from pathlib import Path
from typing import KeysView, Union
import gguf
import numpy as np
from max.dtype import DType
from max.engine import InferenceSession, Model
from max.graph import Graph, TensorType
from max.graph.utils.load_gguf import Weights
from utils import gguf_utils, tokenizer_from_gguf
from .config import InferenceConfig, SupportedVersions
from .gguf import transformer
from .kv_cache import KVCache
from .model.hyperparameters import Hyperparameters
@dataclass
class Llama3Context:
"""The context for text generation using a Llama 3 model."""
next_token: np.ndarray
prompt_size: int
max_tokens: int
prompt: str
def _llama_graph(
batch_size: int, params: Hyperparameters, weights: Weights
) -> Graph:
cache_type = TensorType(
DType.float32,
shape=[
"start_pos",
params.n_layers,
batch_size,
params.n_kv_heads,
params.head_dim,
],
)
tokens_type = TensorType(DType.int64, shape=[batch_size, "seq_len"])
with Graph(
"llama3", input_types=[tokens_type, cache_type, cache_type]
) as graph:
model = transformer(graph, params, weights)
logits, k_update, v_update = model(*graph.inputs)
graph.output(logits[:, -1], k_update, v_update)
return graph
class Llama3:
"""The overall interface to the Llama 3 model."""
config: InferenceConfig
_model: Model
_kv_cache: KVCache
_sessions: dict[str, int]
def __init__(self, config: InferenceConfig):
self.config = config
assert config.weight_path is not None
gguf_reader = gguf.GGUFReader(config.weight_path)
params = _read_hyperparameters(config, gguf_reader)
self._model = self._load_model(config, params, gguf_reader)
self._tokenizer = tokenizer_from_gguf(gguf_reader)
# Work around for older Llama 1/2 GGUFs, where the vocab size may be -1.
# See https://github.com/ggerganov/llama.cpp/pull/4258.
if params.vocab_size < 0:
params.vocab_size = self._tokenizer.vocab_size
self._kv_cache = KVCache(
params.seq_len,
config.batch_size,
params.n_layers,
params.n_kv_heads,
params.head_dim,
)
self._sessions = {}
def _load_model(
self,
config: InferenceConfig,
params: Hyperparameters,
reader: gguf.GGUFReader,
) -> Model:
session = InferenceSession()
if serialized_path := config.serialized_model_path:
print("Loading serialized model from", serialized_path, "...")
return session.load(serialized_path)
else:
graph = _llama_graph(config.batch_size, params, Weights(reader))
print("Compiling...")
return session.load(graph)
def _get_attention_mask(self, n: int):
mask = np.ones(shape=(1, n)).astype(bool)
return mask
async def new_context(self, prompt: str) -> Llama3Context:
encoded_prompt = self._tokenizer.encode(prompt)
prompt_size = len(encoded_prompt)
return Llama3Context(
next_token=np.array(encoded_prompt).reshape(1, -1),
prompt_size=prompt_size,
max_tokens=_max_tokens_to_generate(prompt_size, self.config),
prompt=prompt,
)
async def next_token(
self, batch: dict[str, Llama3Context]
) -> dict[str, str]:
# Note: assuming a single request.
assert len(batch) == self.config.batch_size == 1
request_id, context = next(iter(batch.items()))
# This feels really contrived, but it's because our KV cache setup
# just doesn't meaningfully support batch size > 1 yet.
if request_id not in self._sessions:
self._sessions[request_id] = 0
self._kv_cache.sequence_length = 0
cache = self._kv_cache
input_names = [t.name for t in self._model.input_metadata]
output_names = [t.name for t in self._model.output_metadata]
# TODO (MSDK-844): Remove this when attention masks are harmonized between Mojo and Python graphs.
if len(input_names) == 4:
inputs = [
context.next_token,
self._get_attention_mask(
cache.sequence_length + context.next_token.shape[1]
),
cache.keys_view(),
cache.values_view(),
]
else:
inputs = [
context.next_token,
cache.keys_view(),
cache.values_view(),
]
result = self._model.execute(**dict(zip(input_names, inputs)))
logits, k_cache, v_cache = (result[o] for o in output_names)
self._kv_cache.update(k_cache, v_cache)
# TODO: Add a weighted sampler here.
# Get argmax of the logits of the last token.
next_token = logits.argmax(axis=-1)[-1]
context.next_token = next_token.reshape(1, -1)
decoded_token = self._tokenizer.decode(next_token)
if decoded_token == self._tokenizer.eos_token:
return {}
return {request_id: decoded_token}
def _max_tokens_to_generate(prompt_size: int, config: InferenceConfig) -> int:
"""Returns the max number of tokens to generate (including the prompt)."""
if config.max_new_tokens < 0:
return config.max_length
return min(config.max_new_tokens + prompt_size, config.max_length)
def _read_hyperparameters(
config: InferenceConfig, reader: gguf.GGUFReader
) -> Hyperparameters:
key_names = {
"n_layers": "llama.block_count",
"n_heads": "llama.attention.head_count",
"n_kv_heads": "llama.attention.head_count_kv",
"vocab_size": "llama.vocab_size",
"hidden_dim": "llama.embedding_length",
"rope_theta": "llama.rope.freq_base",
"layer_norm_rms_epsilon": "llama.attention.layer_norm_rms_epsilon",
}
configured_params = {
name: value
for name, key in key_names.items()
if (value := gguf_utils.read_number(reader, key)) is not None
}
seq_len = 128_000 if config.version == SupportedVersions.llama3_1 else 8_000
if config.max_length > seq_len:
print(
"Warning: `max_length` is more than the supported context size"
f"`max_length` is now set to {seq_len}"
)
config.max_length = seq_len
else:
seq_len = config.max_length
return Hyperparameters(
seq_len=seq_len,
**configured_params,
)
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.
"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.
"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.
"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).
"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:
(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and
(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and
(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and
(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.
You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
APPENDIX: How to apply the Apache License to your work.
To apply the Apache License to your work, attach the following
boilerplate notice, with the fields enclosed by brackets "[]"
replaced with your own identifying information. (Don't include
the brackets!) The text should be enclosed in the appropriate
comment syntax for the file format. We also recommend that a
file or class name and description of purpose be included on the
same "printed page" as the copyright notice for easier
identification within third-party archives.
Copyright [yyyy] [name of copyright owner]
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
---- LLVM Exceptions to the Apache 2.0 License ----
As an exception, if, as a result of your compiling your source code, portions of this Software are embedded into an Object form of such source code, you may redistribute such embedded portions in such Object form without complying with the conditions of Sections 4(a), 4(b) and 4(d) of the License.
In addition, if you combine or link compiled forms of this Software with software that is licensed under the GPLv2 ("Combined Software") and if a court of competent jurisdiction determines that the patent provision (Section 3), the indemnity provision (Section 9) or other Section of the License conflicts with the conditions of the GPLv2, you may retroactively and prospectively choose to deem waived or otherwise exclude such Section(s) of the License, but only in their entirety and only with respect to the Combined Software.
The LLVM Project contains third party software which is under different license terms. All such code will be identified clearly using at least one of two mechanisms:
LICENSE.txt
or
LICENSE
file at the top containing the specific license and restrictions
which apply to that software, or@ Copyright - Modular Inc - 2024