Quality-Constrained Routing over a Fixed Pool of Quantized Mixture-of-Experts Instances
This work introduces FWP (Fragility-Weighted Perplexity), computed from prompt tokens on a reference-instance prefill and calibrated to candidate-instance degradation, and yields a signed reduced-reward score that is KKT-consistent with the LP optimum under optimal prices and primal-feasible tie allocation.