AI & ML
Swiss-Knife: A Framework for Reconfigurable Externalised Multi-Objective Alignment at Decode Time
arXiv stat.ML0 views
arXiv:2609.22226v2 Announce Type: replace-cross Abstract: Decode-time alignment methods steer a frozen language model by scoring candidate continuations with an external reward and selecting the maximiser. We argue that this shared design is a single degenerate point in a much larger space. We introduce Swiss-Knife, a framework for externalised multi-objective alignment in which the alignment specification is a first-class runtime object: hot-swappable scoring blades, a batch normaliser, a pairwise aggregation operator, and a selection rule. Six axioms characterise the admissible aggregation operators, and we prove a representation theorem: every operator satisfying them has the form $R_i = \sum_{j \neq i} g((\mu_i - \mu_j)/s(\sigma_i,\sigma_j))$, a two-parameter family containing probit and logistic comparison rules and pointwise argmax as named coordinates. Within it, pairwise aggregation is Lipschitz-stable under adversarial reward contamination while argmax is not, and Candidate-Batch Normalization (CBN) makes the weight simplex invariant to the rescalings under which reward models are only ever identified. Our reference instantiation pairs DPO-LoRA blades with an uncertainty-aware pairwise tournament. Sweeping the helpfulness/honesty/harmlessness simplex, it attains the best balanced frontier of six decode-time methods (harmonic $F_1$ 0.797 vs. 0.750 for the strongest baseline, $p < 10^{-14}$) with the lowest refusal rate and highest helpfulness of any arm, and reconfigures its objectives in 0.05 ms with no gradient computation. Ablating CBN costs 0.217 $F_1$, and the metadata confirms the predicted mechanism: the lowest-variance blade retains 9% of its nominal 33% influence, and the collapse follows the predicted ordering.
Source:https://arxiv.org/abs/2609.22226PreviousBad Genius: Counterfactual-Guided Harness Evolution Beyond Task-Specific ShortcutsNextIQS-BO: In-Context Query Selection for Bayesian Optimisation
Related posts
AI Agent Observability: What to Log Before Production
0dev.to
AI Agent Evaluation: How to Test Workflows That Change Their Answers
0dev.to
paper-orchestra: A Multi-Agent Pipeline That Turns Experiment Logs Into LaTeX Submissions
0dev.to
Kerberos Through the HTTPS Tunnel: Pre-Auth Capture via the KDC Proxy
0dev.to
We checked 100 well-known sites for AI-crawler readiness: llms.txt, robots.txt, schema, sitemaps
0dev.to
We asked ChatGPT, Perplexity and Gemini which software to buy. Here's who they named first
0dev.to