skillopt
/skillopt
Uruchamia pętlę optymalizacji SkillOpt: epoki nad mini-partiami zadań z budżetem edycji malejącym według harmonogramu oraz bramką konsolidacji na koniec każdej epoki.
- Autor
- skillberry-ai ↗
- Repozytorium
- cap-evolve ↗
- Licencja
- Apache-2.0
- Ostatnia zmiana repozytorium
- 25.10.2026
Ocena i bezpieczeństwo
- Pliki w paczce
- 7
- Skrypty
- 4
- Komentarze HTML
- 0
- Adresy URL w SKILL.md
- 0
Brak sygnałów. Repozytorium zmienione 25.10.2026, bez odwołań do wycofanych modeli i API.
Apache-2.0, otwarta: można używać i zmieniać, z zachowaniem licencji i informacji o zmianach.
- 4 skrypty w paczce. Przejrzyj je przed instalacją, bo Claude może je uruchomić.
Skrypty: scripts/_bootstrap.py, scripts/abstract.py, scripts/check.py, scripts/run.py
Co robi i kiedy
Uruchamia pętlę optymalizacji SkillOpt: epoki nad mini-partiami zadań z budżetem edycji malejącym według harmonogramu oraz bramką konsolidacji na koniec każdej epoki.
Wyzwalacze z opisu
Argumenty
/skillopt --run-dir DIR --project DIR --optimizer CMD [--epochs 4] [--batch-size N] [--accumulation 1] [--edit-budget 4] [--min-ed
Oryginalny opis (EN)
Runs the SkillOpt single-lineage optimization loop, which organizes a hill-climb into epochs over mini-batches of train tasks under a textual learning rate — an integer edit budget that decays on a constant|linear|cosine schedule — and ends each epoch with one extra gated consolidation step. Parent is always the current best; acceptance is the val significance gate. Use when a run should anneal from broad early edits to small late ones and consolidate once per epoch, rather than hill-climb's one-shot whole-trainset proposals or gepa's Pareto frontier.
Jak działa
- What SkillOpt does differently
- The textual learning rate, stated without the analogy
- Known gaps
- Key flags
- References
Podgląd SKILL.md
---
name: skillopt
description: Runs the SkillOpt single-lineage optimization loop, which organizes a hill-climb into epochs over mini-batches of train tasks under a textual learning rate — an integer edit budget that decays on a constant|linear|cosine schedule — and ends each epoch with one extra gated consolidation step. Parent is always the current best; acceptance is the val significance gate. Use when a run should anneal from broad early edits to small late ones and consolidate once per epoch, rather than hill-climb's one-shot whole-trainset proposals or gepa's Pareto frontier.
component: algorithm
argument-hint: "--run-dir DIR --project DIR --optimizer CMD [--epochs 4] [--batch-size N] [--accumulation 1] [--edit-budget 4] [--min-edit-budget 2] [--lr-schedule cosine] [--no-slow-update]"
allowed-tools: Read, Write, Bash
provides: [candidate]
needs: [scores, traces, candidate]
---
# skillopt — annealed single-lineage climb (epochs × mini-batches)
SkillOpt (arXiv:2605.23904, *Executive Strategy for Self-Evolving Agent Skills*)
organizes a hill-climb into **epochs × mini-batches** under a decaying integer
**edit budget**. The name is the paper's; the algorithm edits whatever the
selected capability owns — a prompt, a tool surface, a skill package — and never
assumes which.
**Read the shared step first**, then this file. Parent materialization, the
optimizer call, the val evaluation, the significance gate, accept/reject,
snapshot/best, the memory and handover files: all of that is
`harness.run_step`, documented once in `algorithms/hill-climb/SKILL.md`
§ "One iteration, end to end" and `algorithms/hill-climb/references/run-step.md`.
This file states only what SkillOpt does differently.
Know the bound before reaching for this algorithm: **`run_step` lets a caller
vary exactly two things — `parent_dir` and `instructions`.** SkillOpt pins
`parent_dir` to the current best, identical to hill-climb, so everything novel
lives in the `instructions` string plus the choice to run one extra step per
epoch. It is prompt shaping and step scheduling, not a different search.
## What SkillOpt does differently
1. **A decaying integer edit budget `L`.** `lr_schedule.build_schedule` emits one
integer per step over `constant | linear | cosine`, clamped to
`[--min-edit-budget, --edit-budget]` (`core/cap_evolve/lr_schedule.py:42-55`).
`L` is stated to the optimizer in prose — "at most L bounded edits" — and is
never mechanically enforced. See the next section before you tune it.
2. **A per-epoch rejected-edit list.** Each reject appends its candidate id and
val Δ, and the next step's prompt asks the optimizer to avoid them
(`skillopt.py:120-125`, `:330-335`). It carries no description of *what* the
rejected edit changed, so treat it as a weak signal — the run-global
`LEDGER.md` that `run_step` already injects names the tasks each prior edit
broke and fixed, which is strictly more useful.
3. **One extra gated step per epoch boundary** (from epoch 2). It compares the
epoch-start candidate against the current best, buckets tasks as
regressed / persistent-failure / stable-success, and asks for a consolidating
edit that fixes regressions without breaking the stable passes. It goes
through the same `run_step` and the same val gate — it is never
force-accepted (`skillopt.py:493-499`). Disable with `--no-slow-update`.
A fourth bucket, `improved`, is computed and logged but is *not* exclusive
with the others and never reaches the prompt (`skillopt.py:184-191`, `:139-166`).
Epochs shuffle the train ids seeded by epoch number, so a rerun is reproducible.
`steps_per_epoch = ceil(len(train) / (batch_size × accumulation))`.
## The textual learning rate, stated without the analogy
The knob is real: `L` decays, it is an integer, and the schedules are correct.
The *justification* is weaker than the ML vocabulary implies, and pretending
otherwise would mislead anyone tuning it.
What plausibly holds: the gate accepts or rejects a whole candidate. A candidate
bundling six edits where five help and one hurts is rejected entirely, and you
learn nothing about which edit was the problem. Fewer edits per candidate means
an accepted candidate is more likely to contain only good edits and a rejected
one is cheaper to attribute and revert. That argues for small edits — it does not
by itself argue for *decay*.
What does not transfer: in SGD, LR decay exists because nothing stops a large
step from overshooting near an optimum. Here the val significance gate already
rejects an overshooting edit before it can become the parent. The overshoot
protection is the gate, so the decay is not doing that job.
What is unmeasured: no ablation in this repo isolates the schedule's effect.
At realistic step counts the choice barely exists — over 12 steps from 4 down
to 2, `linear` and `cosine` differ at 2 of 12 positions. Prefer `constant` or
`linear` and spend your tuning budget on `--n-trials` and the gate instead. This
is a heuristic that has not been isolated; do not present it as a proven one.
## Known gaps
These are shipped-behavior defects in `core/cap_evolve/skillopt.py`. The skill
describes what the code does today, not what it intends to do. Line numbers are
against current `main` — check them; if one no longer says what it is cited for,
the gap has moved and this section is what needs re-deriving.
- **The mini-batch never reaches the optimizer** (issue #371). Mini-batch ids come
from **train** (`skillopt.py:237`, sliced at `:291`) but are handed to
`ctx.instructions` (`:300`) to filter the parent's **val** rows
(`harness.py:2270-2272`; the same train-vs-val mismatch at `:323`, `:327`), and
splits are disjoint slices (`splits.py:117-119`). So the focus summary always
renders `0 solid / 0 flaky / 0 failing of 0 focused task(s) of N on val`, the
failure index is empty, and `## Failure patterns still unsolved` never appears —
while the `(mini-batch of N train tasks, L=…)` label still prints, which is why it
looked healthy. (The whole-val protect-these-ids block *is* populated, from
`harness.py:2279` — that is the only per-task content a step gets, and #391 added
the `of N on val` scope precisely so those two numbers stop contradicting each
other.) Until #371 lands the per-step signal is the label plus the `L` sentence, so
the epoch/mini-batch structure is bookkeeping rather than focus. PR #370 fixed the
same defect in hill-climb's `cyclic`/`hardest-first` modes.
- **The epoch-boundary re-evaluation scores the whole train split, not a sample.**
`skillopt.py:467-472` calls `evaluate_candidate(..., split="train")` twice with
no `ids=`, then discards everything outside the ~20 sampled ids
(`:473-475`). Budget it as `2 × len(train) × n_trials` rollouts per boundary.
- **When an epoch accepted nothing, the comparison is vacuous.** The re-eval is
guarded by `prev_epoch_best_id != run_dir.best_id` (`skillopt.py:464`); if
nothing moved, both sides stay `current_val` — the same list — so 0 regressed
and 0 improved are reported over **val** tasks while the log line claims a
train sample size (`:478-482`). The consolidation step still runs.
- **`requested_edits` vs `applied_changes` surfaces nothing, and the number is wrong.**
`_changed_components` (`skillopt.py:406-435`) counts files whose bytes differ, not
edits, and `applied_changes` is written at `:346`/`:353` and read nowhere — no
dashboard column, no check, no warning. It also over-counts, because its ignore
list (`:420`) matches seven `.md` **basenames** while `run_step` injects a whole
read-context — `guidance/`, `trajectories/`, `prior_iterations/*/diff.patch` — that
`_SNAPSHOT_IGNORE` keeps *out* of the parent snapshot, so every injected file reads
as an applied edit. Measured zero-API on `examples/toy_calc` at `L=4`: a step whose
optimizer edited exactly one file logged `applied_changes: 10` (9 injected + 1
real), and the next step logged `10` again with the capability file **byte-identical
to its parent**. The metric has no zero, so it cannot detect the one thing it exists
to detect: an optimizer that made no edit at all.
- **"skill" leaks into the live prompt.** `skillopt.py:147` tells the optimizer to
compare "the skill" regardless of which capability is under optimization. An
algorithm must be capability-agnostic; this text is not.
## Key flags
`--epochs`, `--batch-size`, `--accumulation` (mini-batches per step; multiplies
the effective batch), `--edit-budget` / `--min-edit-budget` / `--lr-schedule`,
`--slow-update-sample`, `--no-slow-update`. `--resume`, `--no-regression`,
`--n-trials`, `--workers`, `--gate-mode`, `--k-se`, `--protected-paths`,
`--store` behave as in hill-climb.
`--max-iterations` is accepted and **ignored** — the loop is epoch-driven, so
`cap-evolve run`'s iteration cap has no effect here (`scripts/run.py:42-43`, whose
help text now says so). Control the step count with `--epochs`/`--batch-size`.
```bash
python scripts/run.py --run-dir .capevolve/run_X --project .capevolve/project \
--optimizer 'python .../run-optimizer/scripts/run.py --name mock --workdir {workdir} --prompt {prompt}' \
--epochs 4 --batch-size 8 --accumulation 1 \
--edit-budget 4 --lr-schedule linear --min-edit-budget 2 --n-trials 4
```
Requires `baseline.json` first, like its sibling algorithms.
## References
- `references/concepts.md` — the loop step by step, the schedule shapes with
worked values, and the buffer / consolidation mechanics. Load it when you need
to change the loop or reason about its rollout cost, not to run it.
Pliki w paczce (7)
- SKILL.md 9 KB
- meta.yaml 1 KB
- references/concepts.md 7 KB
- scripts/_bootstrap.py 4 KB
- scripts/abstract.py 1 KB
- scripts/check.py 6 KB
- scripts/run.py 7 KB
Wersje
| Repozytorium | Wynik | Licencja |
|---|---|---|
| Ta strona · skillberry-ai/cap-evolve | 100 | Apache-2.0 |
| rjmurillo/ai-agents | 100 | MIT |
| rjmurillo/ai-agents | 100 | MIT |
Migawka bazy z 13.11.2026 · wersja paczki 09d4ad111e75 (skrót SHA-256 całej paczki)
Pobrania w ostatnich 30 dniach: 0 · ranking
Zgłoś problem z tym skillem: szkodliwa treść, błędny opis albo prośba autora o usunięcie.
Podobne skille
- 100gepa
Uruchamia pętlę optymalizacji GEPA (arXiv:2507.19457): refleksyjne przeszukiwanie Pareto z tanią bramką na minibatchu przed kosztowną ewaluacją walidacyjną. - 90skillopt-setup
Instaluje i konfiguruje Microsoft SkillOpt do optymalizacji skilli: podziały ewaluacyjne, Codex CLI i import zmian. - 95Optimize
Prowadzi autonomiczną pętlę optymalizacji metodą hill-climb dla kodu z metrykami oraz dla skilli, promptów i agentów z oceną przez LLM-as-judge, na przykład przy redukcji opóźnień. - 100agent-optimize
Realizuje swobodny algorytm optymalizacji dla trybu orkiestracji agentowej: czyta digest, proponuje spójne zmiany możliwości względem hipotez awarii, promuje lub odcina gałęzie i raz pieczętuje test. - 100skillopt-sleep
Pozwala agentowi dsh uczyć się z dotychczasowego użycia w nocnym cyklu „sleep”, konsolidować skille i pamięć oraz planować optymalizację w tle przez narzędzia skillopt. - 100skillopt-sleep
Uruchamia nocny cykl samodoskonalenia agenta na podstawie minionych sesji, konsolidując pamięć i skille.