P
Physics World Model
← All principles

Optimal Experimental Design L1-500

OptimizationInformation-theoretic designδ=5 · challengingL_DAG = 2.8📋 Stub — not mineable
📋

Unclaimed Principle — open for contribution

This Principle is declared in the catalog but has no reference solver, no pinned dataset, and is not registered on-chain. There is no reward pool. Submitting a cert against this Principle today will record the cert for reproducibility but pay zero PWM.

To claim it as a Bounty #7 contribution: open a PR adding (1) a reference solver, (2) ≥1 dataset pinned to IPFS, (3) updates to the L3 manifest with dataset CIDs. After verifier-agent triple-review, the founders' 3-of-5 multisig signs PWMRegistry.register() and the Principle becomes mineable.

Forward model E

Optimal Experimental Design: Optimal experimental design: choose experiment conditions xi to maximize information content (Fisher information) about parameters theta. The forward operator produces the measurement through a 3-node primitive DAG (M.fisher.information…); recovery is posed as a nonlinear_inverse problem. Difficulty tier delta=5 with effective condition number kappa_eff~50; prior_parameter_uncertainty, model_misspecification_level set the accuracy floor at the Omega boundary. See the forward_model field for the closed-form equation.

L-DAG

O.regularize -> O.d_optimality.criterion -> S.gradient.update
O.regularizeO.d_optimality.criterionS.gradient.update

Well-posedness W

Existence:
true
Uniqueness:
true
Stability:
conditional
κ:
1000

Existence of the recovered experiment_design_vector is guaranteed within the declared Omega bounds. Uniqueness holds on the measurement-supported subspace; out-of-support modes are controlled by declared priors. Stability is conditionally stable (kappa_eff ~= 50); prior_parameter_uncertainty dominates the stability cliff; the remaining mismatch parameters contribute higher-order bias terms. Gaussian sets the irreducible data-fidelity floor.

Solvability C

Solver class:
classical [convex_relaxation (SDP) or sequential_exchange_algorithm]
Convergence rate q:
2
Complexity:
O(p ** 3 * N_candidates) for FIM computation per design point per iteration

Specs (0)

No L2 specs registered yet for this principle.