autoresearch

Automate iterative ML hyperparameter and architecture search to minimize validation bpb.

Updated Aug 23, 2026
One-click install
npx skills add https://github.com/paulinett1508-dev/SuperCartolaManagerv5-production --skill autoresearch-paulinett1508-dev
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: autoresearch
Source: https://github.com/paulinett1508-dev/SuperCartolaManagerv5-production/tree/main/.claude/skills/autoresearch
Command: npx skills add https://github.com/paulinett1508-dev/SuperCartolaManagerv5-production --skill autoresearch-paulinett1508-dev

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

It helps teams explore model and training improvements faster by letting an LLM-driven agent run repeated, time-bounded experiments and keep only the changes that improve the target metric.

Core Features & Use Cases

  • Single-GPU, fixed-budget training loop: Runs train.py for a deterministic wall-clock budget (~5 minutes) and evaluates using the ground-truth metric.
  • Autonomous branch-based iteration: Creates and advances dedicated experiment branches, resetting/discarding when results do not improve.
  • Metric-first decision making: Optimizes for the lowest val_bpb with a strict logging format to results.tsv.

Quick Start

Instruct the agent to start the first baseline run by creating a fresh branch tagged with today’s date (for example, autoresearch/mar5) and then run training to record the baseline val_bpb.

Frequently Asked Questions about autoresearch

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I automate hyperparameter tuning for single-GPU ML experiments?

Automating hyperparameter tuning for single-GPU ML experiments requires running a fixed 5-minute training budget on `train.py` and evaluating validation bpb to determine if changes should be kept. This approach uses branch-based iteration to advance improvements and discard runs that do not enhance the target metric.

Can I use branch-based iteration to manage ML architecture search?

Branch-based iteration can manage ML architecture search by creating dedicated experiment branches tagged by date, running training, and resetting or discarding branches when results fail to improve validation bpb. This mechanism ensures only beneficial architecture modifications are retained in the workflow.

What is the best way to optimize val_bpb during short ML research cycles?

Optimizing val_bpb during short ML research cycles is best achieved through autonomous metric-first decision making that logs results strictly to `results.tsv`. The system evaluates ground-truth metrics after a deterministic wall-clock budget and keeps only changes that yield the lowest validation bpb.

Do I need a fixed evaluation harness to run autonomous ML research experiments?

A fixed evaluation harness is required to run autonomous ML research experiments because the system minimizes validation bpb against a consistent baseline. It enforces strict edit constraints on in-scope files and logs peak memory fields alongside the target metric for accurate comparisons.

What are the limitations of using a 5-minute training budget for ML experimentation?

A 5-minute training budget limits ML experimentation to short, single-GPU research cycles where rapid feedback is prioritized over long-running convergence. It applies strictly to scenarios where only training code is editable and requires strict edit constraints on in-scope files to prevent uncontrolled modifications.