Train from public recipes
Architecture, data preparation, objectives, and compute assumptions stay in versioned source rather than disappearing behind a final metric.
TabU-lab is a WeHub open research lab for building tabular foundation models from scratch. Every run begins with a falsifiable question and ends with enough provenance to reproduce, reject, or extend it.
The lab infrastructure exists. No public training result, model checkpoint, or benchmark claim has been accepted yet.
See the live ledger →“Open” means more than publishing a final checkpoint. The decisions that created it must remain visible enough for another researcher—or another agent—to audit and continue.
Architecture, data preparation, objectives, and compute assumptions stay in versioned source rather than disappearing behind a final metric.
Every idea first earns signal under an explicit budget. Scale is a later decision, not a substitute for understanding.
A killed hypothesis is a useful result when its protocol, logs, and boundary are clear. Silent dead ends teach nobody.
Marin shows the value of exposing the whole experiment lifecycle. TabU-lab adapts that idea to WeHub: a compact gate, an exact execution receipt, and an honest verdict before synthesis.
Write the hypothesis, baseline, budget, and pass / kill criterion before execution.
Commit the code and config that make the proposed comparison executable.
Record the command, seed, data provenance, environment, host, and compute used.
Publish raw metrics, curves, logs, artifacts, and anything that limits interpretation.
Mark pass, kill, or revise. Consolidate only what the receipt actually supports.
receipt.v0This page exposes the current state as it is. New cards appear only when a preregistration or receipt exists in the repository.
Repository layout, experiment receipt contract, and WeHub Research entrance are established.
The first training question will be named here only after its hypothesis and gate are committed.
These are invitation surfaces, not claims that the corresponding systems already exist.
Which synthetic or real-table distributions teach reusable structure without hiding test knowledge?
How should values, roles, missingness, units, and table structure become typed computational objects?
Which small-scale recipes produce stable learning signals before expensive scaling?
Which held-out tables, shifts, and negative controls can actually falsify the proposed mechanism?
The best contribution is not a large promise. It is a sharp hypothesis, a matched comparison, and a receipt that lets the next person continue.