Datasets:
File size: 2,544 Bytes
cd6c193 ce7eaa8 cd6c193 ce7eaa8 cd6c193 ce7eaa8 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 | ---
license: mit
task_categories:
- text-generation
language:
- en
tags:
- arithmetic
- integer-arithmetic
- lm-eval-harness
- base-models
- list-aggregates
pretty_name: Numeric Mini
size_categories:
- 1K<n<10K
configs:
- config_name: min
data_files:
- split: test
path: min/test-*
- config_name: max
data_files:
- split: test
path: max/test-*
- config_name: sum
data_files:
- split: test
path: sum/test-*
- config_name: count
data_files:
- split: test
path: count/test-*
- config_name: sort
data_files:
- split: test
path: sort/test-*
---
# numeric-mini
Fixed-NL-template integer aggregation over short lists. Built as
**tier 2** of the eval design in
[byte_v2/design/eval/design_v2.md](https://example.com) (internal).
The original spec called for sourcing these tasks from TreeAILab/NumericBench,
but NumericBench is MCQ-style with decimal operands and ability labels that
don't cleanly contain min/max/sum/count/sort over plain integer lists, so this
dataset is generated locally to match the spec's intent and the integer-only
constraint.
## Configs
| config | template | n_test |
|--------|----------|-------:|
| `min` | `What is the minimum of the list [...]?` | 200 |
| `max` | `What is the maximum of the list [...]?` | 200 |
| `sum` | `What is the sum of the list [...]?` | 200 |
| `count` | `How many times does X appear in the list [...]?` | 200 |
| `sort` | `After sorting the list [...] in ascending order, what is the K-th element?` | 200 |
## Construction
- List length **5**, operands sampled uniformly from `[10, 99]` (2-digit integers).
- `count`: target is drawn 50/50 from `{element of list, fresh integer not in list}`
to balance zero-count and positive-count cases.
- `sort`: K ∈ {1..5} uniform; the answer is the K-th element after ascending sort.
## Schema
| field | type | example | description |
|------------|------|---------|-------------|
| `list` | list[int] | `[59, 63, 15, 43, 75]` | the input list |
| `question` | str | `"What is the minimum of the list [59, 63, 15, 43, 75]?"` | prompt |
| `label` | int | `15` | gold answer (integer) |
| `target` | int | `71` | (count only) the value to count |
| `k` | int | `3` | (sort only) 1-indexed K |
| `ordinal` | str | `"third"` | (sort only) ordinal word for K |
## Usage
```python
from datasets import load_dataset
ds = load_dataset("cyanfi/numeric-mini", "sum", split="test")
print(ds[0])
```
|