IterationTracePoint

data class IterationTracePoint(val iteration: Int, val cumulativeReplications: Int, val bestPenalizedObjective: Double, val solverState: Map<String, Double> = emptyMap())(source)

One point of a cell's iteration trace: the solver's progress at the end of an iteration, recorded when the experiment captures traces. Iteration 0 is the initialized state before the first main iteration.

Parameters

iteration

the solver's iteration counter at the snapshot

cumulativeReplications

the solver's cumulative requested replications at the snapshot — the x-axis for budget-normalized convergence plots

bestPenalizedObjective

the penalized objective (minimization-oriented) of the best solution found so far

solverState

the solver's algorithm-specific state at the snapshot, keyed by the names the solver chose — a swarm's diameter, a population's diversity, a reference distribution's coefficient of variation. These are the direct measurements of premature convergence, and the solvers emit them every iteration whether or not anyone records them. Empty unless the experiment captured solver state, and for solvers that publish none.

Constructors

Link copied to clipboard
constructor(iteration: Int, cumulativeReplications: Int, bestPenalizedObjective: Double, solverState: Map<String, Double> = emptyMap())

Properties

Link copied to clipboard
Link copied to clipboard
Link copied to clipboard
Link copied to clipboard