Orthogonalized Policy Optimization:Policy Optimization as Orthogonal Projection in Hilbert Space
On the map: LLM alignment / RLHF / preference optimisation → LLM preference optimization methods
Abstract (arXiv)
We propose Orthogonalized Policy Optimization (OPO), a principled framework for large language model alignment derived from optimization in the Hilbert function space L2(pi_k). Lifting policy updates from the probability simplex into L2(pi_k) transforms the nonlinear normalization constraint into a linear orthogonality condition <v, 1>_{pi_k} = 0 on the density fluctuation field v = pi/pi_k - 1. By the Hilbert projection theorem, the unique closed-form update is v_star = (omega_alpha - E[omega_alpha]) / mu, where the subtracted mean acts as a chemical potential enforcing probability conservation. This interpretation reveals advantage z-score normalization as a conservation-law projection rather than a variance-reduction heuristic. OPO cleanly decouples sampling geometry, controlled by the escort exponent alpha, from optimization geometry, governed by the stiffness parameter mu, a separation not attainable under KL-based objectives. The same update can also be derived as a Euclidean mirror-descent step and as the linear-response law of near-equilibrium statistical mechanics, establishing its structural uniqueness within ratio geometry. Structurally, OPO induces constant curvature, non-saturating linear gradient dynamics, and an intrinsic chi-square trust region. Experiments on MATH benchmarks show that the Hilbert projection formulation prevents gradient saturation typical of KL-constrained methods. By sustaining non-vanishing gradients in high-confidence regimes, OPO avoids premature plateaus and achieves stronger long-horizon training rewards and improved out-of-distribution generalization compared to clipping-based baselines.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in LLM preference optimization methods, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 13 of its 20 references that are in the map. First posted on arXiv 18 Jan 2026.
Builds on
13 of 20 references.
Closest ancestors · 4
Same direction, newest first
- 2025ADPO: Anchored Direct Preference Optimization21 Oct
- 2024SimPO: Simple Preference Optimization with a Reference-Free Reward23 May
- 2023A General Theoretical Paradigm to Understand Learning from Human Preferences18 Oct
- 2022Training language models to follow instructions with human feedback4 Mar
Other references · 9
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
- 2017Deep reinforcement learning from human preferencescited by 3,846
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,678
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 504
- 2019A Divergence Minimization Perspective on Imitation Learning Methodscited by 188
- 2016R'enyi Divergence Variational Inferencecited by 104
- 2025APO: Alpha-Divergence Preference Optimizationcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2024Information Theoretic Guarantees For Policy Alignment In Large Language Models
- 2026Holder Policy Optimisation
- 2026Fibration Policy Optimization
- 2025OrthAlign: Orthogonal Subspace Decomposition for Non-Interfering Multi-Objective Alignment
- 2026A First-Principles Derivation of LLM Policy Optimization: From Expected Reward to GRPO and Its Structural Extensions
- 2026Nora: Normalized Orthogonal Row Alignment for Scalable Matrix Optimizer
- 2026POETS: Uncertainty-Aware LLM Optimization via Compute-Efficient Policy Ensembles
- 2026Why Semantic Entropy Fails: Geometry-Aware and Calibrated Uncertainty for Policy Optimization