| name | calibration-algorithm-iteration |
| description | Iteration playbook for improving calibration and registration pipelines without losing baseline comparability. Use this when asked to optimize a calibration algorithm, propose next iterations, run ablations, or improve quality step by step rather than making a risky one-shot rewrite. |
Calibration Algorithm Iteration
Use this skill to improve calibration algorithms in controlled, evidence-backed steps.
When to use
Use this skill when the task involves:
- improving an existing calibration baseline
- planning iterative upgrades instead of a rewrite
- choosing among candidate enhancements
- refining one concrete hypothesis at a time
Use calibration-benchmark-and-ablation for multi-method comparisons and calibration-sota-upgrade for paper-driven method scouting.
Core policy
Iteration must be:
- Baseline-preserving
- keep the trusted baseline runnable and comparable
- Single-hypothesis
- change one major idea at a time
- Measurement-locked
- keep metrics and artifacts stable while iterating
- Failure-aware
- record when the change helps, hurts, or only shifts failure modes
The iteration loop
For each round, always produce:
- Hypothesis
- what is expected to improve and why
- Minimal change
- the smallest implementation that exercises the idea
- Comparison
- baseline vs candidate on the same inputs and outputs
- Failure review
- what new breakage or brittleness appeared
- Decision
- keep, revert, or gate behind an option
Preferred upgrade order
Prefer this ladder unless strong evidence says otherwise:
- Better data screening and sample weighting
- Better initialization or correspondence pruning
- Better robust loss and coarse-to-fine scheduling
- Better local refinement or bundle adjustment style solve
- Better global optimization or joint optimization
- More ambitious modeling assumptions such as continuous-time or learned priors
This order usually yields more reliable gains than jumping straight to a sophisticated optimizer.
Common upgrade levers
Good iteration ideas include:
- stricter acceptance gates for weak samples
- observability-aware sample selection
- robust loss tuning
- multi-stage initialization
- coarse-to-fine registration
- holdout-based early rejection
- better uncertainty or conditioning diagnostics
- explicit fallback from strong candidate to trusted baseline
LiDAR-to-LiDAR iteration order
For lidar2lidar, prefer this order:
- better window selection and scene sufficiency gating
- better pairing inside static windows
- better representative-transform or consensus selection across windows
- only then better local refinement or loop-closure optimization
- only after that, stronger initialization methods
If repeated reruns jump between distinct solution families, stop calling it convergence. Treat it as an observability or pairing problem and change the earlier stages first.
Required output
When proposing or reviewing an iteration, include:
- Current baseline
- Proposed change
- Expected upside
- Expected new failure modes
- Comparison plan
- Rollback or fallback rule
Reference canon
Use concrete references such as:
- Ceres Solver docs for iterative nonlinear optimization hygiene
- Kalibr for staged calibration rather than one-shot magic
- Open3D / PCL for coarse-to-fine registration pipelines
- TEASER++ for strong initialization under heavy outliers
- GICP and NDT literature for alternative refinement behavior
- continuous-time calibration papers when motion distortion or asynchronous sensing is the actual bottleneck
Anti-patterns
Avoid these iteration mistakes:
- replacing the baseline before the candidate wins repeatedly
- changing the optimizer and the metric at the same time
- merging several experimental ideas into one patch
- accepting a candidate because one demo looks better
- removing diagnostics to make the new method look cleaner
Output style
Present iterations as a ladder:
- Round N baseline
- Round N+1 candidate
- Expected gain
- Decision metric
- Abort condition
Make the next step obvious and falsifiable.