Skip to content

CORAM: Coherent Orthogonal Rotation for Model Merging

Aug 2026 · 1 citation · 38 references
Computer Science

Abstract

Merging finetuned models combines specialized capabilities without joint training or access to the original data. Most methods operate by linear arithmetic in Euclidean weight space, which cannot carry the geometry of the update. Orthogonal Model Merging (OrthoMerge) uses a single orthogonal transform for each weight matrix, but such a transform cannot change singular values. We propose CORAM, which partitions each target matrix into row slices, represents every expert slice by its singular value decomposition in the corresponding base-model SVD frame, and merges the task-specific factors on their corresponding manifolds. Because manifold averaging contracts the merged update, CORAM applies an amplification coefficient $\lambda=\kappa\hat{c}$. The scale c_hat is estimated from the expert and merged update norms and is approximately $\sqrt{N}$ for $N$ experts with comparable update magnitudes. The restoration strength kappa is selected from the dispersion of expert updates without evaluating candidate merged models. This rule remains within 0.72 points of the best swept value on all evaluated suites. CORAM also includes spread slicing to distribute highly updated rows across slices and a residual pathway for non-target layers. Across four suites covering three model families, 3B to 9B scales, and language and vision-language experts, CORAM improves over OrthoMerge by 0.25 to 1.35 points and matches or exceeds the strongest weight-space baselines.

View source

Similar papers

Preprint Aug 2026

RODE: A Radial-Orthogonal Decoupled Engine for Optimization

This work introduces RODE, which gives the radial and directional components separate update rules and step sizes in the matrix Frobenius norm, and suggests that decoupling radial and directional dynamics offers a more effective and controllable approach to matrix optimization.

Guo-Xiang Xu, Bince Qu, Qi Sun et al. · 0 citations
Jul 2026

Hidden Boundary Motion in Transformer Optimization: Function-Space Orthogonalization of Affine Weight and Bias Updates

A diagnostic optimizer, Shape--Boundary Orthogonal AdamW (SBO-AdamW), is implemented that optimizes g_W-g_b\mu^\top and g_b with independent Adam states and compensates the weight-induced boundary displacement and a stable centered-affine parameterization is identified as the required next step.

Gongyue Zhang, Yi-Xuan Sheng, Donghan Liu et al. · 0 citations
Preprint Aug 2026

Residual Algebra for Representation-Preserving Learning

R residual algebra is proposed, in which each representation retains its coordinate system and owns its unresolved residual until an explicit aggregation boundary until an explicit aggregation boundary, with population variance reduction and first-order coupled-path mean orthogonality.

Yao Wu · 0 citations
Jul 2026

Exact ReLU realization of affine one-dimensional refinement iterates via residual memory and offset frames

We study vector-valued affine refinement operators of the form [ (W\gamma)(t)=\sum_{j\in\mathbb{Z}} A_j\gamma(Mt-j)+B(t), ] with finitely supported matrix mask and compactly supported continuous piecewise linear input and forcing data. Building on the homogeneous realization theorem for (B\equiv 0), we prove that, for...

Boldsaikhan Bolorkhuu, T. Gantumur · 2 citations
Preprint Aug 2026

BaKron: Efficient Quantization with Kronecker-Factored Hessians

BaKron is an efficient solver that combines anti-diagonal parallelism with a recursive divide-and-conquer construction that matches the cubic scaling of GPTQ while exploiting richer curvature information.

Johann Birnick, R. Saab · 2 citations
Preprint Aug 2026

Multi-Objective Bayesian Optimization for Model Merging

Results show that multi-objective Bayesian optimization is valuable as a search layer for expressive merge parameterizations in model merging and introduce MOBO-Merge, a merge-operator agnostic framework that uses multi-objective Bayesian optimization to approximate the Pareto front under a limited evaluation budget.

Utkarsh Agarwal, V. Bonagiri, Raul Astudillo et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

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