Tune.Optimizers.MIPROv2 (Tune v0.5.0)

Copy Markdown View Source

Joint search over instructions and example sets.

  1. Example sets: per predictor, num_candidates choices: no demonstrations, then bootstrapped sets from the teacher role.
  2. Instructions: per predictor, the original instruction plus num_candidates - 1 proposals from the proposal role, grounded in the predictor's fields, training examples, and a bootstrapped demonstration.
  3. Search: a categorical TPE over <name>.instruction and <name>.demos. Each trial scores a training minibatch; minibatch observations guide the sampler but never become the returned program. Every minibatch_full_eval_steps trials, and at the end, the best unpromoted choice by mean minibatch score gets a full validation pass. Only full, complete, eligible validation results can become the incumbent.

The baseline (original instructions, no demonstrations) is evaluated on the full validation set first. Teacher, proposal, and target calls share one ceiling.

Options: :num_candidates (default 4), :num_trials (default 12), :minibatch_size (default 4), :minibatch_full_eval_steps (default 4), :n_startup (default 4), :evidence_examples (default 3), and BootstrapFewShot options (:accept_score required).

Differences from DSPy: minibatches come from training data; there is no automatic configuration preset, dataset summarizer, or program-code summary; proposals are grounded in the signature and examples.