optimize

Manages candidate briefs, optimization frontiers, and branch promotion for algorithm-first research quests.

Updated Apr 1, 2026
One-click install
npx skills add https://github.com/zniihgnexy/vid_tokenizer --skill optimize-zniihgnexy
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: optimize
Source: https://github.com/zniihgnexy/vid_tokenizer/tree/main/.ds/codex-home/skills/deepscientist-optimize
Command: npx skills add https://github.com/zniihgnexy/vid_tokenizer --skill optimize-zniihgnexy

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve? Algorithm-first research quests often drift into unfocused tinkering, premature branch creation, or paper-writing work before the optimization search is properly managed. This Skill imposes a disciplined control layer that turns loose ideas into ranked candidate briefs, promotes only the strongest directions into durable lines, and routes each pass toward explore, exploit, fusion, debug, or stop based on evidence. ## Core Features & Use Cases - Candidate Brief Management: Shapes fuzzy directions into structured briefs covering bottleneck, mechanism, expected gain, and risks, then ranks them on one explicit comparison surface before promotion. - Frontier-Driven Routing: Recovers the optimization frontier via artifact and memory calls, then selects exactly one dominant next action per pass across six internal submodes (brief, rank, seed, loop, fusion, debug). - Durable Record Keeping: Maintains OPTIMIZE_CHECKLIST.md and CANDIDATE_BOARD.md as quest-visible control files, and records every candidate, result, and route decision through artifact and memory APIs. - Use Case: A researcher has three plausible ways to improve a model's training pipeline. The Skill generates differentiated briefs, ranks them, promotes the top one into a durable line with its own worktree, seeds bounded smoke candidates, and records measured results before deciding the next route. ## Quick Start Ask the agent to run an optimize pass on the current quest by refreshing the optimization frontier, ranking existing candidate briefs, and recommending the single strongest line to promote next.

Frequently Asked Questions about optimize

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

FAQPage Schema
How do I manage multiple optimization candidates in a research quest?▼

Create branchless candidate briefs with submission_mode='candidate', rank them on one shared comparison surface, and promote only the top 1-3 into durable lines. Track everything in CANDIDATE_BOARD.md with status, expected gain, and observed result.

What is the difference between a candidate brief and a durable optimization line?▼

A candidate brief is a branchless method-level proposal recorded for later ranking. A durable line is a promoted direction that opens a real branch/worktree and becomes a formal optimization path with its own implementation candidate pool.

When should I use the optimize stage instead of the default research loop?▼

Use it when the quest is algorithm-first, the baseline gate is confirmed or waived, and at least one plausible optimization direction exists. Do not use it when the main need is a paper draft, rebuttal, or unresolved baseline.

How does the skill decide between explore, exploit, fusion, and debug?▼

It reads the optimization frontier first, then applies heuristics: explore when no line dominates, exploit when one line clearly leads, fusion when two lines have complementary strengths, and debug when a valuable candidate failed for a fixable reason.

Why does the optimize skill require bash_exec for all terminal commands?▼

The skill mandates bash_exec so smoke checks, long runs, Git operations, and validations share one managed session model. This enables detached long runs, log inspection before retries, and prevents duplicate processes for the same purpose.

What are the limitations of the optimize stage?▼

It does not replace the normal quest runtime and does not handle paper-outline, bundle, or finalize work. It also requires the artifact and memory MCP surfaces to be available, and it defers substantial implementation to the experiment stage.