AIAny
Icon for item

A Local Perturbation Theory for Cross-Domain Interference and Recovery in Multi-Domain RL

Analyzes how single-domain RL fine-tuning on LLMs induces cross-domain interference and shows this damage concentrates in a low-dimensional shared conflict subspace; proposes a local perturbation theory and short domain "refresh" procedures that selectively recover earlier domains with minimal collateral loss.

Introduction

Most single-domain RL fine-tuning for large language models improves the target domain but often degrades others. This paper's core insight is that such interference is not necessarily a diffuse, full-model phenomenon: updates are sparse and small in magnitude, yet they act on shared active computation routes where a low-dimensional conflict subspace concentrates cross-domain harm. That localization makes selective, low-cost recovery possible.

Key Findings
  • Sparse, route-focused updates. The authors show single-domain RL produces sparse, small-magnitude parameter edits with weak overlap among the top-changed neurons; different domains nonetheless share active computation routes. So what? Interference depends more on which computation routes are activated and how updates project onto those routes than on wholesale gradient alignment across the whole model.

  • Local perturbation theory and the second-order damage term. Under a local perturbation model the dominant harm from later-domain training to an earlier domain arises from a second-order damage term that, given the observed sparsity, concentrates in a low-dimensional shared conflict subspace. So what? Theoretical framing explains why focused interventions (not full rollback) can be effective.

  • Empirical, inexpensive recovery. A short domain-specific "Re-Math" refresh after the sequence Code → Math → QA → CW restored Math performance from 57.66 to 66.04 while largely preserving other domains, improving the overall average to 66.39. So what? Brief, targeted retraining can recover lost capability without expensive full-model re-training.

  • Training-free, sparse rollback evidence. A training-free rollback applied on a sparse proxy conflict coordinate set for the Math–QA pair partially restored Math, providing direct proxy-level evidence that damage is localized and addressable without full retraining.

Who It's For & Trade-offs

Great fit if you are an ML researcher or model maintainer investigating RLHF/multi-domain fine-tuning, want mechanistic explanations for cross-domain failure modes, or need low-cost repair strategies for deployed LLMs. Look elsewhere if your primary failure mode is dense, large-magnitude catastrophic forgetting across the entire parameter space or if you cannot observe/identify neuron-level activations or active computation routes — the proposed methods rely on route-sparsity assumptions and probes that may be harder to apply on very different architectures or opaque production stacks.

Methodological notes

The paper combines empirical probing (route/activity analysis and sparse coordinate interventions) with a theoretical local-perturbation model that formalizes damage as a second-order term concentrated on shared active routes. The combination of proof and targeted empirical interventions gives practical guidance: identify conflict coordinates or run a short domain refresh to contract harmful components in the conflict subspace before resorting to large-scale retraining.

Information

  • Websitearxiv.org
  • AuthorsLei Yang, Siyu Ding, Deyi Xiong
  • Published date2026/06/01

More Items

Turns each research paper into a training environment to generate verifiable research plans by synthesizing questions from goals/background and deriving evaluation criteria from methods/experiments. Key features: four-stage extraction that reduces criterion leakage to 3.7%, a two-stage rubric-centered training (self-distillation then GRPO), and the PaperGym-20k corpus with two held-out benchmarks.

Analyzes on-policy distillation for LLM fine-tuning, shows teacher token-level supervision is often noisy and not the main driver of gains, and introduces OPSA, a supervision-free, entropy-adaptive method that suppresses low-probability tokens to improve downstream accuracy.

Trains LLM agents to proactively edit and manage their working context for long-horizon tasks using an expanded toolset (planning, long-term memory, soft offloading) and a fine-grained RL algorithm that identifies critical edits and assigns action-level credit. Improves accuracy while keeping contexts compact on long-context QA and deep search.