Download README.md from BurnyCoder/eureka-digits-sonnet-models: direct link, hf CLI and curl.
- Browser
- Download file 4.7 kB
-
https://huggingface.co/BurnyCoder/eureka-digits-sonnet-models/resolve/main/README.md
- Command line
-
hf download hf://BurnyCoder/eureka-digits-sonnet-models/README.md
-
curl -L -o README.md https://huggingface.co/BurnyCoder/eureka-digits-sonnet-models/resolve/main/README.md
tags:
- reproducibility
eureka-digits-sonnet
Experimental checkpoints. Input definitions, preprocessing and usage limitations are specified by the registered protocol and reproduction guide.
| Experiment | Method | Seed | Split | Accuracy | Seconds | Device |
|---|---|---|---|---|---|---|
| class_prior_s0 | class_prior | 0 | test | 0.102778 | 0.030 | cpu |
| logistic_s0 | logistic | 0 | test | 0.955556 | 0.124 | cpu |
| pilot_regularized_s0 | regularized | 0 | validation | 0.966574 | 8.906 | cuda |
| regularized_s0 | regularized | 0 | test | 0.963889 | 0.266 | cuda |
| regularized_s1 | regularized | 1 | test | 0.969444 | 6.516 | cuda |
| regularized_s2 | regularized | 2 | test | 0.969444 | 2.524 | cuda |
| sensitivity_s0 | sensitivity | 0 | test | 0.963889 | 2.625 | cuda |
| sensitivity_s1 | sensitivity | 1 | test | 0.969444 | 2.594 | cuda |
| sensitivity_s2 | sensitivity | 2 | test | 0.969444 | 2.621 | cuda |
| shuffled_labels_s0 | shuffled_labels | 0 | test | 0.061111 | 2.660 | cuda |
| shuffled_labels_s1 | shuffled_labels | 1 | test | 0.116667 | 2.385 | cuda |
| shuffled_labels_s2 | shuffled_labels | 2 | test | 0.108333 | 2.384 | cuda |
| unregularized_s0 | unregularized | 0 | test | 0.963889 | 2.455 | cuda |
| unregularized_s1 | unregularized | 1 | test | 0.969444 | 2.447 | cuda |
| unregularized_s2 | unregularized | 2 | test | 0.969444 | 2.443 | cuda |
The mean paired accuracy difference is 0.000000, with conditional 95% bootstrap interval [0.000000, 0.000000]. The registered decision is inconclusive. The sample standard deviation across seed effects is 0.000000. The interval uses 10000 paired resamples of test examples and conditions on the trained models.
analysis_kind: "exploratory"
prior_results_known: true
objective: "Replicate a known fixed study to evaluate engineering completion; do not claim new scientific confirmation."
question: "Does AdamW weight decay improve held-out accuracy of a small MLP on the bundled digits data?"
architecture: [64, 128, 10]
optimizer: "AdamW"
learning_rate: 0.001
batch_size: 64
epochs: 50
methods: ["regularized", "unregularized", "sensitivity", "shuffled_labels", "logistic", "class_prior"]
seeds: [0, 1, 2]
data_boundaries: "Frozen stratified 60/20/20 train/validation/test partition. Split seed 42. Divide pixels by the documented constant 16. Pilot reports validation only. No learned preprocessing or selection uses test data. Generalization is limited to this random example split, not new writers or datasets. Prior results on this evaluation set are known. All replication observations and conclusions are exploratory; no untouched-data claim is made."
analysis_plan: "Use 10000 paired bootstrap resamples of test example indices with RNG seed 2026, preserving pairing across methods and all trained seeds. This interval conditions on the trained models and does not estimate training-population uncertainty. Separately show each seed effect and its sample standard deviation. Treat other comparisons as descriptive, with no post-hoc primary selection."
hyperparameter_rationale: "Small prespecified network and fixed training budget provide fast feedback on an established task. The three decay values are a descriptive local sensitivity check, not a test-selected sweep. Three seeds expose limited initialization sensitivity; they do not support broad population claims."
src-adamw-doc: PyTorch torch.optim.AdamW documentation (2.15)
src-adamw-paper: Loshchilov & Hutter, Decoupled Weight Decay Regularization (ICLR 2019)
src-uci-digits: UCI Optical Recognition of Handwritten Digits (Alpaydin & Kaynak)
src-nanda-sequence: Neel Nanda, research process sequence (Alignment Forum)
src-lones-pitfalls: Lones, How to avoid machine learning pitfalls: a guide for academic researchers