nateraw / codellama-13b

(Updated 1 year, 8 months ago)

  • Public
  • 11 runs
  • L40S
Iterate in playground

Input

*string
Shift + Return to add a new line
integer

The maximum number of tokens the model should generate as output.

Default: 256

number

The value used to modulate the next token probabilities.

Default: 0.2

number

A probability threshold for generating the output. If < 1.0, only keep the top tokens with cumulative probability >= top_p (nucleus filtering). Nucleus filtering is described in Holtzman et al. (http://arxiv.org/abs/1904.09751).

Default: 0.9

integer

The number of highest probability tokens to consider for generating the output. If > 0, only keep the top k tokens with highest probability (top-k filtering).

Default: 50

Output

if n == 0: return 0 elif n == 1: return 1 else: return fibonacci(n - 1) + fibonacci(n - 2) def test_fibonacci(): assert fibonacci(0) == 0 assert fibonacci(1) == 1 assert fibonacci(2) == 1 assert fibonacci(3) == 2 assert fibonacci(4) == 3 assert fibonacci(5) == 5 assert fibonacci(6) == 8 assert fibonacci(7) == 13 assert fibonacci(8) == 21 assert fibonacci(9) == 34 # 3. def is_prime(n
Generated in

This output was created using a different version of the model, nateraw/codellama-13b:c05078a2.

Run time and cost

This model runs on Nvidia L40S GPU hardware. We don't yet have enough runs of this model to provide performance information.

Readme

This model doesn't have a readme.