2023-03-25 18:26:40 +00:00
|
|
|
#include "common.h"
|
2023-08-28 15:59:39 +00:00
|
|
|
#include "build-info.h"
|
|
|
|
#include "llama.h"
|
2023-03-24 15:19:05 +00:00
|
|
|
|
2023-08-28 15:59:39 +00:00
|
|
|
#include <algorithm>
|
2023-03-10 23:04:06 +00:00
|
|
|
#include <cassert>
|
2023-08-28 15:59:39 +00:00
|
|
|
#include <cmath>
|
2023-03-10 23:04:06 +00:00
|
|
|
#include <cstring>
|
2023-08-28 15:59:39 +00:00
|
|
|
#include <ctime>
|
2023-03-10 18:40:58 +00:00
|
|
|
#include <fstream>
|
2023-03-22 05:32:36 +00:00
|
|
|
#include <iterator>
|
2023-08-28 15:59:39 +00:00
|
|
|
#include <iostream>
|
|
|
|
#include <regex>
|
llama : new sampling algorithms (#1126)
* Sample interface, new samplers.
New samplers:
- locally typical sampling
- tail free sampling
- frequency and presence penalty
- mirostat
Ignore EOS fix: -inf should be used.
* mirostat
* Added --logit-bias and --no-penalize-nl, removed std::span
* Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
* Save and load example adjust
* Tests
* Windows build fix
* Windows test fix
2023-04-29 05:34:41 +00:00
|
|
|
#include <sstream>
|
2023-08-28 15:59:39 +00:00
|
|
|
#include <string>
|
2023-05-15 02:25:42 +00:00
|
|
|
#include <unordered_set>
|
2023-08-28 15:59:39 +00:00
|
|
|
#include <vector>
|
train : mem usage and other improvements (#2439)
* fix track_max_mem in forward_batch_wo_cache_flash_attn_train
* remove unnecessary Adam(W) optimizer tensors.
reduces optimizer memory overhead from 7*modelsize to 2*modelsize.
additionally allows to optimize models with more than 2^31 parameters by replacing int with int64_t.
bumps training checkpoint file version, but old checkpoints can still be read.
new version with less tensors is saved.
* add gradient clipping to AdamW
* Fix reset of unused g->nodes and g->grads to NULL
* implement gradient checkpointing for training
reduces memory overhead from O(n_layer) to O(sqrt(n_layer))
as explained in readme of https://github.com/cybertronai/gradient-checkpointing
* remove unused compute buffer 3
* add and use function ggml_build_backward_expand to avoid stack overflows with large maximum number of nodes
GGML_API void ggml_build_backward_expand(struct ggml_context * ctx, struct ggml_cgraph * gf, struct ggml_cgraph * gb, bool keep);
* change AdamW decay parameter to work like the torch AdamW decay parameter
It is now relative to Adam learning rate `alpha*sched`.
Before that it was relative to `sched` only.
`alpha` being the maximum learning rate and `sched` being a scaling parameter in [0..1]
* change default AdamW weight decay parameter used in training to 0.1 as used in nanoGPT
* change default AdamW weight decay parameter defined in ggml to 0.0, making Adam default instead of AdamW
btw: the default weight decay parameter for torch.optim.AdamW is 0.01
* bug fixes for cross entropy loss
ggml_cross_entropy_loss: sums where not correctly added in workload of each thread
ggml_cross_entropy_loss_back: simplify backward process, reducing numerical issues
guard usage of exp f16 lookup in cross entropy by #define GGML_CROSS_ENTROPY_EXP_FP16
cross entropy loss is only used once during training, but it is quite sensitive to numerical errors introduced by exp-f16-lookup.
so exp-f16-lookup for cross entropy loss is disabled by default, trading better gradients for very slightly worse runtime performance.
* fix test-grad0 for cross_entropy_loss
the second argument to cross_entropy_loss must sum up to 1 for each row
* fix test-grad0 for soft_max
dont use only sum as aggregation, because sum of softmax is always 1 -> finite differences should not work
instead use sum(log(soft_max()*(1-eps)+eps)); use eps to avoid log(0)
* improve finite differences of test-grad0 by using double instead of float
* change cross_entropy_loss to output average over all rows
this helps keeping the loss and gradients in a sane range
* improve gradient checkpointing
sqrt(n_layers) is only the best checkpoint step when mem size of checkpoints and mem size of layers are equal.
since layers require more memory than the single-tensor-checkpoint we use, the optimal values are compute different:
```
given: n, u, v
objective: minimize(a*u+b*v) where a*b=n, a>0, b>0
b=n/a
minimize(a*u+v*n/a)
diff(a*u+v*n/a, a) = u - (v*n/a)/a
diff(a*u+v*n/a, a) == 0
u - (v*n/a)/a == 0
u == v*n/(a*a)
u*a*a = v*n
a*a = v*n/u
a = sqrt(n*v/u)
```
this change results in more checkpoints, requiring less layers to store between checkpoints, overall improving memory usage.
* disable gradient checkpointing debug output
* llama : fix rope usage in train-text-from-scratch after ChatGLM change
* add more training parameters:
--enable-restart N Only for Adam optimizer. Enable restarts of cos-decay
--disable-restart N Only for Adam optimizer. Disable restarts of cos-decay
--opt-past N Number of optimization iterations to track for delta convergence test. Disabled when zero.
--opt-delta N Maximum delta for delta convergence test. Disabled when <= zero.
--opt-max-no-improvement N Maximum number of optimization iterations with no improvement. Disabled when <= zero.
--adam-epsf N AdamW epsilon for convergence test. Disabled when <= zero.
--adam-min-alpha N Adam minimum learning rate alpha, usually 0.1 * alpha
* replace memcpy with reshape operation so that the graph is not cut at the input
this makes it possible to store other values into the input tensor and then simply recompute the graph without rebuilding it
* remove unused function argument from get_example_targets_batch
* measure and print total training time
* add optimization callback to ggml_opt_resume_g
this callback is called before each iteration with custom data and pointer to learning schedule parameter (only used in Adam(W)).
can be used for dynamic learning schedule and setting input data for batches before each iteration
* use optimization callback in training
allows dynamic learning schedule and different batch data for each iteration without relying on low n_iter and high n_examples parameters
reduces runtime by avoiding restart of optimization function and improves training convergence by providing a different batch for each iteration
* add minimum number of tensor dimensions to apply weight decay (default 2)
this allows to not apply weight decay to bias parameters
* rename training parameter cos-decay-alpha to cos-decay-min and clarify that adam-min-alpha also applies to warmup
* fix increase of model.train_samples and model.train_tokens
now that each optimizer iteration gets its own batch we need to multiply by number of opt iterations
* change sampling parameters for prediction after training to defaults of common.h
and clarify what is context for prediction and what are generated tokens
* tighten abs error bounds for cross_entropy_loss in test-grad0
* add conditional compilation of using F16 exp in flash attention
uncomment `// #define GGML_FLASH_ATTN_EXP_FP16` to enable usage of f16 exp in flash attention
* tighten abs error bounds for flash_attn in test-grad0
* tighten abs error bounds for sqrt in test-grad0
* remove out-commented vectorized code of opt_adam
the vectorized code might be bit faster for low number of parameters, but it had a big memory usage overhead
* ggml : update ggml_rms_norm_back with configurable eps
* llama training : fix ggml_rms_norm_back calls to pass configurable eps
* remove trailing whitespace
* add train function using automatic gradient checkpointing backward pass and allocator
* in train function replace add_inplace by regular add
because using add_inplace seems to result in different gradients
* don't use allocate hash_map on context
because the context has no_alloc=True when using memory allocator resulting in NULL data pointers
* correctly clone reshape and permute operations by also cloning tensor->nb values
* fix variable name and add missing type cast
* terminate recursive tensor cloning when reaching tensor without src tensors
* correctly clone view tensors by setting data pointers
without this the checkpointing would only work when being used together with memory allocator
* fix variable names
* swap arguments to commutative ops to be the same as in `forward_batch_wo_cache_flash_attn`
* add input tensors as checkpoints
so that recursive tensor cloning of gradient checkpointing terminates on input tensors
* fix variable name and add missing boolean negation
* make sure some tensors are not reallocated by inserting new temporary nodes depending on them:
output and parameter gradient tensors need to be available at the end of the graph execution
parameter gradient tensors also need to be available before the graph execution because they are set to zero before each optimizer iteration
checkpoint tensors are allocated all together to reduce memory allocator fragmentation
afterwards, in addition to the temporary nodes, we also need to reset the temporary leafs
* fix ASSERT to work with zero layers
* add training options whether to use allocator and/or unified training function
* integrate unified training function which may use memory allocator
the unified training function also supports arguments whether to use flash attention and/or gradient checkpointing
* format name of cloned tensors with " (clone)" suffix
* set names for tensors in unified train function for easier debugging
* allocate graph on context using ggml_new_graph
* remove handwritten training functions
* remove unused training parameters "use_scratch" and "use_unified"
* remove trailing whitespace
* remove unused train params: mem_compute1_gb & mem_compute2_gb
mem_compute_gb is used for compute when automatic memory allocator is not enabled, otherwise it can be very small to only hold the tensor definitions
mem_compute0_gb is used for automatic memory allocator (as long as measurement of max required size is not implemented)
* remove unused forward_batch function
* add debug asserts in ggml_allocr_alloc to some common pitfalls when using this function directly
* only use ggml_allocr_alloc when tensor has NULL data and is no view
* fix test when to create temporary backward graph
temporary backward graph is only necessary when using checkpointing
* fix memory "leak" in optimizers
each iteration a new cplan with new memory for work data was allocated.
now cplan creation only happens at the start of optimization, with each iteration reusing the cplan and its work data.
* reverse order of for loop in ggml_build_backward_expand to save memory when using gradient checkpointing and allocator
with this loop order gradient checkpointing with allocator on 16 layer model saves 13% memory; 2 layer memory it saves 2% memory.
the computation results are the same
* add missing lctx argument to get_example_targets_batch
* implement llama model file saving using gguf
checkpoint loading and saving disabled, to be replaced by loading and saving via gguf
* implement loading/saving of checkpointing files using GGUF
* bug fixes
* add checkpoint file version for future compatibility
* update readme with gguf filenames
* save & load opt->just_initialized value
* add first draft for checkpoint conversion script
* add gguf arch and ftype
* save opt parameter counter as uint64
* add gguf key and tensor names for optimizer and training
* add layer_norm_rms_eps to checkpoint convert script
* use same GGUF_GET_KEY macro as in llama.cpp
* use norm_rms_eps, and rope parameters and command line options to set them
* fix memory corruption bug in gguf
ctx->kv and ctx->infos was reallocated using not-aligned realloc, but freed with aligned free.
to fix this a GGML_ALIGNED_REALLOC was added, but there is no posix_memalign_realloc function.
so on non-windows and non-mingw32 platforms we fall back to aligned malloc, followed by copying
and freeing the old data.
* add gguf example cmake file
* bug fixes in tokenize_file
* bug fixes in load_llama_model_gguf
* bug fix: init model when no checkpoint was loaded
* bug fix in read_tensor_by_name
* bug fix in load_opt_context_gguf
* avoid printing lots of spaced on the unusual case that loss gets nan
* set name of tensors with empty name from what was read from gguf
* remove trailing whitespace
* print data checksums before saving and after loading to verify correctness
* bug fixes for convert-train-checkpoint-to-gguf
* temporarily add code to write old checkpoint files
used to verify that old checkpoint files are correctly converted to gguf
* bug fixes for convert-train-checkpoint-to-gguf.py loading checkpoints with opt_version=0
* remove code used to verify correctness of checkpoint file conversion
* remove trailing whitespace
* remove prediction related code
use main for prediction, it is better optimized
* update train-text-from-scratch README.md
* fix non-windows GGML_ALIGNED_REALLOC
* add missing blank line at end of file
* remove GGML_ALIGNED_REALLOC and use normal malloc/realloc/free for gguf ctx->kv & ctx->infos
* train : fix compile warnings
---------
Co-authored-by: Georgi Gerganov <ggerganov@gmail.com>
2023-08-28 19:51:47 +00:00
|
|
|
#include <cinttypes>
|
2023-04-30 18:41:35 +00:00
|
|
|
|
|
|
|
#if defined(__APPLE__) && defined(__MACH__)
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/sysctl.h>
|
|
|
|
#endif
|
2023-03-10 18:40:58 +00:00
|
|
|
|
2023-05-09 02:45:48 +00:00
|
|
|
#if defined(_WIN32)
|
|
|
|
#define WIN32_LEAN_AND_MEAN
|
2023-09-01 13:34:50 +00:00
|
|
|
#ifndef NOMINMAX
|
|
|
|
# define NOMINMAX
|
|
|
|
#endif
|
2023-08-28 15:59:39 +00:00
|
|
|
#include <codecvt>
|
|
|
|
#include <locale>
|
2023-05-09 02:45:48 +00:00
|
|
|
#include <windows.h>
|
2023-04-08 15:49:39 +00:00
|
|
|
#include <fcntl.h>
|
|
|
|
#include <io.h>
|
2023-05-09 02:45:48 +00:00
|
|
|
#else
|
|
|
|
#include <sys/ioctl.h>
|
2023-08-28 15:59:39 +00:00
|
|
|
#include <sys/stat.h>
|
2023-05-09 02:45:48 +00:00
|
|
|
#include <unistd.h>
|
2023-03-28 14:09:55 +00:00
|
|
|
#endif
|
2023-03-12 20:15:00 +00:00
|
|
|
|
2023-06-16 18:23:53 +00:00
|
|
|
#if defined(_MSC_VER)
|
|
|
|
#pragma warning(disable: 4244 4267) // possible loss of data
|
|
|
|
#endif
|
|
|
|
|
2023-04-30 18:41:35 +00:00
|
|
|
int32_t get_num_physical_cores() {
|
2023-03-17 17:47:35 +00:00
|
|
|
#ifdef __linux__
|
2023-05-15 02:25:42 +00:00
|
|
|
// enumerate the set of thread siblings, num entries is num cores
|
|
|
|
std::unordered_set<std::string> siblings;
|
|
|
|
for (uint32_t cpu=0; cpu < UINT32_MAX; ++cpu) {
|
|
|
|
std::ifstream thread_siblings("/sys/devices/system/cpu"
|
|
|
|
+ std::to_string(cpu) + "/topology/thread_siblings");
|
|
|
|
if (!thread_siblings.is_open()) {
|
|
|
|
break; // no more cpus
|
2023-04-30 18:41:35 +00:00
|
|
|
}
|
2023-05-15 02:25:42 +00:00
|
|
|
std::string line;
|
|
|
|
if (std::getline(thread_siblings, line)) {
|
|
|
|
siblings.insert(line);
|
|
|
|
}
|
|
|
|
}
|
2023-09-07 17:22:29 +00:00
|
|
|
if (!siblings.empty()) {
|
2023-05-15 02:25:42 +00:00
|
|
|
return static_cast<int32_t>(siblings.size());
|
2023-04-30 18:41:35 +00:00
|
|
|
}
|
|
|
|
#elif defined(__APPLE__) && defined(__MACH__)
|
|
|
|
int32_t num_physical_cores;
|
|
|
|
size_t len = sizeof(num_physical_cores);
|
|
|
|
int result = sysctlbyname("hw.perflevel0.physicalcpu", &num_physical_cores, &len, NULL, 0);
|
|
|
|
if (result == 0) {
|
|
|
|
return num_physical_cores;
|
|
|
|
}
|
|
|
|
result = sysctlbyname("hw.physicalcpu", &num_physical_cores, &len, NULL, 0);
|
|
|
|
if (result == 0) {
|
|
|
|
return num_physical_cores;
|
2023-03-17 17:47:35 +00:00
|
|
|
}
|
2023-04-30 18:41:35 +00:00
|
|
|
#elif defined(_WIN32)
|
|
|
|
//TODO: Implement
|
|
|
|
#endif
|
|
|
|
unsigned int n_threads = std::thread::hardware_concurrency();
|
|
|
|
return n_threads > 0 ? (n_threads <= 4 ? n_threads : n_threads / 2) : 4;
|
|
|
|
}
|
2023-03-17 17:47:35 +00:00
|
|
|
|
2023-09-15 19:38:27 +00:00
|
|
|
static void process_escapes(std::string& input) {
|
2023-05-04 12:08:25 +00:00
|
|
|
std::size_t input_len = input.length();
|
|
|
|
std::size_t output_idx = 0;
|
2023-05-03 01:46:20 +00:00
|
|
|
|
2023-05-04 12:08:25 +00:00
|
|
|
for (std::size_t input_idx = 0; input_idx < input_len; ++input_idx) {
|
|
|
|
if (input[input_idx] == '\\' && input_idx + 1 < input_len) {
|
|
|
|
switch (input[++input_idx]) {
|
|
|
|
case 'n': input[output_idx++] = '\n'; break;
|
|
|
|
case 'r': input[output_idx++] = '\r'; break;
|
|
|
|
case 't': input[output_idx++] = '\t'; break;
|
|
|
|
case '\'': input[output_idx++] = '\''; break;
|
|
|
|
case '\"': input[output_idx++] = '\"'; break;
|
|
|
|
case '\\': input[output_idx++] = '\\'; break;
|
|
|
|
default: input[output_idx++] = '\\';
|
|
|
|
input[output_idx++] = input[input_idx]; break;
|
2023-05-03 01:46:20 +00:00
|
|
|
}
|
2023-05-04 12:08:25 +00:00
|
|
|
} else {
|
|
|
|
input[output_idx++] = input[input_idx];
|
2023-05-03 01:46:20 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-05-04 12:08:25 +00:00
|
|
|
input.resize(output_idx);
|
2023-05-03 01:46:20 +00:00
|
|
|
}
|
|
|
|
|
2023-04-30 18:41:35 +00:00
|
|
|
bool gpt_params_parse(int argc, char ** argv, gpt_params & params) {
|
2023-03-23 17:54:28 +00:00
|
|
|
bool invalid_param = false;
|
|
|
|
std::string arg;
|
2023-04-02 02:41:12 +00:00
|
|
|
gpt_params default_params;
|
2023-05-12 14:34:55 +00:00
|
|
|
const std::string arg_prefix = "--";
|
2023-04-02 02:41:12 +00:00
|
|
|
|
2023-03-10 18:40:58 +00:00
|
|
|
for (int i = 1; i < argc; i++) {
|
2023-03-23 17:54:28 +00:00
|
|
|
arg = argv[i];
|
2023-05-12 14:34:55 +00:00
|
|
|
if (arg.compare(0, arg_prefix.size(), arg_prefix) == 0) {
|
|
|
|
std::replace(arg.begin(), arg.end(), '_', '-');
|
|
|
|
}
|
2023-03-10 18:40:58 +00:00
|
|
|
|
|
|
|
if (arg == "-s" || arg == "--seed") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-06-29 13:15:15 +00:00
|
|
|
params.seed = std::stoul(argv[i]);
|
2023-03-10 18:40:58 +00:00
|
|
|
} else if (arg == "-t" || arg == "--threads") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.n_threads = std::stoi(argv[i]);
|
2023-07-23 13:33:02 +00:00
|
|
|
if (params.n_threads <= 0) {
|
|
|
|
params.n_threads = std::thread::hardware_concurrency();
|
|
|
|
}
|
2023-03-10 18:40:58 +00:00
|
|
|
} else if (arg == "-p" || arg == "--prompt") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-05-04 12:08:25 +00:00
|
|
|
params.prompt = argv[i];
|
2023-08-28 15:59:39 +00:00
|
|
|
} else if (arg == "-e" || arg == "--escape") {
|
|
|
|
params.escape = true;
|
2023-05-10 15:37:14 +00:00
|
|
|
} else if (arg == "--prompt-cache") {
|
2023-04-28 15:59:37 +00:00
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-05-10 15:37:14 +00:00
|
|
|
params.path_prompt_cache = argv[i];
|
|
|
|
} else if (arg == "--prompt-cache-all") {
|
|
|
|
params.prompt_cache_all = true;
|
2023-06-07 02:10:17 +00:00
|
|
|
} else if (arg == "--prompt-cache-ro") {
|
|
|
|
params.prompt_cache_ro = true;
|
2023-03-12 20:28:36 +00:00
|
|
|
} else if (arg == "-f" || arg == "--file") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
std::ifstream file(argv[i]);
|
2023-03-31 18:03:48 +00:00
|
|
|
if (!file) {
|
2023-04-14 19:58:43 +00:00
|
|
|
fprintf(stderr, "error: failed to open file '%s'\n", argv[i]);
|
2023-03-31 18:03:48 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-03-19 16:37:02 +00:00
|
|
|
std::copy(std::istreambuf_iterator<char>(file), std::istreambuf_iterator<char>(), back_inserter(params.prompt));
|
2023-03-19 17:04:44 +00:00
|
|
|
if (params.prompt.back() == '\n') {
|
|
|
|
params.prompt.pop_back();
|
|
|
|
}
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "-n" || arg == "--n-predict") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.n_predict = std::stoi(argv[i]);
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "--top-k") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.top_k = std::stoi(argv[i]);
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "-c" || arg == "--ctx-size") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.n_ctx = std::stoi(argv[i]);
|
llama : add custom RoPE (#2054)
* Implement customizable RoPE
The original RoPE has pre-defined parameters
theta_i = 10000^(−2(i−1)/d), for i in [1, 2, ..., d/2]
Our customizable RoPE, ggml_rope_custom_inplace, uses
theta_i = scale * base^(−2(i−1)/d), for i in [1, 2, ..., d/2]
with the default matches the original
scale = 1.0
base = 10000
The new command line arguments
--rope-freq-base
--rope-freq-scale
set the two new RoPE parameter.
Recent researches show changing these two parameters extends the context limit with minimal loss.
1. Extending Context to 8K
kaiokendev
https://kaiokendev.github.io/til#extending-context-to-8k
2. Extending Context Window of Large Language Models via Positional Interpolation
Shouyuan Chen, Sherman Wong, Liangjian Chen, Yuandong Tian
https://arxiv.org/abs/2306.15595
3. NTK-Aware Scaled RoPE allows LLaMA models to have extended (8k+) context size without any fine-tuning and minimal perplexity degradation.
https://www.reddit.com/user/bloc97
https://www.reddit.com/r/LocalLLaMA/comments/14lz7j5/ntkaware_scaled_rope_allows_llama_models_to_have/
For the bold, try adding the following command line parameters to your favorite model:
-c 16384 --rope-freq-base 80000 --rope-freq-scale 0.5
* ggml-metal: fix custom rope
* common: fix argument names in help
* llama: increase MEM_REQ_EVAL for MODEL_3B
It avoids crashing for quantized weights on CPU.
Better ways to calculate the required buffer size would be better.
* llama: make MEM_REQ_EVAL depend on n_ctx
* server: use proper Content-Type in curl examples
Without the header Content-Type: application/json, curl will POST with
Content-Type: application/x-www-form-urlencoded
Though our simple server doesn't care, the httplib.h used has a limit
with CPPHTTPLIB_FORM_URL_ENCODED_PAYLOAD_MAX_LENGTH 8192
With Content-Type: application/json, we can send large json data.
* style : minor fixes, mostly indentations
* ggml : fix asserts
---------
Co-authored-by: Georgi Gerganov <ggerganov@gmail.com>
2023-07-15 10:34:16 +00:00
|
|
|
} else if (arg == "--rope-freq-base") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.rope_freq_base = std::stof(argv[i]);
|
|
|
|
} else if (arg == "--rope-freq-scale") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.rope_freq_scale = std::stof(argv[i]);
|
2023-08-07 17:07:19 +00:00
|
|
|
} else if (arg == "--rope-scale") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.rope_freq_scale = 1.0f/std::stof(argv[i]);
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "--memory-f32") {
|
2023-03-24 21:17:37 +00:00
|
|
|
params.memory_f16 = false;
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "--top-p") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.top_p = std::stof(argv[i]);
|
2023-03-10 18:40:58 +00:00
|
|
|
} else if (arg == "--temp") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.temp = std::stof(argv[i]);
|
llama : new sampling algorithms (#1126)
* Sample interface, new samplers.
New samplers:
- locally typical sampling
- tail free sampling
- frequency and presence penalty
- mirostat
Ignore EOS fix: -inf should be used.
* mirostat
* Added --logit-bias and --no-penalize-nl, removed std::span
* Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
* Save and load example adjust
* Tests
* Windows build fix
* Windows test fix
2023-04-29 05:34:41 +00:00
|
|
|
} else if (arg == "--tfs") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.tfs_z = std::stof(argv[i]);
|
|
|
|
} else if (arg == "--typical") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.typical_p = std::stof(argv[i]);
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "--repeat-last-n") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.repeat_last_n = std::stoi(argv[i]);
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "--repeat-penalty") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.repeat_penalty = std::stof(argv[i]);
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "--frequency-penalty") {
|
llama : new sampling algorithms (#1126)
* Sample interface, new samplers.
New samplers:
- locally typical sampling
- tail free sampling
- frequency and presence penalty
- mirostat
Ignore EOS fix: -inf should be used.
* mirostat
* Added --logit-bias and --no-penalize-nl, removed std::span
* Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
* Save and load example adjust
* Tests
* Windows build fix
* Windows test fix
2023-04-29 05:34:41 +00:00
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.frequency_penalty = std::stof(argv[i]);
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "--presence-penalty") {
|
llama : new sampling algorithms (#1126)
* Sample interface, new samplers.
New samplers:
- locally typical sampling
- tail free sampling
- frequency and presence penalty
- mirostat
Ignore EOS fix: -inf should be used.
* mirostat
* Added --logit-bias and --no-penalize-nl, removed std::span
* Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
* Save and load example adjust
* Tests
* Windows build fix
* Windows test fix
2023-04-29 05:34:41 +00:00
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.presence_penalty = std::stof(argv[i]);
|
|
|
|
} else if (arg == "--mirostat") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.mirostat = std::stoi(argv[i]);
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "--mirostat-lr") {
|
llama : new sampling algorithms (#1126)
* Sample interface, new samplers.
New samplers:
- locally typical sampling
- tail free sampling
- frequency and presence penalty
- mirostat
Ignore EOS fix: -inf should be used.
* mirostat
* Added --logit-bias and --no-penalize-nl, removed std::span
* Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
* Save and load example adjust
* Tests
* Windows build fix
* Windows test fix
2023-04-29 05:34:41 +00:00
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.mirostat_eta = std::stof(argv[i]);
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "--mirostat-ent") {
|
llama : new sampling algorithms (#1126)
* Sample interface, new samplers.
New samplers:
- locally typical sampling
- tail free sampling
- frequency and presence penalty
- mirostat
Ignore EOS fix: -inf should be used.
* mirostat
* Added --logit-bias and --no-penalize-nl, removed std::span
* Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
* Save and load example adjust
* Tests
* Windows build fix
* Windows test fix
2023-04-29 05:34:41 +00:00
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.mirostat_tau = std::stof(argv[i]);
|
2023-07-11 16:18:43 +00:00
|
|
|
} else if (arg == "--cfg-negative-prompt") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.cfg_negative_prompt = argv[i];
|
2023-08-17 13:29:44 +00:00
|
|
|
} else if (arg == "--cfg-negative-prompt-file") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
std::ifstream file(argv[i]);
|
|
|
|
if (!file) {
|
|
|
|
fprintf(stderr, "error: failed to open file '%s'\n", argv[i]);
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
std::copy(std::istreambuf_iterator<char>(file), std::istreambuf_iterator<char>(), back_inserter(params.cfg_negative_prompt));
|
|
|
|
if (params.cfg_negative_prompt.back() == '\n') {
|
|
|
|
params.cfg_negative_prompt.pop_back();
|
|
|
|
}
|
2023-07-11 16:18:43 +00:00
|
|
|
} else if (arg == "--cfg-scale") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.cfg_scale = std::stof(argv[i]);
|
2023-05-12 14:34:55 +00:00
|
|
|
} else if (arg == "-b" || arg == "--batch-size") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.n_batch = std::stoi(argv[i]);
|
2023-03-25 19:36:22 +00:00
|
|
|
} else if (arg == "--keep") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-25 19:36:22 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.n_keep = std::stoi(argv[i]);
|
2023-09-03 12:12:08 +00:00
|
|
|
} else if (arg == "--draft") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.n_draft = std::stoi(argv[i]);
|
2023-07-18 11:24:43 +00:00
|
|
|
} else if (arg == "--chunks") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.n_chunks = std::stoi(argv[i]);
|
2023-03-10 18:40:58 +00:00
|
|
|
} else if (arg == "-m" || arg == "--model") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-03-23 17:54:28 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.model = argv[i];
|
2023-09-03 12:12:08 +00:00
|
|
|
} else if (arg == "-md" || arg == "--model-draft") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.model_draft = argv[i];
|
2023-05-28 17:14:24 +00:00
|
|
|
} else if (arg == "-a" || arg == "--alias") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.model_alias = argv[i];
|
2023-04-17 15:28:55 +00:00
|
|
|
} else if (arg == "--lora") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.lora_adapter = argv[i];
|
2023-07-13 13:58:25 +00:00
|
|
|
params.use_mmap = false;
|
2023-04-17 15:28:55 +00:00
|
|
|
} else if (arg == "--lora-base") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.lora_base = argv[i];
|
2023-03-12 21:13:28 +00:00
|
|
|
} else if (arg == "-i" || arg == "--interactive") {
|
|
|
|
params.interactive = true;
|
2023-03-24 15:05:13 +00:00
|
|
|
} else if (arg == "--embedding") {
|
|
|
|
params.embedding = true;
|
2023-03-22 17:16:35 +00:00
|
|
|
} else if (arg == "--interactive-first") {
|
2023-04-24 15:45:32 +00:00
|
|
|
params.interactive_first = true;
|
2023-03-19 16:37:02 +00:00
|
|
|
} else if (arg == "-ins" || arg == "--instruct") {
|
2023-04-14 19:58:43 +00:00
|
|
|
params.instruct = true;
|
2023-05-09 02:45:48 +00:00
|
|
|
} else if (arg == "--multiline-input") {
|
|
|
|
params.multiline_input = true;
|
2023-08-04 15:20:12 +00:00
|
|
|
} else if (arg == "--simple-io") {
|
|
|
|
params.simple_io = true;
|
2023-03-12 21:13:28 +00:00
|
|
|
} else if (arg == "--color") {
|
|
|
|
params.use_color = true;
|
2023-03-24 15:19:05 +00:00
|
|
|
} else if (arg == "--mlock") {
|
|
|
|
params.use_mlock = true;
|
2023-05-13 13:38:36 +00:00
|
|
|
} else if (arg == "--gpu-layers" || arg == "-ngl" || arg == "--n-gpu-layers") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-05-28 17:48:57 +00:00
|
|
|
#ifdef LLAMA_SUPPORTS_GPU_OFFLOAD
|
2023-05-13 13:38:36 +00:00
|
|
|
params.n_gpu_layers = std::stoi(argv[i]);
|
2023-05-28 17:48:57 +00:00
|
|
|
#else
|
|
|
|
fprintf(stderr, "warning: not compiled with GPU offload support, --n-gpu-layers option will be ignored\n");
|
|
|
|
fprintf(stderr, "warning: see main README.md for information on enabling GPU BLAS support\n");
|
2023-09-13 06:50:46 +00:00
|
|
|
#endif
|
|
|
|
} else if (arg == "--gpu-layers-draft" || arg == "-ngld" || arg == "--n-gpu-layers-draft") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#ifdef LLAMA_SUPPORTS_GPU_OFFLOAD
|
|
|
|
params.n_gpu_layers_draft = std::stoi(argv[i]);
|
|
|
|
#else
|
|
|
|
fprintf(stderr, "warning: not compiled with GPU offload support, --n-gpu-layers-draft option will be ignored\n");
|
|
|
|
fprintf(stderr, "warning: see main README.md for information on enabling GPU BLAS support\n");
|
2023-05-28 17:48:57 +00:00
|
|
|
#endif
|
2023-06-06 19:33:23 +00:00
|
|
|
} else if (arg == "--main-gpu" || arg == "-mg") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#ifdef GGML_USE_CUBLAS
|
|
|
|
params.main_gpu = std::stoi(argv[i]);
|
|
|
|
#else
|
2023-07-31 13:44:35 +00:00
|
|
|
fprintf(stderr, "warning: llama.cpp was compiled without cuBLAS. It is not possible to set a main GPU.\n");
|
2023-06-06 19:33:23 +00:00
|
|
|
#endif
|
|
|
|
} else if (arg == "--tensor-split" || arg == "-ts") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#ifdef GGML_USE_CUBLAS
|
|
|
|
std::string arg_next = argv[i];
|
|
|
|
|
|
|
|
// split string by , and /
|
|
|
|
const std::regex regex{R"([,/]+)"};
|
|
|
|
std::sregex_token_iterator it{arg_next.begin(), arg_next.end(), regex, -1};
|
|
|
|
std::vector<std::string> split_arg{it, {}};
|
|
|
|
GGML_ASSERT(split_arg.size() <= LLAMA_MAX_DEVICES);
|
|
|
|
|
|
|
|
for (size_t i = 0; i < LLAMA_MAX_DEVICES; ++i) {
|
|
|
|
if (i < split_arg.size()) {
|
|
|
|
params.tensor_split[i] = std::stof(split_arg[i]);
|
|
|
|
} else {
|
|
|
|
params.tensor_split[i] = 0.0f;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#else
|
2023-07-31 13:44:35 +00:00
|
|
|
fprintf(stderr, "warning: llama.cpp was compiled without cuBLAS. It is not possible to set a tensor split.\n");
|
|
|
|
#endif // GGML_USE_CUBLAS
|
2023-08-22 20:47:05 +00:00
|
|
|
} else if (arg == "--no-mul-mat-q" || arg == "-nommq") {
|
2023-07-31 13:44:35 +00:00
|
|
|
#ifdef GGML_USE_CUBLAS
|
2023-08-22 20:47:05 +00:00
|
|
|
params.mul_mat_q = false;
|
2023-07-31 13:44:35 +00:00
|
|
|
#else
|
2023-08-22 20:47:05 +00:00
|
|
|
fprintf(stderr, "warning: llama.cpp was compiled without cuBLAS. Disabling mul_mat_q kernels has no effect.\n");
|
2023-06-14 17:47:19 +00:00
|
|
|
#endif // GGML_USE_CUBLAS
|
|
|
|
} else if (arg == "--low-vram" || arg == "-lv") {
|
|
|
|
#ifdef GGML_USE_CUBLAS
|
|
|
|
params.low_vram = true;
|
|
|
|
#else
|
2023-07-31 13:44:35 +00:00
|
|
|
fprintf(stderr, "warning: llama.cpp was compiled without cuBLAS. It is not possible to set lower vram usage.\n");
|
2023-06-06 19:33:23 +00:00
|
|
|
#endif // GGML_USE_CUBLAS
|
Rewrite loading code to try to satisfy everyone:
- Support all three formats (ggml, ggmf, ggjt). (However, I didn't
include the hack needed to support GPT4All files without conversion.
Those can still be used after converting them with convert.py from my
other PR.)
- Support both mmap and read (mmap is used by default, but can be
disabled with `--no-mmap`, and is automatically disabled for pre-ggjt
files or on platforms where mmap is not supported).
- Support multi-file models like before, but automatically determine the
number of parts rather than requiring `--n_parts`.
- Improve validation and error checking.
- Stop using the per-file type field (f16) entirely in favor of just
relying on the per-tensor type/size fields. This has no immediate
benefit, but makes it easier to experiment with different formats, and
should make it easier to support the new GPTQ-for-LLaMa models in the
future (I have some work in progress on that front).
- Support VirtualLock on Windows (using the same `--mlock` option as on
Unix).
- Indicate loading progress when using mmap + mlock. (Which led me
to the interesting observation that on my Linux machine, with a
warm file cache, mlock actually takes some time, whereas mmap
without mlock starts almost instantly...)
- To help implement this, move mlock support from ggml to the
loading code.
- madvise/PrefetchVirtualMemory support (based on #740)
- Switch from ifstream to the `fopen` family of functions to avoid
unnecessary copying and, when mmap is enabled, allow reusing the same
file descriptor for both metadata reads and mmap (whereas the existing
implementation opens the file a second time to mmap).
- Quantization now produces a single-file output even with multi-file
inputs (not really a feature as much as 'it was easier this way').
Implementation notes:
I tried to factor the code into more discrete pieces than before.
Regarding code style: I tried to follow the code style, but I'm naughty
and used a few advanced C++ features repeatedly:
- Destructors to make it easier to ensure everything gets cleaned up.
- Exceptions. I don't even usually use exceptions when writing C++, and
I can remove them if desired... but here they make the loading code
much more succinct while still properly handling a variety of errors,
ranging from API calls failing to integer overflow and allocation
failure. The exceptions are converted to error codes at the
API boundary.)
Co-authored-by: Pavol Rusnak <pavol@rusnak.io> (for the bit I copied from #740)
2023-04-08 19:24:37 +00:00
|
|
|
} else if (arg == "--no-mmap") {
|
|
|
|
params.use_mmap = false;
|
2023-06-26 17:57:59 +00:00
|
|
|
} else if (arg == "--numa") {
|
|
|
|
params.numa = true;
|
2023-06-04 20:34:30 +00:00
|
|
|
} else if (arg == "--export") {
|
|
|
|
params.export_cgraph = true;
|
2023-03-25 19:36:22 +00:00
|
|
|
} else if (arg == "--verbose-prompt") {
|
2023-03-25 15:16:50 +00:00
|
|
|
params.verbose_prompt = true;
|
2023-03-12 21:13:28 +00:00
|
|
|
} else if (arg == "-r" || arg == "--reverse-prompt") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-04-14 15:19:17 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.antiprompt.push_back(argv[i]);
|
2023-08-28 15:59:39 +00:00
|
|
|
} else if (arg == "-ld" || arg == "--logdir") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.logdir = argv[i];
|
|
|
|
|
|
|
|
if (params.logdir.back() != DIRECTORY_SEPARATOR) {
|
|
|
|
params.logdir += DIRECTORY_SEPARATOR;
|
|
|
|
}
|
2023-03-21 16:27:42 +00:00
|
|
|
} else if (arg == "--perplexity") {
|
|
|
|
params.perplexity = true;
|
2023-08-23 09:56:42 +00:00
|
|
|
} else if (arg == "--ppl-stride") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.ppl_stride = std::stoi(argv[i]);
|
|
|
|
} else if (arg == "--ppl-output-type") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.ppl_output_type = std::stoi(argv[i]);
|
2023-07-28 18:25:36 +00:00
|
|
|
} else if (arg == "--hellaswag") {
|
|
|
|
params.hellaswag = true;
|
|
|
|
} else if (arg == "--hellaswag-tasks") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.hellaswag_tasks = std::stoi(argv[i]);
|
2023-03-19 18:22:48 +00:00
|
|
|
} else if (arg == "--ignore-eos") {
|
2023-08-21 20:07:43 +00:00
|
|
|
params.ignore_eos = true;
|
llama : new sampling algorithms (#1126)
* Sample interface, new samplers.
New samplers:
- locally typical sampling
- tail free sampling
- frequency and presence penalty
- mirostat
Ignore EOS fix: -inf should be used.
* mirostat
* Added --logit-bias and --no-penalize-nl, removed std::span
* Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
* Save and load example adjust
* Tests
* Windows build fix
* Windows test fix
2023-04-29 05:34:41 +00:00
|
|
|
} else if (arg == "--no-penalize-nl") {
|
|
|
|
params.penalize_nl = false;
|
|
|
|
} else if (arg == "-l" || arg == "--logit-bias") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
std::stringstream ss(argv[i]);
|
|
|
|
llama_token key;
|
|
|
|
char sign;
|
|
|
|
std::string value_str;
|
|
|
|
try {
|
|
|
|
if (ss >> key && ss >> sign && std::getline(ss, value_str) && (sign == '+' || sign == '-')) {
|
|
|
|
params.logit_bias[key] = std::stof(value_str) * ((sign == '-') ? -1.0f : 1.0f);
|
|
|
|
} else {
|
|
|
|
throw std::exception();
|
|
|
|
}
|
2023-06-16 18:23:53 +00:00
|
|
|
} catch (const std::exception&) {
|
llama : new sampling algorithms (#1126)
* Sample interface, new samplers.
New samplers:
- locally typical sampling
- tail free sampling
- frequency and presence penalty
- mirostat
Ignore EOS fix: -inf should be used.
* mirostat
* Added --logit-bias and --no-penalize-nl, removed std::span
* Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
Use C++11, clarify llama API documentation, rename Mirostat parameters to --mirostat_lr and --mirostat_ent, add temperature sampling for Mirostat, simplify Mirostat sampling API parameters (removed N and *k)
* Save and load example adjust
* Tests
* Windows build fix
* Windows test fix
2023-04-29 05:34:41 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-03-10 18:40:58 +00:00
|
|
|
} else if (arg == "-h" || arg == "--help") {
|
2023-04-14 19:58:43 +00:00
|
|
|
gpt_print_usage(argc, argv, default_params);
|
main : log file (#2748)
* initial, base LOG macro
* add *.log to .gitignore
* added basic log file handler
* reverted log auto endline to better mimic printf
* remove atomics and add dynamic log target
* log_enable/disable, LOG_TEE, basic usage doc
* update .gitignore
* mv include to common, params, help msg
* log tostring helpers, token vectors pretty prints
* main: replaced fprintf/LOG_TEE, some trace logging
* LOG_DISABLE_LOGS compile flag, wrapped f in macros
* fix LOG_TEELN and configchecker
* stub LOG_DUMP_CMDLINE for WIN32 for now
* fix msvc
* cleanup main.cpp:273
* fix stray whitespace after master sync
* log : fix compile warnings
- do not use C++20 stuff
- use PRIu64 to print uint64_t
- avoid string copies by using const ref
- fix ", ##__VA_ARGS__" warnings
- compare strings with == and !=
* log : do not append to existing log + disable file line func by default
* log : try to fix Windows build
* main : wip logs
* main : add trace log
* review: macro f lowercase, str append to sstream
* review: simplify ifs and str comparisons
* fix MSVC, formatting, FMT/VAL placeholders
* review: if/else cleanup
* review: if/else cleanup (2)
* replace _ prefix with _impl suffix
---------
Co-authored-by: Georgi Gerganov <ggerganov@gmail.com>
2023-08-30 06:29:32 +00:00
|
|
|
#ifndef LOG_DISABLE_LOGS
|
|
|
|
log_print_usage();
|
|
|
|
#endif // LOG_DISABLE_LOGS
|
2023-03-10 18:40:58 +00:00
|
|
|
exit(0);
|
2023-03-19 18:36:19 +00:00
|
|
|
} else if (arg == "--random-prompt") {
|
|
|
|
params.random_prompt = true;
|
2023-07-25 12:19:11 +00:00
|
|
|
} else if (arg == "--in-prefix-bos") {
|
|
|
|
params.input_prefix_bos = true;
|
2023-03-25 12:03:19 +00:00
|
|
|
} else if (arg == "--in-prefix") {
|
2023-04-14 19:58:43 +00:00
|
|
|
if (++i >= argc) {
|
2023-04-14 15:19:17 +00:00
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
2023-04-14 19:58:43 +00:00
|
|
|
params.input_prefix = argv[i];
|
2023-05-04 15:41:12 +00:00
|
|
|
} else if (arg == "--in-suffix") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.input_suffix = argv[i];
|
2023-07-24 03:58:10 +00:00
|
|
|
} else if (arg == "--grammar") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
params.grammar = argv[i];
|
|
|
|
} else if (arg == "--grammar-file") {
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
std::ifstream file(argv[i]);
|
|
|
|
if (!file) {
|
|
|
|
fprintf(stderr, "error: failed to open file '%s'\n", argv[i]);
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
std::copy(
|
|
|
|
std::istreambuf_iterator<char>(file),
|
|
|
|
std::istreambuf_iterator<char>(),
|
|
|
|
std::back_inserter(params.grammar)
|
|
|
|
);
|
main : log file (#2748)
* initial, base LOG macro
* add *.log to .gitignore
* added basic log file handler
* reverted log auto endline to better mimic printf
* remove atomics and add dynamic log target
* log_enable/disable, LOG_TEE, basic usage doc
* update .gitignore
* mv include to common, params, help msg
* log tostring helpers, token vectors pretty prints
* main: replaced fprintf/LOG_TEE, some trace logging
* LOG_DISABLE_LOGS compile flag, wrapped f in macros
* fix LOG_TEELN and configchecker
* stub LOG_DUMP_CMDLINE for WIN32 for now
* fix msvc
* cleanup main.cpp:273
* fix stray whitespace after master sync
* log : fix compile warnings
- do not use C++20 stuff
- use PRIu64 to print uint64_t
- avoid string copies by using const ref
- fix ", ##__VA_ARGS__" warnings
- compare strings with == and !=
* log : do not append to existing log + disable file line func by default
* log : try to fix Windows build
* main : wip logs
* main : add trace log
* review: macro f lowercase, str append to sstream
* review: simplify ifs and str comparisons
* fix MSVC, formatting, FMT/VAL placeholders
* review: if/else cleanup
* review: if/else cleanup (2)
* replace _ prefix with _impl suffix
---------
Co-authored-by: Georgi Gerganov <ggerganov@gmail.com>
2023-08-30 06:29:32 +00:00
|
|
|
#ifndef LOG_DISABLE_LOGS
|
|
|
|
// Parse args for logging parameters
|
|
|
|
} else if ( log_param_single_parse( argv[i] ) ) {
|
|
|
|
// Do nothing, log_param_single_parse automatically does it's thing
|
|
|
|
// and returns if a match was found and parsed.
|
|
|
|
} else if ( log_param_pair_parse( /*check_but_dont_parse*/ true, argv[i] ) ) {
|
|
|
|
// We have a matching known parameter requiring an argument,
|
|
|
|
// now we need to check if there is anything after this argv
|
|
|
|
// and flag invalid_param or parse it.
|
|
|
|
if (++i >= argc) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if( !log_param_pair_parse( /*check_but_dont_parse*/ false, argv[i-1], argv[i]) ) {
|
|
|
|
invalid_param = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// End of Parse args for logging parameters
|
|
|
|
#endif // LOG_DISABLE_LOGS
|
2023-03-10 18:40:58 +00:00
|
|
|
} else {
|
|
|
|
fprintf(stderr, "error: unknown argument: %s\n", arg.c_str());
|
2023-04-14 19:58:43 +00:00
|
|
|
gpt_print_usage(argc, argv, default_params);
|
2023-03-23 17:54:28 +00:00
|
|
|
exit(1);
|
2023-03-10 18:40:58 +00:00
|
|
|
}
|
|
|
|
}
|
2023-03-23 17:54:28 +00:00
|
|
|
if (invalid_param) {
|
|
|
|
fprintf(stderr, "error: invalid parameter for argument: %s\n", arg.c_str());
|
2023-04-14 19:58:43 +00:00
|
|
|
gpt_print_usage(argc, argv, default_params);
|
2023-03-23 17:54:28 +00:00
|
|
|
exit(1);
|
|
|
|
}
|
2023-05-10 15:37:14 +00:00
|
|
|
if (params.prompt_cache_all &&
|
|
|
|
(params.interactive || params.interactive_first ||
|
2023-05-19 17:24:59 +00:00
|
|
|
params.instruct)) {
|
2023-05-10 15:37:14 +00:00
|
|
|
fprintf(stderr, "error: --prompt-cache-all not supported in interactive mode yet\n");
|
|
|
|
gpt_print_usage(argc, argv, default_params);
|
|
|
|
exit(1);
|
|
|
|
}
|
2023-06-15 17:06:46 +00:00
|
|
|
|
2023-08-28 15:59:39 +00:00
|
|
|
if (params.escape) {
|
2023-05-04 12:08:25 +00:00
|
|
|
process_escapes(params.prompt);
|
2023-07-09 08:56:18 +00:00
|
|
|
process_escapes(params.input_prefix);
|
|
|
|
process_escapes(params.input_suffix);
|
2023-05-04 12:08:25 +00:00
|
|
|
}
|
2023-03-10 18:40:58 +00:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2023-04-14 19:58:43 +00:00
|
|
|
void gpt_print_usage(int /*argc*/, char ** argv, const gpt_params & params) {
|
2023-09-05 19:10:27 +00:00
|
|
|
printf("usage: %s [options]\n", argv[0]);
|
|
|
|
printf("\n");
|
|
|
|
printf("options:\n");
|
|
|
|
printf(" -h, --help show this help message and exit\n");
|
|
|
|
printf(" -i, --interactive run in interactive mode\n");
|
|
|
|
printf(" --interactive-first run in interactive mode and wait for input right away\n");
|
|
|
|
printf(" -ins, --instruct run in instruction mode (use with Alpaca models)\n");
|
|
|
|
printf(" --multiline-input allows you to write or paste multiple lines without ending each in '\\'\n");
|
|
|
|
printf(" -r PROMPT, --reverse-prompt PROMPT\n");
|
|
|
|
printf(" halt generation at PROMPT, return control in interactive mode\n");
|
|
|
|
printf(" (can be specified more than once for multiple prompts).\n");
|
|
|
|
printf(" --color colorise output to distinguish prompt and user input from generations\n");
|
|
|
|
printf(" -s SEED, --seed SEED RNG seed (default: -1, use random seed for < 0)\n");
|
|
|
|
printf(" -t N, --threads N number of threads to use during computation (default: %d)\n", params.n_threads);
|
|
|
|
printf(" -p PROMPT, --prompt PROMPT\n");
|
|
|
|
printf(" prompt to start generation with (default: empty)\n");
|
|
|
|
printf(" -e, --escape process prompt escapes sequences (\\n, \\r, \\t, \\', \\\", \\\\)\n");
|
|
|
|
printf(" --prompt-cache FNAME file to cache prompt state for faster startup (default: none)\n");
|
|
|
|
printf(" --prompt-cache-all if specified, saves user input and generations to cache as well.\n");
|
|
|
|
printf(" not supported with --interactive or other interactive options\n");
|
|
|
|
printf(" --prompt-cache-ro if specified, uses the prompt cache but does not update it.\n");
|
|
|
|
printf(" --random-prompt start with a randomized prompt.\n");
|
|
|
|
printf(" --in-prefix-bos prefix BOS to user inputs, preceding the `--in-prefix` string\n");
|
|
|
|
printf(" --in-prefix STRING string to prefix user inputs with (default: empty)\n");
|
|
|
|
printf(" --in-suffix STRING string to suffix after user inputs with (default: empty)\n");
|
|
|
|
printf(" -f FNAME, --file FNAME\n");
|
|
|
|
printf(" prompt file to start generation.\n");
|
|
|
|
printf(" -n N, --n-predict N number of tokens to predict (default: %d, -1 = infinity, -2 = until context filled)\n", params.n_predict);
|
|
|
|
printf(" -c N, --ctx-size N size of the prompt context (default: %d)\n", params.n_ctx);
|
|
|
|
printf(" -b N, --batch-size N batch size for prompt processing (default: %d)\n", params.n_batch);
|
|
|
|
printf(" --top-k N top-k sampling (default: %d, 0 = disabled)\n", params.top_k);
|
|
|
|
printf(" --top-p N top-p sampling (default: %.1f, 1.0 = disabled)\n", (double)params.top_p);
|
|
|
|
printf(" --tfs N tail free sampling, parameter z (default: %.1f, 1.0 = disabled)\n", (double)params.tfs_z);
|
|
|
|
printf(" --typical N locally typical sampling, parameter p (default: %.1f, 1.0 = disabled)\n", (double)params.typical_p);
|
|
|
|
printf(" --repeat-last-n N last n tokens to consider for penalize (default: %d, 0 = disabled, -1 = ctx_size)\n", params.repeat_last_n);
|
|
|
|
printf(" --repeat-penalty N penalize repeat sequence of tokens (default: %.1f, 1.0 = disabled)\n", (double)params.repeat_penalty);
|
|
|
|
printf(" --presence-penalty N repeat alpha presence penalty (default: %.1f, 0.0 = disabled)\n", (double)params.presence_penalty);
|
|
|
|
printf(" --frequency-penalty N repeat alpha frequency penalty (default: %.1f, 0.0 = disabled)\n", (double)params.frequency_penalty);
|
|
|
|
printf(" --mirostat N use Mirostat sampling.\n");
|
|
|
|
printf(" Top K, Nucleus, Tail Free and Locally Typical samplers are ignored if used.\n");
|
|
|
|
printf(" (default: %d, 0 = disabled, 1 = Mirostat, 2 = Mirostat 2.0)\n", params.mirostat);
|
|
|
|
printf(" --mirostat-lr N Mirostat learning rate, parameter eta (default: %.1f)\n", (double)params.mirostat_eta);
|
|
|
|
printf(" --mirostat-ent N Mirostat target entropy, parameter tau (default: %.1f)\n", (double)params.mirostat_tau);
|
|
|
|
printf(" -l TOKEN_ID(+/-)BIAS, --logit-bias TOKEN_ID(+/-)BIAS\n");
|
|
|
|
printf(" modifies the likelihood of token appearing in the completion,\n");
|
|
|
|
printf(" i.e. `--logit-bias 15043+1` to increase likelihood of token ' Hello',\n");
|
|
|
|
printf(" or `--logit-bias 15043-1` to decrease likelihood of token ' Hello'\n");
|
|
|
|
printf(" --grammar GRAMMAR BNF-like grammar to constrain generations (see samples in grammars/ dir)\n");
|
|
|
|
printf(" --grammar-file FNAME file to read grammar from\n");
|
|
|
|
printf(" --cfg-negative-prompt PROMPT\n");
|
|
|
|
printf(" negative prompt to use for guidance. (default: empty)\n");
|
|
|
|
printf(" --cfg-negative-prompt-file FNAME\n");
|
|
|
|
printf(" negative prompt file to use for guidance. (default: empty)\n");
|
|
|
|
printf(" --cfg-scale N strength of guidance (default: %f, 1.0 = disable)\n", params.cfg_scale);
|
|
|
|
printf(" --rope-scale N RoPE context linear scaling factor, inverse of --rope-freq-scale (default: %g)\n", 1.0f/params.rope_freq_scale);
|
|
|
|
printf(" --rope-freq-base N RoPE base frequency, used by NTK-aware scaling (default: %.1f)\n", params.rope_freq_base);
|
|
|
|
printf(" --rope-freq-scale N RoPE frequency linear scaling factor, inverse of --rope-scale (default: %g)\n", params.rope_freq_scale);
|
|
|
|
printf(" --ignore-eos ignore end of stream token and continue generating (implies --logit-bias 2-inf)\n");
|
|
|
|
printf(" --no-penalize-nl do not penalize newline token\n");
|
|
|
|
printf(" --memory-f32 use f32 instead of f16 for memory key+value (default: disabled)\n");
|
|
|
|
printf(" not recommended: doubles context memory required and no measurable increase in quality\n");
|
|
|
|
printf(" --temp N temperature (default: %.1f)\n", (double)params.temp);
|
|
|
|
printf(" --perplexity compute perplexity over each ctx window of the prompt\n");
|
|
|
|
printf(" --hellaswag compute HellaSwag score over random tasks from datafile supplied with -f\n");
|
|
|
|
printf(" --hellaswag-tasks N number of tasks to use when computing the HellaSwag score (default: %zu)\n", params.hellaswag_tasks);
|
|
|
|
printf(" --keep N number of tokens to keep from the initial prompt (default: %d, -1 = all)\n", params.n_keep);
|
|
|
|
printf(" --draft N number of tokens to draft for speculative decoding (default: %d)\n", params.n_draft);
|
|
|
|
printf(" --chunks N max number of chunks to process (default: %d, -1 = all)\n", params.n_chunks);
|
Rewrite loading code to try to satisfy everyone:
- Support all three formats (ggml, ggmf, ggjt). (However, I didn't
include the hack needed to support GPT4All files without conversion.
Those can still be used after converting them with convert.py from my
other PR.)
- Support both mmap and read (mmap is used by default, but can be
disabled with `--no-mmap`, and is automatically disabled for pre-ggjt
files or on platforms where mmap is not supported).
- Support multi-file models like before, but automatically determine the
number of parts rather than requiring `--n_parts`.
- Improve validation and error checking.
- Stop using the per-file type field (f16) entirely in favor of just
relying on the per-tensor type/size fields. This has no immediate
benefit, but makes it easier to experiment with different formats, and
should make it easier to support the new GPTQ-for-LLaMa models in the
future (I have some work in progress on that front).
- Support VirtualLock on Windows (using the same `--mlock` option as on
Unix).
- Indicate loading progress when using mmap + mlock. (Which led me
to the interesting observation that on my Linux machine, with a
warm file cache, mlock actually takes some time, whereas mmap
without mlock starts almost instantly...)
- To help implement this, move mlock support from ggml to the
loading code.
- madvise/PrefetchVirtualMemory support (based on #740)
- Switch from ifstream to the `fopen` family of functions to avoid
unnecessary copying and, when mmap is enabled, allow reusing the same
file descriptor for both metadata reads and mmap (whereas the existing
implementation opens the file a second time to mmap).
- Quantization now produces a single-file output even with multi-file
inputs (not really a feature as much as 'it was easier this way').
Implementation notes:
I tried to factor the code into more discrete pieces than before.
Regarding code style: I tried to follow the code style, but I'm naughty
and used a few advanced C++ features repeatedly:
- Destructors to make it easier to ensure everything gets cleaned up.
- Exceptions. I don't even usually use exceptions when writing C++, and
I can remove them if desired... but here they make the loading code
much more succinct while still properly handling a variety of errors,
ranging from API calls failing to integer overflow and allocation
failure. The exceptions are converted to error codes at the
API boundary.)
Co-authored-by: Pavol Rusnak <pavol@rusnak.io> (for the bit I copied from #740)
2023-04-08 19:24:37 +00:00
|
|
|
if (llama_mlock_supported()) {
|
2023-09-05 19:10:27 +00:00
|
|
|
printf(" --mlock force system to keep model in RAM rather than swapping or compressing\n");
|
2023-03-24 15:19:05 +00:00
|
|
|
}
|
Rewrite loading code to try to satisfy everyone:
- Support all three formats (ggml, ggmf, ggjt). (However, I didn't
include the hack needed to support GPT4All files without conversion.
Those can still be used after converting them with convert.py from my
other PR.)
- Support both mmap and read (mmap is used by default, but can be
disabled with `--no-mmap`, and is automatically disabled for pre-ggjt
files or on platforms where mmap is not supported).
- Support multi-file models like before, but automatically determine the
number of parts rather than requiring `--n_parts`.
- Improve validation and error checking.
- Stop using the per-file type field (f16) entirely in favor of just
relying on the per-tensor type/size fields. This has no immediate
benefit, but makes it easier to experiment with different formats, and
should make it easier to support the new GPTQ-for-LLaMa models in the
future (I have some work in progress on that front).
- Support VirtualLock on Windows (using the same `--mlock` option as on
Unix).
- Indicate loading progress when using mmap + mlock. (Which led me
to the interesting observation that on my Linux machine, with a
warm file cache, mlock actually takes some time, whereas mmap
without mlock starts almost instantly...)
- To help implement this, move mlock support from ggml to the
loading code.
- madvise/PrefetchVirtualMemory support (based on #740)
- Switch from ifstream to the `fopen` family of functions to avoid
unnecessary copying and, when mmap is enabled, allow reusing the same
file descriptor for both metadata reads and mmap (whereas the existing
implementation opens the file a second time to mmap).
- Quantization now produces a single-file output even with multi-file
inputs (not really a feature as much as 'it was easier this way').
Implementation notes:
I tried to factor the code into more discrete pieces than before.
Regarding code style: I tried to follow the code style, but I'm naughty
and used a few advanced C++ features repeatedly:
- Destructors to make it easier to ensure everything gets cleaned up.
- Exceptions. I don't even usually use exceptions when writing C++, and
I can remove them if desired... but here they make the loading code
much more succinct while still properly handling a variety of errors,
ranging from API calls failing to integer overflow and allocation
failure. The exceptions are converted to error codes at the
API boundary.)
Co-authored-by: Pavol Rusnak <pavol@rusnak.io> (for the bit I copied from #740)
2023-04-08 19:24:37 +00:00
|
|
|
if (llama_mmap_supported()) {
|
2023-09-05 19:10:27 +00:00
|
|
|
printf(" --no-mmap do not memory-map model (slower load but may reduce pageouts if not using mlock)\n");
|
Rewrite loading code to try to satisfy everyone:
- Support all three formats (ggml, ggmf, ggjt). (However, I didn't
include the hack needed to support GPT4All files without conversion.
Those can still be used after converting them with convert.py from my
other PR.)
- Support both mmap and read (mmap is used by default, but can be
disabled with `--no-mmap`, and is automatically disabled for pre-ggjt
files or on platforms where mmap is not supported).
- Support multi-file models like before, but automatically determine the
number of parts rather than requiring `--n_parts`.
- Improve validation and error checking.
- Stop using the per-file type field (f16) entirely in favor of just
relying on the per-tensor type/size fields. This has no immediate
benefit, but makes it easier to experiment with different formats, and
should make it easier to support the new GPTQ-for-LLaMa models in the
future (I have some work in progress on that front).
- Support VirtualLock on Windows (using the same `--mlock` option as on
Unix).
- Indicate loading progress when using mmap + mlock. (Which led me
to the interesting observation that on my Linux machine, with a
warm file cache, mlock actually takes some time, whereas mmap
without mlock starts almost instantly...)
- To help implement this, move mlock support from ggml to the
loading code.
- madvise/PrefetchVirtualMemory support (based on #740)
- Switch from ifstream to the `fopen` family of functions to avoid
unnecessary copying and, when mmap is enabled, allow reusing the same
file descriptor for both metadata reads and mmap (whereas the existing
implementation opens the file a second time to mmap).
- Quantization now produces a single-file output even with multi-file
inputs (not really a feature as much as 'it was easier this way').
Implementation notes:
I tried to factor the code into more discrete pieces than before.
Regarding code style: I tried to follow the code style, but I'm naughty
and used a few advanced C++ features repeatedly:
- Destructors to make it easier to ensure everything gets cleaned up.
- Exceptions. I don't even usually use exceptions when writing C++, and
I can remove them if desired... but here they make the loading code
much more succinct while still properly handling a variety of errors,
ranging from API calls failing to integer overflow and allocation
failure. The exceptions are converted to error codes at the
API boundary.)
Co-authored-by: Pavol Rusnak <pavol@rusnak.io> (for the bit I copied from #740)
2023-04-08 19:24:37 +00:00
|
|
|
}
|
2023-09-05 19:10:27 +00:00
|
|
|
printf(" --numa attempt optimizations that help on some NUMA systems\n");
|
|
|
|
printf(" if run without this previously, it is recommended to drop the system page cache before using this\n");
|
|
|
|
printf(" see https://github.com/ggerganov/llama.cpp/issues/1437\n");
|
2023-05-28 17:48:57 +00:00
|
|
|
#ifdef LLAMA_SUPPORTS_GPU_OFFLOAD
|
2023-09-05 19:10:27 +00:00
|
|
|
printf(" -ngl N, --n-gpu-layers N\n");
|
|
|
|
printf(" number of layers to store in VRAM\n");
|
2023-09-13 06:50:46 +00:00
|
|
|
printf(" -ngld N, --n-gpu-layers-draft N\n");
|
|
|
|
printf(" number of layers to store in VRAM for the draft model\n");
|
2023-09-05 19:10:27 +00:00
|
|
|
printf(" -ts SPLIT --tensor-split SPLIT\n");
|
|
|
|
printf(" how to split tensors across multiple GPUs, comma-separated list of proportions, e.g. 3,1\n");
|
|
|
|
printf(" -mg i, --main-gpu i the GPU to use for scratch and small tensors\n");
|
|
|
|
printf(" -lv, --low-vram don't allocate VRAM scratch buffer\n");
|
2023-08-25 09:09:42 +00:00
|
|
|
#ifdef GGML_USE_CUBLAS
|
2023-09-05 19:10:27 +00:00
|
|
|
printf(" -nommq, --no-mul-mat-q\n");
|
|
|
|
printf(" use " GGML_CUBLAS_NAME " instead of custom mul_mat_q " GGML_CUDA_NAME " kernels.\n");
|
|
|
|
printf(" Not recommended since this is both slower and uses more VRAM.\n");
|
2023-08-25 09:09:42 +00:00
|
|
|
#endif // GGML_USE_CUBLAS
|
2023-05-28 17:48:57 +00:00
|
|
|
#endif
|
2023-09-05 19:10:27 +00:00
|
|
|
printf(" --export export the computation graph to 'llama.ggml'\n");
|
|
|
|
printf(" --verbose-prompt print prompt before generation\n");
|
2023-08-04 15:20:12 +00:00
|
|
|
fprintf(stderr, " --simple-io use basic IO for better compatibility in subprocesses and limited consoles\n");
|
2023-09-05 19:10:27 +00:00
|
|
|
printf(" --lora FNAME apply LoRA adapter (implies --no-mmap)\n");
|
|
|
|
printf(" --lora-base FNAME optional model to use as a base for the layers modified by the LoRA adapter\n");
|
|
|
|
printf(" -m FNAME, --model FNAME\n");
|
|
|
|
printf(" model path (default: %s)\n", params.model.c_str());
|
|
|
|
printf(" -md FNAME, --model-draft FNAME\n");
|
|
|
|
printf(" draft model for speculative decoding (default: %s)\n", params.model.c_str());
|
|
|
|
printf(" -ld LOGDIR, --logdir LOGDIR\n");
|
|
|
|
printf(" path under which to save YAML logs (no logging if unset)\n");
|
|
|
|
printf("\n");
|
2023-03-10 18:40:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
std::string gpt_random_prompt(std::mt19937 & rng) {
|
|
|
|
const int r = rng() % 10;
|
|
|
|
switch (r) {
|
|
|
|
case 0: return "So";
|
|
|
|
case 1: return "Once upon a time";
|
|
|
|
case 2: return "When";
|
|
|
|
case 3: return "The";
|
|
|
|
case 4: return "After";
|
|
|
|
case 5: return "If";
|
|
|
|
case 6: return "import";
|
|
|
|
case 7: return "He";
|
|
|
|
case 8: return "She";
|
|
|
|
case 9: return "They";
|
|
|
|
default: return "To";
|
|
|
|
}
|
|
|
|
|
|
|
|
return "The";
|
|
|
|
}
|
|
|
|
|
2023-08-21 20:07:43 +00:00
|
|
|
//
|
|
|
|
// Model utils
|
|
|
|
//
|
2023-03-28 14:09:55 +00:00
|
|
|
|
2023-07-11 16:18:43 +00:00
|
|
|
struct llama_context_params llama_context_params_from_gpt_params(const gpt_params & params) {
|
2023-05-02 20:39:51 +00:00
|
|
|
auto lparams = llama_context_default_params();
|
|
|
|
|
2023-07-22 18:17:57 +00:00
|
|
|
lparams.n_ctx = params.n_ctx;
|
|
|
|
lparams.n_batch = params.n_batch;
|
2023-09-04 19:26:24 +00:00
|
|
|
if (params.n_gpu_layers != -1) {
|
|
|
|
lparams.n_gpu_layers = params.n_gpu_layers;
|
|
|
|
}
|
2023-07-22 18:17:57 +00:00
|
|
|
lparams.main_gpu = params.main_gpu;
|
|
|
|
lparams.tensor_split = params.tensor_split;
|
|
|
|
lparams.low_vram = params.low_vram;
|
2023-07-31 13:44:35 +00:00
|
|
|
lparams.mul_mat_q = params.mul_mat_q;
|
2023-07-22 18:17:57 +00:00
|
|
|
lparams.seed = params.seed;
|
|
|
|
lparams.f16_kv = params.memory_f16;
|
|
|
|
lparams.use_mmap = params.use_mmap;
|
|
|
|
lparams.use_mlock = params.use_mlock;
|
|
|
|
lparams.logits_all = params.perplexity;
|
|
|
|
lparams.embedding = params.embedding;
|
llama : add custom RoPE (#2054)
* Implement customizable RoPE
The original RoPE has pre-defined parameters
theta_i = 10000^(−2(i−1)/d), for i in [1, 2, ..., d/2]
Our customizable RoPE, ggml_rope_custom_inplace, uses
theta_i = scale * base^(−2(i−1)/d), for i in [1, 2, ..., d/2]
with the default matches the original
scale = 1.0
base = 10000
The new command line arguments
--rope-freq-base
--rope-freq-scale
set the two new RoPE parameter.
Recent researches show changing these two parameters extends the context limit with minimal loss.
1. Extending Context to 8K
kaiokendev
https://kaiokendev.github.io/til#extending-context-to-8k
2. Extending Context Window of Large Language Models via Positional Interpolation
Shouyuan Chen, Sherman Wong, Liangjian Chen, Yuandong Tian
https://arxiv.org/abs/2306.15595
3. NTK-Aware Scaled RoPE allows LLaMA models to have extended (8k+) context size without any fine-tuning and minimal perplexity degradation.
https://www.reddit.com/user/bloc97
https://www.reddit.com/r/LocalLLaMA/comments/14lz7j5/ntkaware_scaled_rope_allows_llama_models_to_have/
For the bold, try adding the following command line parameters to your favorite model:
-c 16384 --rope-freq-base 80000 --rope-freq-scale 0.5
* ggml-metal: fix custom rope
* common: fix argument names in help
* llama: increase MEM_REQ_EVAL for MODEL_3B
It avoids crashing for quantized weights on CPU.
Better ways to calculate the required buffer size would be better.
* llama: make MEM_REQ_EVAL depend on n_ctx
* server: use proper Content-Type in curl examples
Without the header Content-Type: application/json, curl will POST with
Content-Type: application/x-www-form-urlencoded
Though our simple server doesn't care, the httplib.h used has a limit
with CPPHTTPLIB_FORM_URL_ENCODED_PAYLOAD_MAX_LENGTH 8192
With Content-Type: application/json, we can send large json data.
* style : minor fixes, mostly indentations
* ggml : fix asserts
---------
Co-authored-by: Georgi Gerganov <ggerganov@gmail.com>
2023-07-15 10:34:16 +00:00
|
|
|
lparams.rope_freq_base = params.rope_freq_base;
|
|
|
|
lparams.rope_freq_scale = params.rope_freq_scale;
|
2023-05-02 20:39:51 +00:00
|
|
|
|
2023-07-11 16:18:43 +00:00
|
|
|
return lparams;
|
|
|
|
}
|
|
|
|
|
2023-08-21 20:07:43 +00:00
|
|
|
std::tuple<struct llama_model *, struct llama_context *> llama_init_from_gpt_params(gpt_params & params) {
|
2023-07-11 16:18:43 +00:00
|
|
|
auto lparams = llama_context_params_from_gpt_params(params);
|
|
|
|
|
2023-06-24 08:47:58 +00:00
|
|
|
llama_model * model = llama_load_model_from_file(params.model.c_str(), lparams);
|
|
|
|
if (model == NULL) {
|
|
|
|
fprintf(stderr, "%s: error: failed to load model '%s'\n", __func__, params.model.c_str());
|
|
|
|
return std::make_tuple(nullptr, nullptr);
|
|
|
|
}
|
2023-05-02 20:39:51 +00:00
|
|
|
|
2023-06-24 08:47:58 +00:00
|
|
|
llama_context * lctx = llama_new_context_with_model(model, lparams);
|
2023-05-02 20:39:51 +00:00
|
|
|
if (lctx == NULL) {
|
2023-06-24 08:47:58 +00:00
|
|
|
fprintf(stderr, "%s: error: failed to create context with model '%s'\n", __func__, params.model.c_str());
|
|
|
|
llama_free_model(model);
|
|
|
|
return std::make_tuple(nullptr, nullptr);
|
2023-05-02 20:39:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!params.lora_adapter.empty()) {
|
2023-06-24 08:47:58 +00:00
|
|
|
int err = llama_model_apply_lora_from_file(model,
|
2023-05-02 20:39:51 +00:00
|
|
|
params.lora_adapter.c_str(),
|
|
|
|
params.lora_base.empty() ? NULL : params.lora_base.c_str(),
|
|
|
|
params.n_threads);
|
|
|
|
if (err != 0) {
|
|
|
|
fprintf(stderr, "%s: error: failed to apply lora adapter\n", __func__);
|
2023-06-24 08:47:58 +00:00
|
|
|
llama_free(lctx);
|
|
|
|
llama_free_model(model);
|
|
|
|
return std::make_tuple(nullptr, nullptr);
|
2023-05-02 20:39:51 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-08-21 20:07:43 +00:00
|
|
|
if (params.ignore_eos) {
|
|
|
|
params.logit_bias[llama_token_eos(lctx)] = -INFINITY;
|
|
|
|
}
|
|
|
|
|
2023-09-03 10:42:56 +00:00
|
|
|
{
|
|
|
|
LOG("warming up the model with an empty run\n");
|
|
|
|
|
2023-09-05 05:46:17 +00:00
|
|
|
const std::vector<llama_token> tmp = { llama_token_bos(lctx), llama_token_eos(lctx), };
|
2023-09-07 12:49:09 +00:00
|
|
|
llama_eval(lctx, tmp.data(), std::min(tmp.size(), (size_t) params.n_batch), 0, params.n_threads);
|
2023-09-03 10:42:56 +00:00
|
|
|
llama_reset_timings(lctx);
|
|
|
|
}
|
|
|
|
|
2023-06-24 08:47:58 +00:00
|
|
|
return std::make_tuple(model, lctx);
|
2023-05-02 20:39:51 +00:00
|
|
|
}
|
2023-08-21 20:07:43 +00:00
|
|
|
|
|
|
|
//
|
|
|
|
// Vocab utils
|
|
|
|
//
|
|
|
|
|
|
|
|
std::vector<llama_token> llama_tokenize(
|
|
|
|
struct llama_context * ctx,
|
|
|
|
const std::string & text,
|
|
|
|
bool add_bos) {
|
|
|
|
// upper limit for the number of tokens
|
|
|
|
int n_tokens = text.length() + add_bos;
|
|
|
|
std::vector<llama_token> result(n_tokens);
|
2023-09-16 11:41:33 +00:00
|
|
|
n_tokens = llama_tokenize(ctx, text.data(), text.length(), result.data(), result.size(), add_bos);
|
2023-08-21 20:07:43 +00:00
|
|
|
if (n_tokens < 0) {
|
|
|
|
result.resize(-n_tokens);
|
2023-09-16 11:41:33 +00:00
|
|
|
int check = llama_tokenize(ctx, text.data(), text.length(), result.data(), result.size(), add_bos);
|
2023-08-21 20:07:43 +00:00
|
|
|
GGML_ASSERT(check == -n_tokens);
|
|
|
|
} else {
|
|
|
|
result.resize(n_tokens);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2023-08-27 11:19:19 +00:00
|
|
|
std::string llama_token_to_piece(const struct llama_context * ctx, llama_token token) {
|
2023-08-21 20:07:43 +00:00
|
|
|
std::vector<char> result(8, 0);
|
2023-08-27 11:19:19 +00:00
|
|
|
const int n_tokens = llama_token_to_piece(ctx, token, result.data(), result.size());
|
2023-08-21 20:07:43 +00:00
|
|
|
if (n_tokens < 0) {
|
|
|
|
result.resize(-n_tokens);
|
2023-08-27 11:19:19 +00:00
|
|
|
int check = llama_token_to_piece(ctx, token, result.data(), result.size());
|
2023-08-21 20:07:43 +00:00
|
|
|
GGML_ASSERT(check == -n_tokens);
|
|
|
|
} else {
|
|
|
|
result.resize(n_tokens);
|
|
|
|
}
|
|
|
|
|
|
|
|
return std::string(result.data(), result.size());
|
|
|
|
}
|
2023-08-27 11:19:19 +00:00
|
|
|
|
|
|
|
std::string llama_detokenize_spm(llama_context * ctx, const std::vector<llama_token> & tokens) {
|
|
|
|
const llama_token bos_id = llama_token_bos(ctx);
|
|
|
|
|
|
|
|
std::string piece;
|
|
|
|
std::string result;
|
|
|
|
|
|
|
|
for (size_t i = 0; i < tokens.size(); ++i) {
|
|
|
|
piece = llama_token_to_piece(ctx, tokens[i]);
|
|
|
|
|
|
|
|
// remove the leading space of the first non-BOS token
|
|
|
|
if (((tokens[0] == bos_id && i == 1) || (tokens[0] != bos_id && i == 0)) && piece[0] == ' ') {
|
|
|
|
piece = piece.substr(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
result += piece;
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string llama_detokenize_bpe(llama_context * ctx, const std::vector<llama_token> & tokens) {
|
|
|
|
std::string piece;
|
|
|
|
std::string result;
|
|
|
|
|
|
|
|
for (size_t i = 0; i < tokens.size(); ++i) {
|
|
|
|
piece = llama_token_to_piece(ctx, tokens[i]);
|
|
|
|
|
|
|
|
result += piece;
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
2023-08-28 15:59:39 +00:00
|
|
|
|
2023-09-03 12:12:08 +00:00
|
|
|
//
|
|
|
|
// Sampling utils
|
|
|
|
//
|
|
|
|
|
|
|
|
llama_token llama_sample_token(
|
|
|
|
struct llama_context * ctx,
|
|
|
|
struct llama_context * ctx_guidance,
|
|
|
|
struct llama_grammar * grammar,
|
|
|
|
const struct gpt_params & params,
|
|
|
|
const std::vector<llama_token> & last_tokens,
|
|
|
|
std::vector<llama_token_data> & candidates,
|
|
|
|
int idx) {
|
|
|
|
const int n_ctx = llama_n_ctx(ctx);
|
|
|
|
const int n_vocab = llama_n_vocab(ctx);
|
|
|
|
|
|
|
|
const float temp = params.temp;
|
|
|
|
const int32_t top_k = params.top_k <= 0 ? n_vocab : params.top_k;
|
|
|
|
const float top_p = params.top_p;
|
|
|
|
const float tfs_z = params.tfs_z;
|
|
|
|
const float typical_p = params.typical_p;
|
|
|
|
const int32_t repeat_last_n = params.repeat_last_n < 0 ? n_ctx : params.repeat_last_n;
|
|
|
|
const float repeat_penalty = params.repeat_penalty;
|
|
|
|
const float alpha_presence = params.presence_penalty;
|
|
|
|
const float alpha_frequency = params.frequency_penalty;
|
|
|
|
const int mirostat = params.mirostat;
|
|
|
|
const float mirostat_tau = params.mirostat_tau;
|
|
|
|
const float mirostat_eta = params.mirostat_eta;
|
|
|
|
const bool penalize_nl = params.penalize_nl;
|
|
|
|
|
|
|
|
llama_token id = 0;
|
|
|
|
|
|
|
|
float * logits = llama_get_logits(ctx) + idx * n_vocab;
|
|
|
|
|
|
|
|
// Apply params.logit_bias map
|
|
|
|
for (auto it = params.logit_bias.begin(); it != params.logit_bias.end(); it++) {
|
|
|
|
logits[it->first] += it->second;
|
|
|
|
}
|
|
|
|
|
|
|
|
candidates.clear();
|
|
|
|
for (llama_token token_id = 0; token_id < n_vocab; token_id++) {
|
|
|
|
candidates.emplace_back(llama_token_data{token_id, logits[token_id], 0.0f});
|
|
|
|
}
|
|
|
|
|
|
|
|
llama_token_data_array cur_p = { candidates.data(), candidates.size(), false };
|
|
|
|
|
|
|
|
if (ctx_guidance) {
|
|
|
|
llama_sample_classifier_free_guidance(ctx, &cur_p, ctx_guidance, params.cfg_scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
// apply penalties
|
|
|
|
if (!last_tokens.empty()) {
|
|
|
|
const float nl_logit = logits[llama_token_nl(ctx)];
|
|
|
|
const int last_n_repeat = std::min(std::min((int)last_tokens.size(), repeat_last_n), n_ctx);
|
|
|
|
|
|
|
|
llama_sample_repetition_penalty(ctx, &cur_p,
|
|
|
|
last_tokens.data() + last_tokens.size() - last_n_repeat,
|
|
|
|
last_n_repeat, repeat_penalty);
|
|
|
|
llama_sample_frequency_and_presence_penalties(ctx, &cur_p,
|
|
|
|
last_tokens.data() + last_tokens.size() - last_n_repeat,
|
|
|
|
last_n_repeat, alpha_frequency, alpha_presence);
|
|
|
|
|
|
|
|
if (!penalize_nl) {
|
|
|
|
for (size_t idx = 0; idx < cur_p.size; idx++) {
|
|
|
|
if (cur_p.data[idx].id == llama_token_nl(ctx)) {
|
|
|
|
cur_p.data[idx].logit = nl_logit;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (grammar != NULL) {
|
|
|
|
llama_sample_grammar(ctx, &cur_p, grammar);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (temp <= 0) {
|
|
|
|
// Greedy sampling
|
|
|
|
id = llama_sample_token_greedy(ctx, &cur_p);
|
|
|
|
} else {
|
|
|
|
if (mirostat == 1) {
|
|
|
|
static float mirostat_mu = 2.0f * mirostat_tau;
|
|
|
|
const int mirostat_m = 100;
|
|
|
|
llama_sample_temperature(ctx, &cur_p, temp);
|
|
|
|
id = llama_sample_token_mirostat(ctx, &cur_p, mirostat_tau, mirostat_eta, mirostat_m, &mirostat_mu);
|
|
|
|
} else if (mirostat == 2) {
|
|
|
|
static float mirostat_mu = 2.0f * mirostat_tau;
|
|
|
|
llama_sample_temperature(ctx, &cur_p, temp);
|
|
|
|
id = llama_sample_token_mirostat_v2(ctx, &cur_p, mirostat_tau, mirostat_eta, &mirostat_mu);
|
|
|
|
} else {
|
|
|
|
// Temperature sampling
|
|
|
|
llama_sample_top_k (ctx, &cur_p, top_k, 1);
|
|
|
|
llama_sample_tail_free (ctx, &cur_p, tfs_z, 1);
|
|
|
|
llama_sample_typical (ctx, &cur_p, typical_p, 1);
|
|
|
|
llama_sample_top_p (ctx, &cur_p, top_p, 1);
|
|
|
|
llama_sample_temperature(ctx, &cur_p, temp);
|
|
|
|
|
|
|
|
{
|
|
|
|
const int n_top = 10;
|
|
|
|
LOG("top %d candidates:\n", n_top);
|
|
|
|
|
|
|
|
for (int i = 0; i < n_top; i++) {
|
|
|
|
const llama_token id = cur_p.data[i].id;
|
|
|
|
LOG(" - %5d: '%12s' (%.3f)\n", id, llama_token_to_piece(ctx, id).c_str(), cur_p.data[i].p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
id = llama_sample_token(ctx, &cur_p);
|
|
|
|
|
|
|
|
LOG("sampled token: %5d: '%s'\n", id, llama_token_to_piece(ctx, id).c_str());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// printf("`%d`", candidates_p.size);
|
|
|
|
|
|
|
|
if (grammar != NULL) {
|
|
|
|
llama_grammar_accept_token(ctx, grammar, id);
|
|
|
|
}
|
|
|
|
|
|
|
|
return id;
|
|
|
|
}
|
|
|
|
|
|
|
|
//
|
|
|
|
// YAML utils
|
|
|
|
//
|
|
|
|
|
2023-08-28 15:59:39 +00:00
|
|
|
// returns true if successful, false otherwise
|
|
|
|
bool create_directory_with_parents(const std::string & path) {
|
|
|
|
#ifdef _WIN32
|
|
|
|
std::wstring_convert<std::codecvt_utf8<wchar_t>> converter;
|
|
|
|
std::wstring wpath = converter.from_bytes(path);
|
|
|
|
|
|
|
|
// if the path already exists, check whether it's a directory
|
|
|
|
const DWORD attributes = GetFileAttributesW(wpath.c_str());
|
|
|
|
if ((attributes != INVALID_FILE_ATTRIBUTES) && (attributes & FILE_ATTRIBUTE_DIRECTORY)) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t pos_slash = 0;
|
|
|
|
|
|
|
|
// process path from front to back, procedurally creating directories
|
|
|
|
while ((pos_slash = path.find('\\', pos_slash)) != std::string::npos) {
|
|
|
|
const std::wstring subpath = wpath.substr(0, pos_slash);
|
|
|
|
const wchar_t * test = subpath.c_str();
|
|
|
|
|
|
|
|
const bool success = CreateDirectoryW(test, NULL);
|
|
|
|
if (!success) {
|
|
|
|
const DWORD error = GetLastError();
|
|
|
|
|
|
|
|
// if the path already exists, ensure that it's a directory
|
|
|
|
if (error == ERROR_ALREADY_EXISTS) {
|
|
|
|
const DWORD attributes = GetFileAttributesW(subpath.c_str());
|
|
|
|
if (attributes == INVALID_FILE_ATTRIBUTES || !(attributes & FILE_ATTRIBUTE_DIRECTORY)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pos_slash += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
#else
|
|
|
|
// if the path already exists, check whether it's a directory
|
|
|
|
struct stat info;
|
|
|
|
if (stat(path.c_str(), &info) == 0) {
|
|
|
|
return S_ISDIR(info.st_mode);
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t pos_slash = 1; // skip leading slashes for directory creation
|
|
|
|
|
|
|
|
// process path from front to back, procedurally creating directories
|
|
|
|
while ((pos_slash = path.find('/', pos_slash)) != std::string::npos) {
|
|
|
|
const std::string subpath = path.substr(0, pos_slash);
|
|
|
|
struct stat info;
|
|
|
|
|
|
|
|
// if the path already exists, ensure that it's a directory
|
|
|
|
if (stat(subpath.c_str(), &info) == 0) {
|
|
|
|
if (!S_ISDIR(info.st_mode)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// create parent directories
|
|
|
|
const int ret = mkdir(subpath.c_str(), 0755);
|
|
|
|
if (ret != 0) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pos_slash += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
#endif // _WIN32
|
|
|
|
}
|
|
|
|
|
|
|
|
void dump_vector_float_yaml(FILE * stream, const char * prop_name, const std::vector<float> & data) {
|
|
|
|
if (data.empty()) {
|
|
|
|
fprintf(stream, "%s:\n", prop_name);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf(stream, "%s: [", prop_name);
|
|
|
|
for (size_t i = 0; i < data.size() - 1; ++i) {
|
|
|
|
fprintf(stream, "%e, ", data[i]);
|
|
|
|
}
|
|
|
|
fprintf(stream, "%e]\n", data.back());
|
|
|
|
}
|
|
|
|
|
|
|
|
void dump_vector_int_yaml(FILE * stream, const char * prop_name, const std::vector<int> & data) {
|
|
|
|
if (data.empty()) {
|
|
|
|
fprintf(stream, "%s:\n", prop_name);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf(stream, "%s: [", prop_name);
|
|
|
|
for (size_t i = 0; i < data.size() - 1; ++i) {
|
|
|
|
fprintf(stream, "%d, ", data[i]);
|
|
|
|
}
|
|
|
|
fprintf(stream, "%d]\n", data.back());
|
|
|
|
}
|
|
|
|
|
|
|
|
void dump_string_yaml_multiline(FILE * stream, const char * prop_name, const char * data) {
|
|
|
|
std::string data_str(data == NULL ? "" : data);
|
|
|
|
|
|
|
|
if (data_str.empty()) {
|
|
|
|
fprintf(stream, "%s:\n", prop_name);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t pos_start = 0;
|
|
|
|
size_t pos_found = 0;
|
|
|
|
|
|
|
|
if (!data_str.empty() && (std::isspace(data_str[0]) || std::isspace(data_str.back()))) {
|
|
|
|
data_str = std::regex_replace(data_str, std::regex("\n"), "\\n");
|
|
|
|
data_str = std::regex_replace(data_str, std::regex("\""), "\\\"");
|
|
|
|
data_str = "\"" + data_str + "\"";
|
|
|
|
fprintf(stream, "%s: %s\n", prop_name, data_str.c_str());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (data_str.find('\n') == std::string::npos) {
|
|
|
|
fprintf(stream, "%s: %s\n", prop_name, data_str.c_str());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf(stream, "%s: |\n", prop_name);
|
|
|
|
while ((pos_found = data_str.find('\n', pos_start)) != std::string::npos) {
|
|
|
|
fprintf(stream, " %s\n", data_str.substr(pos_start, pos_found-pos_start).c_str());
|
|
|
|
pos_start = pos_found + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string get_sortable_timestamp() {
|
|
|
|
using clock = std::chrono::system_clock;
|
|
|
|
|
|
|
|
const clock::time_point current_time = clock::now();
|
|
|
|
const time_t as_time_t = clock::to_time_t(current_time);
|
|
|
|
char timestamp_no_ns[100];
|
|
|
|
std::strftime(timestamp_no_ns, 100, "%Y_%m_%d-%H_%M_%S", std::localtime(&as_time_t));
|
|
|
|
|
|
|
|
const int64_t ns = std::chrono::duration_cast<std::chrono::nanoseconds>(
|
|
|
|
current_time.time_since_epoch() % 1000000000).count();
|
train : mem usage and other improvements (#2439)
* fix track_max_mem in forward_batch_wo_cache_flash_attn_train
* remove unnecessary Adam(W) optimizer tensors.
reduces optimizer memory overhead from 7*modelsize to 2*modelsize.
additionally allows to optimize models with more than 2^31 parameters by replacing int with int64_t.
bumps training checkpoint file version, but old checkpoints can still be read.
new version with less tensors is saved.
* add gradient clipping to AdamW
* Fix reset of unused g->nodes and g->grads to NULL
* implement gradient checkpointing for training
reduces memory overhead from O(n_layer) to O(sqrt(n_layer))
as explained in readme of https://github.com/cybertronai/gradient-checkpointing
* remove unused compute buffer 3
* add and use function ggml_build_backward_expand to avoid stack overflows with large maximum number of nodes
GGML_API void ggml_build_backward_expand(struct ggml_context * ctx, struct ggml_cgraph * gf, struct ggml_cgraph * gb, bool keep);
* change AdamW decay parameter to work like the torch AdamW decay parameter
It is now relative to Adam learning rate `alpha*sched`.
Before that it was relative to `sched` only.
`alpha` being the maximum learning rate and `sched` being a scaling parameter in [0..1]
* change default AdamW weight decay parameter used in training to 0.1 as used in nanoGPT
* change default AdamW weight decay parameter defined in ggml to 0.0, making Adam default instead of AdamW
btw: the default weight decay parameter for torch.optim.AdamW is 0.01
* bug fixes for cross entropy loss
ggml_cross_entropy_loss: sums where not correctly added in workload of each thread
ggml_cross_entropy_loss_back: simplify backward process, reducing numerical issues
guard usage of exp f16 lookup in cross entropy by #define GGML_CROSS_ENTROPY_EXP_FP16
cross entropy loss is only used once during training, but it is quite sensitive to numerical errors introduced by exp-f16-lookup.
so exp-f16-lookup for cross entropy loss is disabled by default, trading better gradients for very slightly worse runtime performance.
* fix test-grad0 for cross_entropy_loss
the second argument to cross_entropy_loss must sum up to 1 for each row
* fix test-grad0 for soft_max
dont use only sum as aggregation, because sum of softmax is always 1 -> finite differences should not work
instead use sum(log(soft_max()*(1-eps)+eps)); use eps to avoid log(0)
* improve finite differences of test-grad0 by using double instead of float
* change cross_entropy_loss to output average over all rows
this helps keeping the loss and gradients in a sane range
* improve gradient checkpointing
sqrt(n_layers) is only the best checkpoint step when mem size of checkpoints and mem size of layers are equal.
since layers require more memory than the single-tensor-checkpoint we use, the optimal values are compute different:
```
given: n, u, v
objective: minimize(a*u+b*v) where a*b=n, a>0, b>0
b=n/a
minimize(a*u+v*n/a)
diff(a*u+v*n/a, a) = u - (v*n/a)/a
diff(a*u+v*n/a, a) == 0
u - (v*n/a)/a == 0
u == v*n/(a*a)
u*a*a = v*n
a*a = v*n/u
a = sqrt(n*v/u)
```
this change results in more checkpoints, requiring less layers to store between checkpoints, overall improving memory usage.
* disable gradient checkpointing debug output
* llama : fix rope usage in train-text-from-scratch after ChatGLM change
* add more training parameters:
--enable-restart N Only for Adam optimizer. Enable restarts of cos-decay
--disable-restart N Only for Adam optimizer. Disable restarts of cos-decay
--opt-past N Number of optimization iterations to track for delta convergence test. Disabled when zero.
--opt-delta N Maximum delta for delta convergence test. Disabled when <= zero.
--opt-max-no-improvement N Maximum number of optimization iterations with no improvement. Disabled when <= zero.
--adam-epsf N AdamW epsilon for convergence test. Disabled when <= zero.
--adam-min-alpha N Adam minimum learning rate alpha, usually 0.1 * alpha
* replace memcpy with reshape operation so that the graph is not cut at the input
this makes it possible to store other values into the input tensor and then simply recompute the graph without rebuilding it
* remove unused function argument from get_example_targets_batch
* measure and print total training time
* add optimization callback to ggml_opt_resume_g
this callback is called before each iteration with custom data and pointer to learning schedule parameter (only used in Adam(W)).
can be used for dynamic learning schedule and setting input data for batches before each iteration
* use optimization callback in training
allows dynamic learning schedule and different batch data for each iteration without relying on low n_iter and high n_examples parameters
reduces runtime by avoiding restart of optimization function and improves training convergence by providing a different batch for each iteration
* add minimum number of tensor dimensions to apply weight decay (default 2)
this allows to not apply weight decay to bias parameters
* rename training parameter cos-decay-alpha to cos-decay-min and clarify that adam-min-alpha also applies to warmup
* fix increase of model.train_samples and model.train_tokens
now that each optimizer iteration gets its own batch we need to multiply by number of opt iterations
* change sampling parameters for prediction after training to defaults of common.h
and clarify what is context for prediction and what are generated tokens
* tighten abs error bounds for cross_entropy_loss in test-grad0
* add conditional compilation of using F16 exp in flash attention
uncomment `// #define GGML_FLASH_ATTN_EXP_FP16` to enable usage of f16 exp in flash attention
* tighten abs error bounds for flash_attn in test-grad0
* tighten abs error bounds for sqrt in test-grad0
* remove out-commented vectorized code of opt_adam
the vectorized code might be bit faster for low number of parameters, but it had a big memory usage overhead
* ggml : update ggml_rms_norm_back with configurable eps
* llama training : fix ggml_rms_norm_back calls to pass configurable eps
* remove trailing whitespace
* add train function using automatic gradient checkpointing backward pass and allocator
* in train function replace add_inplace by regular add
because using add_inplace seems to result in different gradients
* don't use allocate hash_map on context
because the context has no_alloc=True when using memory allocator resulting in NULL data pointers
* correctly clone reshape and permute operations by also cloning tensor->nb values
* fix variable name and add missing type cast
* terminate recursive tensor cloning when reaching tensor without src tensors
* correctly clone view tensors by setting data pointers
without this the checkpointing would only work when being used together with memory allocator
* fix variable names
* swap arguments to commutative ops to be the same as in `forward_batch_wo_cache_flash_attn`
* add input tensors as checkpoints
so that recursive tensor cloning of gradient checkpointing terminates on input tensors
* fix variable name and add missing boolean negation
* make sure some tensors are not reallocated by inserting new temporary nodes depending on them:
output and parameter gradient tensors need to be available at the end of the graph execution
parameter gradient tensors also need to be available before the graph execution because they are set to zero before each optimizer iteration
checkpoint tensors are allocated all together to reduce memory allocator fragmentation
afterwards, in addition to the temporary nodes, we also need to reset the temporary leafs
* fix ASSERT to work with zero layers
* add training options whether to use allocator and/or unified training function
* integrate unified training function which may use memory allocator
the unified training function also supports arguments whether to use flash attention and/or gradient checkpointing
* format name of cloned tensors with " (clone)" suffix
* set names for tensors in unified train function for easier debugging
* allocate graph on context using ggml_new_graph
* remove handwritten training functions
* remove unused training parameters "use_scratch" and "use_unified"
* remove trailing whitespace
* remove unused train params: mem_compute1_gb & mem_compute2_gb
mem_compute_gb is used for compute when automatic memory allocator is not enabled, otherwise it can be very small to only hold the tensor definitions
mem_compute0_gb is used for automatic memory allocator (as long as measurement of max required size is not implemented)
* remove unused forward_batch function
* add debug asserts in ggml_allocr_alloc to some common pitfalls when using this function directly
* only use ggml_allocr_alloc when tensor has NULL data and is no view
* fix test when to create temporary backward graph
temporary backward graph is only necessary when using checkpointing
* fix memory "leak" in optimizers
each iteration a new cplan with new memory for work data was allocated.
now cplan creation only happens at the start of optimization, with each iteration reusing the cplan and its work data.
* reverse order of for loop in ggml_build_backward_expand to save memory when using gradient checkpointing and allocator
with this loop order gradient checkpointing with allocator on 16 layer model saves 13% memory; 2 layer memory it saves 2% memory.
the computation results are the same
* add missing lctx argument to get_example_targets_batch
* implement llama model file saving using gguf
checkpoint loading and saving disabled, to be replaced by loading and saving via gguf
* implement loading/saving of checkpointing files using GGUF
* bug fixes
* add checkpoint file version for future compatibility
* update readme with gguf filenames
* save & load opt->just_initialized value
* add first draft for checkpoint conversion script
* add gguf arch and ftype
* save opt parameter counter as uint64
* add gguf key and tensor names for optimizer and training
* add layer_norm_rms_eps to checkpoint convert script
* use same GGUF_GET_KEY macro as in llama.cpp
* use norm_rms_eps, and rope parameters and command line options to set them
* fix memory corruption bug in gguf
ctx->kv and ctx->infos was reallocated using not-aligned realloc, but freed with aligned free.
to fix this a GGML_ALIGNED_REALLOC was added, but there is no posix_memalign_realloc function.
so on non-windows and non-mingw32 platforms we fall back to aligned malloc, followed by copying
and freeing the old data.
* add gguf example cmake file
* bug fixes in tokenize_file
* bug fixes in load_llama_model_gguf
* bug fix: init model when no checkpoint was loaded
* bug fix in read_tensor_by_name
* bug fix in load_opt_context_gguf
* avoid printing lots of spaced on the unusual case that loss gets nan
* set name of tensors with empty name from what was read from gguf
* remove trailing whitespace
* print data checksums before saving and after loading to verify correctness
* bug fixes for convert-train-checkpoint-to-gguf
* temporarily add code to write old checkpoint files
used to verify that old checkpoint files are correctly converted to gguf
* bug fixes for convert-train-checkpoint-to-gguf.py loading checkpoints with opt_version=0
* remove code used to verify correctness of checkpoint file conversion
* remove trailing whitespace
* remove prediction related code
use main for prediction, it is better optimized
* update train-text-from-scratch README.md
* fix non-windows GGML_ALIGNED_REALLOC
* add missing blank line at end of file
* remove GGML_ALIGNED_REALLOC and use normal malloc/realloc/free for gguf ctx->kv & ctx->infos
* train : fix compile warnings
---------
Co-authored-by: Georgi Gerganov <ggerganov@gmail.com>
2023-08-28 19:51:47 +00:00
|
|
|
char timestamp_ns[11];
|
|
|
|
snprintf(timestamp_ns, 11, "%09" PRId64, ns);
|
2023-08-28 15:59:39 +00:00
|
|
|
|
|
|
|
return std::string(timestamp_no_ns) + "." + std::string(timestamp_ns);
|
|
|
|
}
|
|
|
|
|
|
|
|
void dump_non_result_info_yaml(FILE * stream, const gpt_params & params, const llama_context * lctx,
|
|
|
|
const std::string & timestamp, const std::vector<int> & prompt_tokens, const char * model_desc) {
|
|
|
|
fprintf(stream, "build_commit: %s\n", BUILD_COMMIT);
|
|
|
|
fprintf(stream, "build_number: %d\n", BUILD_NUMBER);
|
|
|
|
fprintf(stream, "cpu_has_arm_fma: %s\n", ggml_cpu_has_arm_fma() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_avx: %s\n", ggml_cpu_has_avx() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_avx2: %s\n", ggml_cpu_has_avx2() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_avx512: %s\n", ggml_cpu_has_avx512() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_avx512_vbmi: %s\n", ggml_cpu_has_avx512_vbmi() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_avx512_vnni: %s\n", ggml_cpu_has_avx512_vnni() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_blas: %s\n", ggml_cpu_has_blas() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_cublas: %s\n", ggml_cpu_has_cublas() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_clblast: %s\n", ggml_cpu_has_clblast() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_fma: %s\n", ggml_cpu_has_fma() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_gpublas: %s\n", ggml_cpu_has_gpublas() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_neon: %s\n", ggml_cpu_has_neon() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_f16c: %s\n", ggml_cpu_has_f16c() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_fp16_va: %s\n", ggml_cpu_has_fp16_va() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_wasm_simd: %s\n", ggml_cpu_has_wasm_simd() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_blas: %s\n", ggml_cpu_has_blas() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_sse3: %s\n", ggml_cpu_has_sse3() ? "true" : "false");
|
|
|
|
fprintf(stream, "cpu_has_vsx: %s\n", ggml_cpu_has_vsx() ? "true" : "false");
|
|
|
|
|
|
|
|
#ifdef NDEBUG
|
|
|
|
fprintf(stream, "debug: false\n");
|
|
|
|
#else
|
|
|
|
fprintf(stream, "debug: true\n");
|
|
|
|
#endif // NDEBUG
|
|
|
|
|
|
|
|
fprintf(stream, "model_desc: %s\n", model_desc);
|
|
|
|
fprintf(stream, "n_vocab: %d # output size of the final layer, 32001 for some models\n", llama_n_vocab(lctx));
|
|
|
|
|
|
|
|
#ifdef __OPTIMIZE__
|
|
|
|
fprintf(stream, "optimize: true\n");
|
|
|
|
#else
|
|
|
|
fprintf(stream, "optimize: false\n");
|
|
|
|
#endif // __OPTIMIZE__
|
|
|
|
|
|
|
|
fprintf(stream, "time: %s\n", timestamp.c_str());
|
|
|
|
|
|
|
|
fprintf(stream, "\n");
|
|
|
|
fprintf(stream, "###############\n");
|
|
|
|
fprintf(stream, "# User Inputs #\n");
|
|
|
|
fprintf(stream, "###############\n");
|
|
|
|
fprintf(stream, "\n");
|
|
|
|
|
|
|
|
fprintf(stream, "alias: %s # default: unknown\n", params.model_alias.c_str());
|
|
|
|
fprintf(stream, "batch_size: %d # default: 512\n", params.n_batch);
|
|
|
|
dump_string_yaml_multiline(stream, "cfg_negative_prompt", params.cfg_negative_prompt.c_str());
|
|
|
|
fprintf(stream, "cfg_scale: %f # default: 1.0\n", params.cfg_scale);
|
|
|
|
fprintf(stream, "chunks: %d # default: -1 (unlimited)\n", params.n_chunks);
|
|
|
|
fprintf(stream, "color: %s # default: false\n", params.use_color ? "true" : "false");
|
|
|
|
fprintf(stream, "ctx_size: %d # default: 512\n", params.n_ctx);
|
|
|
|
fprintf(stream, "escape: %s # default: false\n", params.escape ? "true" : "false");
|
|
|
|
fprintf(stream, "export: %s # default: false\n", params.export_cgraph ? "true" : "false");
|
|
|
|
fprintf(stream, "file: # never logged, see prompt instead. Can still be specified for input.\n");
|
|
|
|
fprintf(stream, "frequency_penalty: %f # default: 0.0 \n", params.frequency_penalty);
|
|
|
|
dump_string_yaml_multiline(stream, "grammar", params.grammar.c_str());
|
|
|
|
fprintf(stream, "grammar-file: # never logged, see grammar instead. Can still be specified for input.\n");
|
|
|
|
fprintf(stream, "hellaswag: %s # default: false\n", params.hellaswag ? "true" : "false");
|
2023-09-01 13:34:50 +00:00
|
|
|
fprintf(stream, "hellaswag_tasks: %zu # default: 400\n", params.hellaswag_tasks);
|
2023-08-28 15:59:39 +00:00
|
|
|
|
|
|
|
const auto logit_bias_eos = params.logit_bias.find(llama_token_eos(lctx));
|
|
|
|
const bool ignore_eos = logit_bias_eos != params.logit_bias.end() && logit_bias_eos->second == -INFINITY;
|
|
|
|
fprintf(stream, "ignore_eos: %s # default: false\n", ignore_eos ? "true" : "false");
|
|
|
|
|
|
|
|
dump_string_yaml_multiline(stream, "in_prefix", params.input_prefix.c_str());
|
|
|
|
fprintf(stream, "in_prefix_bos: %s # default: false\n", params.input_prefix_bos ? "true" : "false");
|
|
|
|
dump_string_yaml_multiline(stream, "in_suffix", params.input_prefix.c_str());
|
|
|
|
fprintf(stream, "instruct: %s # default: false\n", params.instruct ? "true" : "false");
|
|
|
|
fprintf(stream, "interactive: %s # default: false\n", params.interactive ? "true" : "false");
|
|
|
|
fprintf(stream, "interactive_first: %s # default: false\n", params.interactive_first ? "true" : "false");
|
|
|
|
fprintf(stream, "keep: %d # default: 0\n", params.n_keep);
|
|
|
|
fprintf(stream, "logdir: %s # default: unset (no logging)\n", params.logdir.c_str());
|
|
|
|
|
|
|
|
fprintf(stream, "logit_bias:\n");
|
|
|
|
for (std::pair<llama_token, float> lb : params.logit_bias) {
|
|
|
|
if (ignore_eos && lb.first == logit_bias_eos->first) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
fprintf(stream, " %d: %f", lb.first, lb.second);
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf(stream, "lora: %s\n", params.lora_adapter.c_str());
|
|
|
|
fprintf(stream, "lora_base: %s\n", params.lora_base.c_str());
|
|
|
|
fprintf(stream, "low_vram: %s # default: false\n", params.low_vram ? "true" : "false");
|
|
|
|
fprintf(stream, "main_gpu: %d # default: 0\n", params.main_gpu);
|
|
|
|
fprintf(stream, "memory_f32: %s # default: false\n", !params.memory_f16 ? "true" : "false");
|
|
|
|
fprintf(stream, "mirostat: %d # default: 0 (disabled)\n", params.mirostat);
|
|
|
|
fprintf(stream, "mirostat_ent: %f # default: 5.0\n", params.mirostat_tau);
|
|
|
|
fprintf(stream, "mirostat_lr: %f # default: 0.1\n", params.mirostat_eta);
|
|
|
|
fprintf(stream, "mlock: %s # default: false\n", params.use_mlock ? "true" : "false");
|
|
|
|
fprintf(stream, "model: %s # default: models/7B/ggml-model.bin\n", params.model.c_str());
|
2023-09-03 12:12:08 +00:00
|
|
|
fprintf(stream, "model_draft: %s # default:\n", params.model_draft.c_str());
|
2023-08-28 15:59:39 +00:00
|
|
|
fprintf(stream, "multiline_input: %s # default: false\n", params.multiline_input ? "true" : "false");
|
2023-09-04 19:26:24 +00:00
|
|
|
fprintf(stream, "n_gpu_layers: %d # default: -1\n", params.n_gpu_layers);
|
2023-08-28 15:59:39 +00:00
|
|
|
fprintf(stream, "n_predict: %d # default: -1 (unlimited)\n", params.n_predict);
|
|
|
|
fprintf(stream, "n_probs: %d # only used by server binary, default: 0\n", params.n_probs);
|
|
|
|
fprintf(stream, "no_mmap: %s # default: false\n", !params.use_mmap ? "true" : "false");
|
|
|
|
fprintf(stream, "no_mul_mat_q: %s # default: false\n", !params.mul_mat_q ? "true" : "false");
|
|
|
|
fprintf(stream, "no_penalize_nl: %s # default: false\n", !params.penalize_nl ? "true" : "false");
|
|
|
|
fprintf(stream, "numa: %s # default: false\n", params.numa ? "true" : "false");
|
|
|
|
fprintf(stream, "ppl_output_type: %d # default: 0\n", params.ppl_output_type);
|
|
|
|
fprintf(stream, "ppl_stride: %d # default: 0\n", params.ppl_stride);
|
|
|
|
fprintf(stream, "presence_penalty: %f # default: 0.0\n", params.presence_penalty);
|
|
|
|
dump_string_yaml_multiline(stream, "prompt", params.prompt.c_str());
|
|
|
|
fprintf(stream, "prompt_cache: %s\n", params.path_prompt_cache.c_str());
|
|
|
|
fprintf(stream, "prompt_cache_all: %s # default: false\n", params.prompt_cache_all ? "true" : "false");
|
|
|
|
fprintf(stream, "prompt_cache_ro: %s # default: false\n", params.prompt_cache_ro ? "true" : "false");
|
|
|
|
dump_vector_int_yaml(stream, "prompt_tokens", prompt_tokens);
|
|
|
|
fprintf(stream, "random_prompt: %s # default: false\n", params.random_prompt ? "true" : "false");
|
|
|
|
fprintf(stream, "repeat_penalty: %f # default: 1.1\n", params.repeat_penalty);
|
|
|
|
|
|
|
|
fprintf(stream, "reverse_prompt:\n");
|
|
|
|
for (std::string ap : params.antiprompt) {
|
|
|
|
size_t pos = 0;
|
|
|
|
while ((pos = ap.find('\n', pos)) != std::string::npos) {
|
|
|
|
ap.replace(pos, 1, "\\n");
|
|
|
|
pos += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf(stream, " - %s\n", ap.c_str());
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf(stream, "rope_freq_base: %f # default: 10000.0\n", params.rope_freq_base);
|
|
|
|
fprintf(stream, "rope_freq_scale: %f # default: 1.0\n", params.rope_freq_scale);
|
|
|
|
fprintf(stream, "seed: %d # default: -1 (random seed)\n", params.seed);
|
|
|
|
fprintf(stream, "simple_io: %s # default: false\n", params.simple_io ? "true" : "false");
|
|
|
|
fprintf(stream, "temp: %f # default: 0.8\n", params.temp);
|
|
|
|
|
|
|
|
const std::vector<float> tensor_split_vector(params.tensor_split, params.tensor_split + LLAMA_MAX_DEVICES);
|
|
|
|
dump_vector_float_yaml(stream, "tensor_split", tensor_split_vector);
|
|
|
|
|
|
|
|
fprintf(stream, "tfs: %f # default: 1.0\n", params.tfs_z);
|
|
|
|
fprintf(stream, "threads: %d # default: %d\n", params.n_threads, std::thread::hardware_concurrency());
|
|
|
|
fprintf(stream, "top_k: %d # default: 40\n", params.top_k);
|
|
|
|
fprintf(stream, "top_p: %f # default: 0.95\n", params.top_p);
|
|
|
|
fprintf(stream, "typical_p: %f # default: 1.0\n", params.typical_p);
|
|
|
|
fprintf(stream, "verbose_prompt: %s # default: false\n", params.verbose_prompt ? "true" : "false");
|
|
|
|
}
|