SearcharxivSearch

arXiv subjects

Vili Kohonen

Publications and source records attributed to Vili Kohonen.

4 recordsLinked to original sources

Inoculation Adapters: Improved Selective Generalization of Capabilities with Fewer Surprising Backdoors

Inoculation prompting is a selective-generalization technique used against Emergent Misalignment. We introduce inoculation adapters (IA), a family of methods that similarly reduce the optimization pressure to learn undesired traits by strengthening those traits during training. Inoculation adapters are LoRAs that are trained and used in three steps: (1) trained on undesired traits; (2) attached frozen while a separate task adapter is trained on data exhibiting both desired and undesired traits; (3) the IA is discarded at deployment, while only the task adapter is kept. We compare inoculation adapters with four selective-generalization baselines: inoculation prompting, preventative steering, Concept Ablation Fine-Tuning (CAFT), and KL regularization. Across nine setups and five model families, the inoculation adapter family spans a new Pareto frontier of desired trait retention vs. undesired trait suppression, although given wide confidence intervals the magnitude of improvement remains uncertain. Inoculation adapters also avoid two drawbacks of inoculation prompting: they can suppress capabilities and traits that cannot be reliably elicited by a prompt, and they introduce fewer surprising backdoors. However, no IA variant optimizes all objectives perfectly; gains in desired-trait generalization are generally accompanied by weaker suppression of the undesired trait and increased backdoor occurrence.

cs.AI

Nitsche methods for constrained problems in mechanics

We present guidelines for deriving new Nitsche Finite Element Methods to enforce equality and inequality constraints that act on the value of the unknown mechanical quantity. We first formulate the problem as a stabilized finite element method for the saddle point formulation where a Lagrange multiplier enforces the underlying constraint. The Nitsche method is then presented in a general minimization form, suitable for adding constraints to nonlinear finite element methods and allowing straightforward computational implementation with automatic differentation. This extends the method beyond classical boundary condition enforcement. To validate these ideas, we present Nitsche formulations for a range of problems in solid mechanics and give numerical evidence of the convergence rates of the Nitsche method.

math.NA

Hybrid Nitsche method for distributed computing

We extend a distributed finite element method built upon model order reduction to arbitrary polynomial degree using a hybrid Nitsche scheme. The new method considerably simplifies the transformation of the finite element system to the reduced basis for large problems. We prove that the error of the reduced Nitsche solution converges optimally with respect to the approximation order of the finite element spaces and linearly with respect to the dimension reduction parameter. Numerical tests with nontrivial tetrahedral meshes using second-degree polynomial bases support the theoretical results.

math.NA

Distributed finite element solution using model order reduction

We extend a localized model order reduction method for the distributed finite element solution of elliptic boundary value problems in the cloud. We give a computationally efficient technique to compute the required inner product matrices and optimal reduced bases. A memory-efficient methodology is proposed to project the global finite element linear system onto the reduced basis. Our numerical results demonstrate the technique using non-trivial tetrahedral meshes and subdomain interfaces with up to 85 million degrees-of-freedom on a laptop computer by distributing the bulk of the model order reduction to the cloud.

math.NA