Adaptive Reward Routing: Dynamic Multi-Reward Optimization for Joint Audio-Video Diffusion via Forward-Process RL
Songlin Yang, Xiaotong Zhao, Jiacheng Zhang, Zhe Wang, Toyota Li, Eric Liu, Alan Zhao, Anyi Rao
The Hong Kong University of Science and Technology · Tencent Video · The University of Hong Kong
Published September 29, 2026 · on the feed October 2, 2026 · ▲ 128 · arXiv 2609.37200
The abstract
Multi-reward guided reinforcement learning (i.e., RL) offers a promising way to improve joint audio-video diffusion models along several complementary objectives, including modality-specific quality, cross-modal semantic alignment, and temporal synchronization. Its effectiveness, however, depends on two quantities that change during training: where reward-driven updates should act, and how competing rewards should be combined. Existing methods tend to rely on fixed routing and reward weights, failing to track evolving model functions. To address these limitations, we propose Adaptive Reward Routing to jointly adapt update locations and reward coordination during forward-process RL (i.e., DiffusionNFT) of joint audio-video diffusion models. Our method consists of two components. (i) Cross-Modal Influence-Guided Routing (Localizing Updates): We use bidirectional cross-attention responses as an efficient proxy for evolving cross-modal influence, dynamically reweighting token-aware losses and scaling gradients across cross-modal layers without additional model interventions. (ii) Preference-Preserving Modality-Aware Reweighting (Coordinating Rewards): We preserve predefined weights as preference priors and use branch-specific reward-gradient interactions as residual corrections after warm-up. This resolves evolving conflicts without letting dominant rewards suppress weak but essential objectives. Extensive experiments demonstrate consistent improvements in modality quality, semantic consistency, and audio-video synchronization over strong RL baselines. Ablations and mechanism analyses further validate the complementary benefits of adaptive update routing and reward coordination.
The Brief
2:47A short podcast summary of the paper. Written and voiced by AI.
Transcript
Adaptive Reward Routing. Dynamic Multi-Reward Optimization for Joint Audio-Video Diffusion via Forward-Process RL. By Songlin Yang and seven others, from the Hong Kong University of Science and Technology, Tencent Video, and one other institution. Published on the twenty-ninth of September. No code repository is linked to it.
A joint audio-video diffusion model has to get several things right at once. The picture has to be good and the sound has to be good, each on its own terms. The two have to agree in meaning. And they have to line up in time. Reinforcement learning guided by multiple rewards offers a promising way to improve such a model along all of these complementary objectives together.
How well that works depends on two quantities, and both change as training proceeds. The first is where the reward-driven updates should act inside the model. The second is how competing rewards should be combined. Existing methods tend to rely on fixed routing and fixed reward weights, set once. A fixed choice cannot follow a moving target, and so these methods fail to track how the model's functions evolve over training.
Adaptive Reward Routing jointly adapts both: where updates land, and how the rewards are coordinated. It does this during forward-process RL, specifically DiffusionNFT, applied to joint audio-video diffusion models. The method has two components, one answering each of those questions.
Cross-Modal Influence-Guided Routing localizes the updates. It takes the bidirectional cross-attention responses as an efficient proxy for how cross-modal influence is evolving. Guided by that proxy, it dynamically reweights token-aware losses and scales gradients across the cross-modal layers. None of this requires additional interventions in the model.
Preference-Preserving Modality-Aware Reweighting coordinates the rewards. It keeps the predefined reward weights, treating them as preference priors rather than discarding them. After a warm-up period, it adds residual corrections drawn from branch-specific interactions between reward gradients. That lets it resolve conflicts as they evolve, without letting dominant rewards suppress objectives that are weak but essential.
Extensive experiments show consistent improvements over strong RL baselines, on all three fronts the method targets: modality quality, semantic consistency, and audio-video synchronization. Ablations and mechanism analyses further support the design choice of having two components. Adaptive update routing and reward coordination each bring something, and the benefits are complementary rather than overlapping.
Fixed weights and fixed routing treat the training problem as if it stood still. Adaptive Reward Routing treats both as moving targets, reading cross-attention to decide where to push and gradient interactions to decide how the rewards balance, while the stated preferences stay in place as the starting point.
Paper Quest · 7 chapters · about 40 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
Sound and picture must agree, and the rewards that judge them do not stay still.
You are fine-tuning a model that generates video and its soundtrack together, using several reward signals: picture quality, sound quality, meaning agreement, and timing sync.
The road ahead
- 1 · The problem ~7 min Fine-tuning a sound-and-video generator with several rewards needs choices about where updates land and how rewards mix, and those choices go stale.
- 2 · What came before ~3 min
- 3 · The key idea ~8 min Recompute, from the current model, both where reward updates land and how rewards are mixed, while keeping the user's preset weights as an anchor.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Read cross-attention responses, use them to weight tokens and scale layer gradients, then mix rewards from preset weights plus branch-specific residual corrections.
- 6 · The experiment ~6 min You’ll guess: Ablating the two components, did adaptive update routing and reward coordination turn out redundant or complementary?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.