a-comparison-you-never-run-defaults-to-your-preference

Solid

Use at hypothesis drafting, study design and implementation when the task could plausibly be attacked by more than one family of method - hand-built features fed to a fitted model, a network trained on the raw structure or sequence, a pretrained backbone, retrieval - and your hypothesis list mostly compares variants inside one of them. Covers separating the hypotheses that would change what you build from the ones that would change an argument, requiring code on both sides of a family claim, running the comparison at a budget you actually have and reading each side's slope rather than its level, and demoting a comparison you will not run into a priced assumption.

AI & Automation 805 stars 25 forks Updated 2 weeks ago NOASSERTION

Install

View on GitHub

Quality Score: 82/100

Stars 20%
97
Recency 20%
90
Frontmatter 20%
70
Documentation 15%
100
Issue Health 10%
80
License 10%
100
Description 5%
100

Skill Content

# The hypothesis that chooses the method family runs first, at full budget Most hypotheses a run registers are internal to a method it has already picked: which feature block, which parameterisation, which form of the correction term. One or two decide something larger — which *family* the run is in. Those are the only ones whose refutation would change what gets built, and they are reliably the ones that do not get resolved, because they are the most expensive and they sit at the end of the queue. An unrun comparison is not neutral. **It resolves, silently, in favour of whatever you were already doing.** ## What the failure looks like from inside It does not look like ignorance, and it does not look like laziness. It looks like careful measurement, taken at the wrong size. One run's literature stage tabulated the published ladder honestly: the best number from the family it did not choose was 0.022, the best from the family it did was 0.044 — two to one. That finding entered the hypothesis document once, as H6: *at a matched CPU budget the descriptor route reaches a lower fold error than a message-passing network trained from the same coordinates.* The words naming that rival family then occur **zero times in the 16 KB study design**. The run did not ignore it. It measured it twice: - At **09:05** a cost pilot timed a real step of the rival family: 106.5 s per epoch on 100,831 molecules, on the three cores it had. Six hours of clock remained — about **200 epochs**...

Details

Author
tangxiangru
Repository
tangxiangru/AutoR
Created
6 months ago
Last Updated
2 weeks ago
Language
Python
License
NOASSERTION

Integrates with

Similar Skills

Semantically similar based on skill content — not just same category

AI & Automation Solid

cost-the-rung-you-need-not-the-cheapest-one-in-the-family

Use at literature survey, hypothesis generation and study design of a task that hands you a training split and an unlabelled test split, scores predictions by a fixed error metric, and has published best numbers for that dataset and metric, when you are about to decide that the kind of model behind those numbers does not fit your clock. Covers which rung of the ladder is worth timing at all, replacing "hours to finish the reference schedule" with "epochs until this passes what I already have", and pricing the first member of another family before the Nth member of this one.

805 Updated 2 weeks ago
tangxiangru
AI & Automation Solid

chemistry-accuracy-and-cost-for-every-module-you-swap-in

Use at study design, through experimentation and again at analysis when the method under test is a drop-in replacement for a standard layer — a different basis, kernel, activation family or transform — and the source claims the replacement is both more accurate and cheaper. Covers giving every alternative module a cell in the accuracy column and in the cost column, fixing one matching convention across both, and dividing the runtime by the invariant already sitting in your own results file before you publish a contradiction of the source's ratio.

805 Updated 2 weeks ago
tangxiangru
AI & Automation Listed

math-equal-effort-baselines-and-knob-sweeps

Use at study design when the source names competing algorithms and they are about to become a related-work paragraph instead of arms. Covers running every named baseline at equal tuning effort, and sweeping the parameter you claim credit for.

805 Updated 2 weeks ago
tangxiangru