Add branded dataset card
Browse files
README.md
ADDED
|
@@ -0,0 +1,128 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: mit
|
| 3 |
+
pretty_name: "OpenWorld · Coding Worlds (World-Time Compute)"
|
| 4 |
+
task_categories:
|
| 5 |
+
- text-generation
|
| 6 |
+
- other
|
| 7 |
+
tags:
|
| 8 |
+
- world-models
|
| 9 |
+
- world-time-compute
|
| 10 |
+
- code-generation
|
| 11 |
+
- program-synthesis
|
| 12 |
+
- reproducibility
|
| 13 |
+
- synthetic
|
| 14 |
+
size_categories:
|
| 15 |
+
- n<1K
|
| 16 |
+
configs:
|
| 17 |
+
- config_name: default
|
| 18 |
+
data_files:
|
| 19 |
+
- split: train
|
| 20 |
+
path: sft_train.jsonl
|
| 21 |
+
- split: test
|
| 22 |
+
path: test_tasks.jsonl
|
| 23 |
+
- config_name: tasks
|
| 24 |
+
data_files: tasks.jsonl
|
| 25 |
+
language:
|
| 26 |
+
- en
|
| 27 |
+
---
|
| 28 |
+
|
| 29 |
+
# OpenWorld · Coding Worlds (World-Time Compute)
|
| 30 |
+
|
| 31 |
+
**A family of **verified coding worlds** — a function to implement plus a test-suite oracle — for the *world-time-compute* realism check: fine-tune on many worlds, generalize to held-out tasks (and HumanEval/MBPP).**
|
| 32 |
+
|
| 33 |
+
[](https://github.com/quome-cloud/openworld)
|
| 34 |
+
[](https://opensource.org/licenses/MIT)
|
| 35 |
+
[](https://github.com/quome-cloud/openworld)
|
| 36 |
+
[](#what-it-is)
|
| 37 |
+
|
| 38 |
+
## Load it
|
| 39 |
+
|
| 40 |
+
```python
|
| 41 |
+
from datasets import load_dataset
|
| 42 |
+
|
| 43 |
+
ds = load_dataset("Quome/openworld-coding") # sft train/test
|
| 44 |
+
# tasks = load_dataset("Quome/openworld-coding", "tasks") # all 219 verified tasks
|
| 45 |
+
```
|
| 46 |
+
|
| 47 |
+
---
|
| 48 |
+
|
| 49 |
+
A family of **verified coding worlds** — function-implementation tasks, each a world whose
|
| 50 |
+
**oracle is its test suite** — for the world-time-compute realism check on a *different* use
|
| 51 |
+
case than diagnosis (OpenWorld experiment E77; paper §"World-time compute").
|
| 52 |
+
|
| 53 |
+
## What it is
|
| 54 |
+
|
| 55 |
+
Each task is a tiny verified-code world: a function to implement (prompt = signature +
|
| 56 |
+
docstring) and a set of `assert`-based unit tests that define correctness. A solution is
|
| 57 |
+
"right" iff it passes **all** tests — the cleanest possible oracle (this is the
|
| 58 |
+
HumanEval/MBPP setup). The transferable skill is *coding*; held-out tasks measure
|
| 59 |
+
generalization.
|
| 60 |
+
|
| 61 |
+
## Provenance
|
| 62 |
+
|
| 63 |
+
Tasks are **LLM-authored** (Gemini 2.5 Flash) across 12 topics (strings, arrays, dicts,
|
| 64 |
+
math, recursion, sorting, parsing, matrices, intervals, stacks/queues, greedy, simple DP),
|
| 65 |
+
then **verified in a sandboxed subprocess** — the reference solution must pass its own tests
|
| 66 |
+
before the task is admitted (~58% of generated candidates passed verification and were
|
| 67 |
+
kept). This contrasts with the synthetic-parametric `openworld-diagnosis` family: here the
|
| 68 |
+
worlds are *authored by a model* (the "Claude-Code-style" realism check), and the oracle is
|
| 69 |
+
executable tests rather than a Bayes-optimal classifier.
|
| 70 |
+
|
| 71 |
+
## Contents (JSONL)
|
| 72 |
+
|
| 73 |
+
| File | Rows | Schema |
|
| 74 |
+
|---|---|---|
|
| 75 |
+
| `tasks.jsonl` | 219 | `{name, topic, prompt, solution, tests[]}` (all verified) |
|
| 76 |
+
| `sft_train.jsonl` | 164 | `{prompt, completion}` — `prompt` = instruction + signature/docstring; `completion` = reference solution |
|
| 77 |
+
| `test_tasks.jsonl` | 55 | `{id, prompt, tests[], kind}` — held-out tasks for pass@k |
|
| 78 |
+
|
| 79 |
+
Task-level (world-level) train/test split: the 55 test tasks are held out from fine-tuning.
|
| 80 |
+
|
| 81 |
+
## How to use
|
| 82 |
+
|
| 83 |
+
Fine-tune on `sft_train.jsonl`; evaluate **pass@1 / pass@k** on `test_tasks.jsonl` (run the
|
| 84 |
+
model's code against each task's `tests` in a sandbox). For real-benchmark transfer, also
|
| 85 |
+
evaluate on **HumanEval / MBPP** (fetched by `experiments/e77_gen.py`'s benchmark step;
|
| 86 |
+
adapters in `experiments/e77_eval.py`).
|
| 87 |
+
|
| 88 |
+
## Reproduce
|
| 89 |
+
|
| 90 |
+
```
|
| 91 |
+
python experiments/e77_gen.py # author + verify tasks (needs GEMINI_API_KEY in .env)
|
| 92 |
+
python experiments/e77_data.py # split + SFT
|
| 93 |
+
```
|
| 94 |
+
Generation uses an LLM, so the exact task set is not bit-reproducible (unlike the seeded
|
| 95 |
+
diagnosis family); the committed `tasks.jsonl` is the canonical set used in E77.
|
| 96 |
+
|
| 97 |
+
## Results (E77, paper §world-time compute)
|
| 98 |
+
|
| 99 |
+
`experiments/results/e77_coding.json`. Headline: world-time compute helps **in-domain
|
| 100 |
+
pass@k at every model size** (e.g. 7B pass@5 0.84→0.95) and transfers **positively to
|
| 101 |
+
HumanEval at pass@5** (7B 0.866→0.909) from just 164 worlds — though it *hurts* greedy
|
| 102 |
+
pass@1 on HumanEval. Consistent with E76's world-count law (more worlds → more gain), 164
|
| 103 |
+
is below the threshold where transfer becomes strong.
|
| 104 |
+
|
| 105 |
+
## License
|
| 106 |
+
|
| 107 |
+
MIT (same as the OpenWorld repository). Tasks/tests are LLM-generated; treated as synthetic.
|
| 108 |
+
|
| 109 |
+
|
| 110 |
+
---
|
| 111 |
+
|
| 112 |
+
## From the OpenWorld project
|
| 113 |
+
|
| 114 |
+
This dataset is produced by **OpenWorld** — a framework for *verified symbolic world models*, where a world's dynamics are explicit, auditable Python code (no training, no GPU). "World-time compute" is the idea that **traversing many verified worlds** of a domain and fine-tuning on that experience makes a model generalize to **unseen** worlds from fewer real examples.
|
| 115 |
+
|
| 116 |
+
- 💻 **Code, experiments & paper:** https://github.com/quome-cloud/openworld
|
| 117 |
+
|
| 118 |
+
## Citation
|
| 119 |
+
|
| 120 |
+
```bibtex
|
| 121 |
+
@software{openworld_coding_2026,
|
| 122 |
+
title = {OpenWorld · Coding Worlds (World-Time Compute)},
|
| 123 |
+
author = {Schwoebel, Jim},
|
| 124 |
+
year = {2026},
|
| 125 |
+
url = {https://github.com/quome-cloud/openworld},
|
| 126 |
+
note = {Hugging Face dataset: Quome/openworld-coding}
|
| 127 |
+
}
|
| 128 |
+
```
|