arXiv (All)
open access
Routing Policy Optimization for Online Diffusion Reinforcement Learning
Reinforcement learning can align visual generators with reward signals beyond their pretraining objectives, but existing score-function methods typically introduce stochasticity by perturbing the reverse denoising trajectory, leading to costly rollout-based optimization. We instead ask whether stoch
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- COPC: Coupled Off-Policy Correction for Asynchronous LLM Reinforcement Learning#1233965
- Adaptive Partitioning and Learning for Stochastic Control of Diffusion Processes#925877
- ECHO-2: A Large-Scale Distributed Rollout Framework for Cost-Efficient Reinforcement Learning#1131454
- A Continuous-Time Reinforcement Learning Framework for Fine-Tuning Discrete Diffusion Models#1116368
- After Cooperation Is Learned: Gradient Routing and Optimizer-Dependent Maintenance in Multi-Agent Reinforcement Learning#1156901
Record · ID 1357937
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive