Skip to content

Conditional Optimal Bridge for Riemannian Activation Steering

Jul 2026 · arXiv.org · Vol abs/2607.10517 · 1 citation · 41 references
Computer Science

TL;DR

This formulation yields the first principled derivation of the log-density-ratio steering objective from a well-posed optimization problem, and consistently outperforms prior activation steering baselines while avoiding the OOD degradation commonly observed in existing methods.

Abstract

Activation steering offers a lightweight alternative to fine-tuning for controlling large language models at inference time. While many existing methods implicitly optimize a log-density-ratio objective between desired and undesired activation distributions, they do so heuristically rather than deriving it from a principled optimization problem. Moreover, these methods produce query-independent steering directions that can degrade performance on both in-distribution and out-of-distribution (OOD) inputs. We introduce \textsc{Cobras} (Conditional Optimal Bridge for Riemannian Activation Steering), which addresses both limitations by casting activation steering as a Schr\"{o}dinger Bridge on the residual-stream hypersphere. This formulation yields, to our knowledge, the first principled derivation of the log-density-ratio steering objective from a well-posed optimization problem. Solving the bridge via entropic optimal transport and extracting the probability flow ODE recovers the widely used density-ratio gradient as a special case when the Sinkhorn potentials are uniform. Crucially, the Schr\"{o}dinger potentials are evaluated at the current activation, making the resulting steering direction inherently query-adaptive. Empirically, across four models and three alignment axes (helpfulness, truthfulness, and detoxification), \textsc{Cobras} consistently outperforms prior activation steering baselines while avoiding the OOD degradation commonly observed in existing methods. The code can be found at https://github.com/arshandalili/cobras.

View source

Similar papers

Book Open access Aug 2026

A Geometric Information Bottleneck for Activation Steering

This work proposes a disentanglement-based intervention framework, termed IB-ACT, that identifies both where and how to intervene by exploiting the layer-wise geometry of representation spaces to isolate behavior-relevant information without disturbing other dimensions, and introduces a layer-selection mechanism determ...

Toan Doan, Thin Nguyen, Sunil Gupta · 0 citations
#artificial intelligence Preprint Sep 2026

Newton Matching for Generative Modeling: A Unified Framework for Fine-Tuning and Sampling

The paradigm from isolated losses to iterative optimization over canonical models: population minimizers of standard conditional matching for terminal densities and approximate updates and define critical-point consistency as vanishing tangential displacement if and only if $\rho=\pi$.

Ze-Yang Li, Yu-Nan Wang, Paolo Giaretta et al. · 0 citations
#machine learning Preprint Sep 2026

Stiefel Attention: When the Geometry of Transformer Projection Matrices Dominates Optimizer Choice---and When It Does Not

The query and key projections $\WQ,\WK$ in attention are almost always trained by Euclidean optimizers with no geometric constraint. We constrain them to the Stiefel manifold and optimize with a Riemannian Adam carrying one scalar second moment per frame---the form of \citet{becigneul2019}, here extended to the compact...

Rubén Darío Guerrero · 0 citations
#artificial intelligence Preprint Aug 2026

Denoising as Projection: Constrained Optimization with Gradient-Guided Diffusion

The proposed update incorporates the objective gradient inside the denoising step, yielding an inference-time method that uses only a pretrained denoiser and gradient evaluations and is analyzed as an inexact projected-gradient method for constrained optimization over learned feasible geometries.

R. Zhang, Jiawei Zhang, Gioele Zardini et al. · 0 citations
#machine learning Preprint Sep 2026

Generalized Score Matching for Parameter Estimation on Convex Domains

This work derives the generalized score matching objective on a convex subset of $\mathbb{R}^{d}$ constructively starting from Minimum Probability Flow (MPF) learning, and shows how classical score matching as well as domain-adapted variants for non-negative data arise naturally within the proposed framework.

Nishanth Shetty, Saisuchith Mahajan, C. Seelamantula · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.