12

Class Activity: Designing a Multi-Objective Parameter Optimization Evaluation Plan

AI999第3课:现实世界的复杂性与多目标权衡
00:00

This page is aclass activity design: it turns thelift–dragpair of conflicting objectives into a reproducible, comparable multi-objective parameter optimization evaluation plan deliverable to expert decision-making. The point is not to have the model give a direct answer, but to design an evaluation mechanism that can be repeatedly tested — who takes part in the evaluation, which metrics are used, under what constraints and budget, and by what rules candidates are retained.

The activity simulates a closed loop:generate candidates → enter evaluation → compare benefits, costs, and constraints based on feedback → retain effective solutions → record and proceed to the next round. You need to propose a plan for a parameterized object (for example, airfoil parameters) and make the lift–drag trade-off explicitly visible in it — in a word, turn "conflict" into "executable review rules."

Multi-Objective Parameter Optimization Evaluation Plan: Lift–Drag Trade-off Closed LoopFor expert decision-making · Reproducible · IterableEvaluation Closed Loop (Six Steps)Six-step cycle: retain effective solutions and proceed to the next round1Parameter RepresentationParameter bounds and encoding2Candidate GenerationSampling · perturbation · crossover3Evaluation ComputationSurrogate evaluation and verification4Metric AggregationLift · drag · constraints5Solution ComparisonNon-dominance and reference points6Record ArchivingSeeds · budget · rationaleFeedback: retain effective candidatesObjectives and ConstraintsConflicting objectives listed separatelyObjective A: Maximize lift coefficientObjective B: Minimize drag coefficientAuxiliary metric: lift-to-drag ratio for interpretation onlyHard constraints: thickness, pitching moment rangeSoft preferences: cost and engineering manufacturabilityBudget: number of calls, time, and computeCandidate Distribution and Pareto FrontCover different trade-off regionsLiftHigher is betterDrag (lower is better)Pareto frontPareto front (retained)Dominated candidateOutput Candidate Set and Decision InterfaceRather than a single optimal solutionCandidate set covering different lift-drag trade-offsMetric evidence: lift and drag valuesConstraint satisfaction and soft preference annotationsUncertainty interval descriptionReference point or preference ranking interfaceTrade-off judgment left to domain expertsReproducible and Iterable RecordsDirectly inheritable by the next roundParameter representation and boundsMetric definitions and unitsDivision of hard constraints and soft preferencesEvaluation budget and actual number of callsRandom seeds and surrogate model versionSelection criteria and elimination rationaleTurn "conflict" into "executable review rules": retain a diverse set of candidates and leave the trade-off judgment to domain experts

Metrics, Constraints, and Budget

  • Lift objectivedefined as maximizing the lift coefficient or lift performance;drag objectivedefined as minimizing the drag coefficient or drag performance. These two are the original conflicting objectives and must each be listed independently.
  • Composite metrics: metrics such as the lift-to-drag ratio can be used for explanation and presentation, but they cannot replace the original conflicting objectives — otherwise the trade-off would be prematurely "flattened" by a single ratio.
  • Constraint tiering: parameter bounds and geometric and engineering constraints (such as relative thickness and pitching moment range) are usually set as hard constraints, and any violation leads to elimination; performance preferences and cost preferences are set as soft preferences for ranking.
  • Budget declaration: specify the number of simulation or surrogate model calls, time, and compute limits, and distinguish the quota for "surrogate evaluation" and "high-fidelity verification"; otherwise different plans cannot be compared fairly.

Evaluation Process and Candidate Generation

The evaluation closed loop is organized into six steps:parameter representation → candidate generation → evaluation computation → metric aggregation → solution comparison → record archiving. The candidate generation rules determine the coverage of the exploration: initial sampling spreads out globally, perturbation, crossover, and mutation handle local refinement, and preference guidance intensifies coverage in regions experts care about. Candidates are required to be distributed across different lift-drag trade-off regions, avoiding collapse of an entire generation into a single direction of "high lift" or "low drag."

Selection Rules and Output Candidate Set

Selection may use Pareto non-dominance, weighted sum, threshold filtering, reference points, or preference ranking. Whichever is chosen, the result should not be "keeping only the one with the highest total score": the output should be a set of candidates covering different trade-offs, accompanied by metric evidence, constraint satisfaction, differences among candidates, and uncertainty ranges, so that domain experts can judge whether the trade-offs are reasonable.

Common Pitfall
Combining lift and drag into a single total score and then taking the maximum may look simplifying, but in fact it uses the choice of weights to make the trade-off on the experts' behalf in advance and also loses candidate diversity. The correct approach is to retain multiple candidate groups and leave the decision of "which one to choose" to after the evaluation interface.

Deliverables

A one-page evaluation plan template: metrics table (including original objectives and auxiliary metrics), flowchart (six-step closed loop), candidate generation rules, selection rules, output candidate set, and risk and uncertainty notes. Also record parameters, metric definitions, evaluation budget, random seeds, selection criteria, and elimination rationale, so that the next round of exploration can inherit them directly.