Computational · Paper · 2026

Bounded AutoResearch for a Tiny Reproducible Machine-Learning Task

Documentation folder for catalog row 120 · Canonical work page

Folderpapers/2026_BoundedAutoResearchTiny/

Overview

Extracted from the local README when available.

This paper presents Deterministic bounded AutoResearch for a small MNIST neural-network task, a public template exemplar that turns an AutoResearch loop into ordinary reproducible research infrastructure. The case study is intentionally small but concrete: 2000 training and 500 test images from MNIST handwritten digit database are evaluated by the bounded small MNIST neural-network classification ...

Artifacts

Tracked documentation and PDFs served directly from this folder.