July 08, 2026
Rigorous content moderation is crucial for online advertising but leads to millions of daily rejections. This scale renders manual rectification infeasible, particularly for video advertisements. However, existing safety-driven methods often suffer from aggressive over-editing, which compromises the advertiser’s original semantic intent merely to satisfy compliance. In this work, we target the rectification of textual violations in video ads, covering both speech transcripts and on-screen text. We propose \(\boldsymbol{\mathcal{R}}^3\), a novel framework designed to harmonize compliance with original semantic intent preservation. Our approach integrates three key innovations: (1) an experience-driven data synthesis framework that bootstraps high-quality supervision via group-Relative compliance experience extractor; (2) a curriculum Reinforcement learning strategy with hierarchical rewards designed to enforce compliance while maximizing semantic consistency; and (3) a comprehensive video Rectification framework seamlessly integrating text recognition, rewriting, and re-rendering for industrial deployment. Extensive experiments on industrial datasets and online A/B testing demonstrate that \(\mathcal{R}^3\) significantly outperforms state-of-the-art baselines, achieving an optimal trade-off between violation rectification and intent preservation.
Advertising serves as a cornerstone of the digital economy, acting as the primary engine for revenue and growth across online platforms [1], [2]. In pursuit of strict regulatory compliance and user safety, these platforms impose rigorous content moderation policies [3]–[5]. However, advertisers often struggle to navigate the complexity of these moderation rules, resulting in millions of advertisements being rejected daily. Consequently, it is imperative for online platforms to assist advertisers in automatically rectifying ad material, thereby unlocking ad supply and enhancing the overall advertiser experience [6]. With the advent of the 5G era, video has emerged as the predominant medium for information consumption, a trend particularly evident in online advertising. Consequently, violations within video advertisements constitute a significant proportion of overall content compliance issues. While these violations span both visual and textual modalities, this work focus specifically on the rectification of textual violations within video ads.
While recent advancements in Large Language Models (LLMs) [7]–[9] have bolstered capabilities in content moderation and compliance rectification [10], [11], directly applying them to video ad rectification remains non-trivial. Specifically, deploying general-purpose or naively fine-tuned models for this task faces significant challenges: 1) Inadequate compliance: Ad moderation policies are voluminous and highly context-dependent, thus that general-purpose models often fail to grasp the nuanced boundaries of moderation rules via direct prompting, leading to frequent hallucinations or missed detections of subtle violations. This necessitates domain-specific alignment, yet standard Supervised Fine-Tuning (SFT) is hindered by data availability; 2) Prohibitive Annotation Costs: The prerequisite data annotation phase for supervised fine-tuning is severely constrained by the complexity and rapid evolution of ad content moderation rules. The substantial cognitive burden involved in comprehending these policies, coupled with the resulting low annotation consistency, renders large-scale manual annotation practically infeasible [3]. 3) Compromised semantic intent: violation content rewriting is inherently a multi-objective optimization task that demands balancing compliance, semantic intent preservation, and coherence. Naively fine-tuned models, however, tend to over-optimize for compliance, leading to excessive alterations that deviate from the original intent and diminish the advertising effectiveness.
To address the aforementioned challenges, we introduce \({\mathcal{R}}^3\), a comprehensive video rectification framework designed to rectify textual violations in video advertisements, covering both speech transcripts and on-screen text. By harmonizing strict compliance with the preservation of the advertiser’s original semantic intent, \({\mathcal{R}}^3\) automates the full lifecycle of video rectification—from multi-modal content extraction to final re-rendering. Our main contributions are summarized as follows:
1) Experience-driven Data Synthesis: We propose an experience-driven synthesis framework that bootstraps high-quality supervision from advanced LLMs. By introducing group-relative compliance experience extractor, it effectively addresses data scarcity and covers complex edge cases where naive prompting typically fails.
2) Curriculum RL with Hierarchical Rewards: The task of violation textual content rectification demands the simultaneous satisfaction of multiple, often competing objectives: compliance, semantic intent preservation, and coherence. Optimizing these concurrently poses significant challenges for standard Reinforcement Learning (RL) paradigms. We address this by introducing a curriculum [12], [13] reinforcement learning framework with hierarchical rewards. This strategy progressively optimizes the model to navigate the intrinsic conflict between enforcing strict compliance and maintaining semantic intent, avoiding the over-editing in existing methods.
3) Holistic Video Rectification Framework: We present a non-compliant video ads rectification system validated within a live online advertising platform. Going beyond violation text rewriting, we engineer a pipeline that seamlessly integrates text recognition, rewriting, and re-rendering for industrial-scale deployment. This enables the automated rectification of non-compliant videos while preserving their original audio-visual fidelity.
We evaluated \({\mathcal{R}}^3\) using industry datasets and verified its effectiveness on online advertisement platform. Comparative analysis reveals that our system significantly outperforms general-purpose models-ranging from the open-source Qwen3 [8] to the advanced Gemini3-Flash [14]. Crucially, \({\mathcal{R}}^3\) demonstrates a superior performance to balance compliance with semantic intent preservation, resulting in a significantly improved final successful rectification rate.
RL has become the standard for LLM alignment [15], with recent advances like Group Relative Policy Optimization (GRPO) [16] improving efficiency by estimating advantages from response groups rather than separate value functions. Beyond general alignment, RL has shown promise in complex decision-making tasks such as content moderation [3], [4]. Despite these successes, existing methods [17], [18] primarily focus on open-ended or discriminative tasks. In our work, we apply RL to video rectification, which bridges this gap by designing a sophisticated, curriculum reward mechanism.
Generation works leverage generative models to maximize commercial metrics [19]–[21], often creating content from scratch rather than preserving existing intent. Meanwhile, [4] establish robust baselines for risk detection and localization but stop short of correction. This creates a disjointed industrial pipeline where rejected ads lack automated rectification. Our work bridges this gap. Distinct from over-editing methods like [22], we employ curriculum RL to rewrite violative content, achieving an optimal trade-off between compliance and intent preservation.
Existing inference-time methods, including in-context learning (ICL)[23], iterative refinement[24], [25], and feedback-driven frameworks [26]–[28], typically target within-sample improvements. Compared to the hierarchical, off-policy design of Agent KB [29], Training-Free GRPO [30] adopts a global perspective, refining a shared experience library via multi-epoch learning akin to traditional RL. Inspired by Training-Free GRPO, our approach performs task-aware trajectory split and extracts experience by contrasting successful and failed trajectories.
We formulate violation textual content rectification as a constrained rewriting task defined by the tuple \(\mathcal{I}=(x, \mathcal{G})\). Here, \(x\) represents the non-compliant video textual content, \(\mathcal{G}\) denotes the violation policies provided by the online violation detection model. We segment \(x\) into sentence units \(\mathcal{S}(x)=[u_1, u_2, \dots, u_n ]\) using standard punctuation-based splitting and train a policy \(\pi_\theta(y|x, \mathcal{G})\) to generate a structured edit list \(y=\{(u_k, v_k) \mid u_k \in \mathcal{N}\}\), where \(\mathcal{N} \subset \mathcal{S}(x)\) represents the subset of sentences identified as violations.Specifically, each pair in \(y\) indicates that a non-compliant sentence \(u_k\) is substituted by its compliant revision \(v_k\). The final rectified text \(x^\prime\) is obtained via a deterministic mapping \(\mathcal{A}(x, y)\), which applies these substitutions to the original sequence. Our objective is to produce a rectified output \(x^\prime\) that ensures compliance, while preserving the semantic intent of \(x\) by optimizing for linguistic coherence and minimizing edits.
Manual rectification of non-compliant ad material is labor-intensive, time-consuming, and unscalable. While Advanced LLMs possess strong constrained rewriting capabilities, they often exhibit inadequate compliance, lacking the nuanced understanding of specific moderation policies. To bridge this gap, we propose an automated, experience-driven data synthesis framework that bootstraps high-quality supervision. Specifically, tractable samples are efficiently processed by an advanced LLM Gemini3-Flash, while for intractable samples where direct prompting fails, we incorporate a Group-relative Compliance Experience Extractor.
This module is an in-context reinforcement learning paradigm inspired by Training-Free GRPO [30]. Adopting the core GRPO mechanism, it performs rollouts and computes group advantages, yet distinguishes itself by learning through natural language feedback rather than parameter updates. Operating within an iterative refinement framework (starting from \(x^{0}=x\) to generate \(x^{t+1} = \mathcal{A}(x^{t}, y^{t})\)), the extractor pinpoints the pivotal violation-to-compliance transition—where a persistent non-compliant \(x^{t}\) becomes compliant \(x^{t+1}\). It constructs a high-advantage contrastive pair by comparing the failed trajectory \(x^{0} \to x^{t}\) with the successful trajectory \(x^{0} \to x^{t+1}\), prompting the LLM to explicitly articulate the semantic rationale behind the correction. This experience is stored in a dynamic buffer, where an LLM-based controller compares newly extracted experiences with existing entries and decides whether to keep, revise, or discard them to reduce redundancy and conflicts. The refined experience are then injected into subsequent generations. An example can be found in Appendix 10.3.
However, the extracted experience inherently prioritizes compliance, often biasing the model toward aggressive rewriting that deviates from the original semantic intent. To resolve this trade-off, as shown in Figure 1, we implement a conditional injection mechanism. We first employ a direct prompting strategy using Gemini3-Flash, activating experience injection only if the initial attempt fails. This strategy prioritizes minimal edits on tractable instances and reserves experience injection for intractable ones, thereby producing a high-coverage training corpus that strictly adheres to multi-objectives.
We train \({\mathcal{R}}^3\) on top of Qwen3-8B by integrating SFT with GRPO. Specifically, the SFT stage serves to instill moderation policies and align the model with the required structured output format. Subsequently, GRPO further optimizes for compliance and semantic intent preservation using curriculum RL with hierarchical rewards.
SFT enforce the edit-list schema and condition rectifications. This stage minimizes format violations and injects foundational compliance knowledge, establishing a stable initial state to facilitate efficient exploration in the subsequent RL stage.
The reward function R optimizes the model’s RL performance across four dimensions.
This term enforces structural executability. Beyond JSON parsability, every \(u_k\) selected for modification must exactly match the source text (i.e., \(u_k\in\mathcal{S}(x)\)).
We measure compliance using the online violation detection model. The reward is binary: \(R_{com} \in\{0,1\}\). This term acts as the primary driver for satisfying compliance.
We quantify modification magnitude by the count of edited units \(m=|y|\) relative to \(n=|\mathcal{S}(x)|\). Minimizing \(m\) is crucial for: (1) Advertisers prioritize retaining the original narrative structure and minimizing interventions; (2) Limiting text changes reduces duration mismatches in downstream Text-To-Speech (TTS), preventing synchronization failures. However, an unbounded penalty on \(m\) creates an optimization imbalance: over-optimizing minimalism on tractable samples penalizes the exploration required for intractable ones. Thus, we introduce a tolerance threshold \(\tau\) as an edit margin to establish a penalty-free zone for essential modifications: \[\label{eq:reward95edit95tilde} R_{\text{edit}}= \begin{cases} 1, & m \le \tau,\\ 1-\frac{m-\tau}{n-\tau}, & m > \tau. \end{cases}\tag{1}\]
To ensure linguistic fluency and semantic preservation, we employ an LLM-as-a-judge to provide dense feedback.
For each pair \((u_k, v_k)\), the judge assigns a scalar score \(\phi(x, u_k, v_k) \in \{0, 1\}\). The final sentence-level reward is the average of these scores: \[\label{eq:reward95coh95tilde} R_{\text{coh}}=\frac{1}{m}\sum_{k=1}^{m}\phi(x, u_k, v_k).\tag{2}\]
The overall reward \(R\) is: \[\label{eq:all95reward} R = \lambda_1 R_{for} + \lambda_2 R_{com} + R_{com} \cdot (\lambda_3 R_{edit} + \lambda_4 R_{coh}),\tag{3}\]
where \(\lambda_1,\lambda_2,\lambda_3, \lambda_4\) are stage-dependent coefficients.Specifically, in Stage 1 we set \((\lambda_1, \lambda_2, \lambda_3, \lambda_4) = (0.3, 5.0, 0, 0)\), and in Stage 2 we use \((0.1, 5, 0.4, 0.5)\). To prevent reward hacking, we gate \(R_{edit}\) and \(R_{coh}\) using the compliance reward \(R_{com}\). This ensures that auxiliary objectives are only pursued once the primary compliance goal is met.
While SFT provides a strong initialization, it relies on static supervision, which struggles to balance the often conflicting objectives of strict compliance and semantic preservation. To address this, we employ RL with a hierarchical reward system. However, directly optimizing for these competing goals remains challenging: if edit penalties are introduced too early, the policy tends to collapse into a local optimum of minimal edits to avoid punishment, failing to explore necessary but extensive rewrites. To overcome this exploration hurdle, we design a two-stage curriculum:
In the initial stage, we exclusively prioritize compliance to encourage bold exploration. We set the coefficients \(\lambda_3\) and \(\lambda_4\) to zero while assigning a high value to \(\lambda_2\). This configuration compels the policy model to focus solely on satisfying compliance, incentivizing extensive rewriting. While this may temporarily lead to over-editing, it establishes a critical high-recall baseline, ensuring the model learns the necessary editing to achieve high compliance rate.
Once the model achieves a stable compliance rate, we transition to stage 2 by activating the soft objectives (\(\lambda_3, \lambda_4 > 0\)) while maintaining \(\lambda_2\) as the dominant term. This stage acts as a regularization step: within the manifold of compliant solutions, the policy model is guided to select those that minimize text alterations while preserving coherence. This effectively refines the aggressive editing behavior learned in stage 1, converging toward the Pareto frontier of compliance and semantic intent preservation.
To bridge the gap between algorithmic rewriting and industrial production, we integrate \(\mathcal{R}^3\) into an automated video rectification workflow (Figure 2). The pipeline comprises three phases: (1) Text-Recognition, which demultiplexes the video, isolates vocals via audio source separation, and extracts both speech transcripts and on-screen text; (2) Text-Rewriting, where \(\mathcal{R}^3\) generates a structured edit list to ensure compliance; and (3) Re-Rendering, which reconstructs both auditory and visual content.
The final Re-Rendering stage is critical for preserving the quality of the rectified video.We employ zero-shot voice cloning to preserve the speaker’s timbre. A key challenge is temporal alignment between synthesized speech and the original video timeline. We therefore first adjust silent intervals and, when necessary, apply time-stretching to the generated speech so that the updated segment matches the target duration. For loudness alignment, we employ an iterative dynamic range control procedure: we first estimate the loudness gap between the synthesized speech and the original vocal track, then apply gain adjustment with peak limiting, and iteratively compensate for the attenuation introduced by the limiter until the mixed audio reaches the target loudness. Finally, subtitles are re-rendering using OCR-derived coordinates and the updated audio is merged back into the video, producing a compliant video that preserves the original production layout and audio-visual fidelity.
lccccccc >c c [-0.3em]Model & [-0.3em] & [-0.3em] & [-0.3em] & [-0.3em] &
(lr)6-9 & & & & & ComR\(\uparrow\) & AvgE\(\downarrow\) & CohR\(\uparrow\) & QRR\(\uparrow\)
Qwen3-8B & 69.32% & 67.95% & 31.10% & 70.88% & 50.28% & 8.2 & 45.07% & 22.66%
Gemini3-Flash & 83.67% & 86.32% & 65.99% & 96.70% & 77.05% & 6.24 & 97.98% & 74.43%
Gemini3-Flash with GCEE & 90.04% & 90.17% & 75.58% & 98.35% & 84.84% & 8.63 & 89.41% & 75.21%
Qwen3-8B-SFT & 91.63% & 94.87% & 69.77% & 98.90% & 82.58% & 7.7 & 87.48% & 72.23%
\(\bm{\mathcal{R}^3}\) & 93.63% & 96.58% & 76.16% & 98.90% & 85.50% & 7.49 & 94.70% &
81.02%
To assess the efficacy of \(\mathcal{R}^3\) within a realistic industrial setting, we constructed a proprietary dataset derived from a production moderation pipeline. The dataset is partitioned into a training set of 11k samples and a held-out test set of 1k samples. To ensure a rigorous evaluation of robustness across challenging compliance scenarios, we focus on four major violation policies: Quantitative Claims (Qua.C), Absolute Claims (Abs.C), Misleading Exaggeration (Mis.E), and Superlative Claims (Sup.C), detailed definitions and examples are provided in the Appendix 9.2.
To evaluate the performance of our method, we employ four metrics: (1) Compliance Rate (ComR): The percentage of rectified samples which are compliant. (2) Average Edit (AvgE): The average number of modified sentence units per example. (3) Coherence Rate (CohR): The proportion of samples deemed linguistically fluent and semantically consistent. We employ Gemini3-Flash as an evaluator, instructing it to compare the rectified content against the original text. (4) Qualified Rectification Rate (QRR): The fraction of samples that are both compliant and coherent. In practice, advertiser tolerance for text alterations is highly subjective, making a universal threshold for acceptable edits impractical. Thus, QRR indicates whether a rectification is fundamentally usable, while AvgE independently measures the intervention cost required to achieve this qualification.
| Model | Online Sample Average | |
|---|---|---|
| 2-3 | ComR\(\uparrow\) | AR\(\uparrow\) |
| Qwen3-8B-SFT | 83.91% | 1.0 |
| \(\bm{\mathcal{R}^3}\) | 86.53% | 1.21 |
ccccc|cccc [-0.3em] & [-0.3em] & [-0.3em] & [-0.3em] & [-0.3em] &
(lr)6-9 & & & & & ComR\(\uparrow\) & AvgE\(\downarrow\)&CohR\(\uparrow\) & QRR\(\uparrow\)
✔& - & - & - & - & 82.58% & 7.70 & 87.48% & 72.23%
✔& ✔& - & - & - & 89.94% & 11.28 & 86.14% & 77.47%
✔& ✔& ✔& - & - & 83.43% & 6.31 & 87.95% & 73.37%
✔& ✔& ✔& ✔& - & 83.14% & 6.56 & 92.84% & 77.19%
✔& ✔& ✔& ✔& ✔& 85.50% & 7.49 & 94.70% & 81.02%
Table ¿tbl:tab:model95performance95comparison? presents a comprehensive evaluation of \(\mathcal{R}^3\) against baselines, including the Qwen3-8B, Gemini3-Flash (with and without GCEE), and Qwen3-8B-SFT. \(\mathcal{R}^3\) achieves state-of-the-art performance with the highest QRR and remarkably competitive AvgE. Specifically, compared to the Qwen3-8B-SFT, \(\mathcal{R}^3\) yields a consistent improvement in ComR (+2.92%) and a substantial margin in QRR (+8.79%). This confirms that integrating curriculum GRPO effectively steers the policy toward the optimal Pareto frontier of strict compliance and semantic intent preservation. Furthermore, \(\mathcal{R}^3\) ranks first across all four fine-grained violation policies. While Gemini3-Flash exhibits highly conservative editing behavior, \(\mathcal{R}^3\) significantly outperforms it in overall quality, surpassing this baseline by +8.45% in ComR and +6.59% in QRR. Although augmenting Gemini3-Flash with GCEE boosts its compliance to 84.84%, it noticeably increases AvgE to 8.63 and limits the overall qualification. \(\mathcal{R}^3\) maintains a definitive lead, validating the superiority of a dedicated rectification policy over directly prompting LLMs.
To assess the practical viability of our approach in a production environment, we conducted a 3-day online A/B test on a live advertisement platform, benchmarking \(\mathcal{R}^3\) against Qwen3-8B-SFT. We report adoption rates normalized against the baseline, as absolute figures are commercially sensitive. \(\mathcal{R}^3\) yields substantial improvements (Table 1), with a +2.62% ComR gain and a relative adoption increase of +21%. Given that both models exhibit comparable AvgE, the boost in adoption aligns directly with \(\mathcal{R}^3\)’s higher QRR. This demonstrates that evaluating QRR in conjunction with AvgE effectively predicts real-world advertiser acceptance.
We evaluate the contributions of distinct reward components and the curriculum strategy in Table ¿tbl:tab:ablation95study?. Regarding reward design, relying solely on the Compliance Reward guarantees compliance but induces excessive alterations. Integrating the Minimal-edit Reward effectively constrains this over-editing behavior, while the Coherence Reward is indispensable for preserving linguistic fluency and semantic intent. Regarding the training strategy, comparing single-stage optimization against our two-stage curriculum confirms that the latter yields a superior trade-off.
Figure 3 depicts the impact of the tolerance threshold \(\tau\) . We observe that a low \(\tau\) overly restricts edits, compromising compliance, whereas an excessively high \(\tau\) improves compliance but suffers from over-editing. This dynamic constitutes a Pareto optimality problem. As shown in Figure 3, setting \(\tau=7\) yields the most favorable equilibrium between rewriting intensity and compliance quality.
We present \(\mathcal{R}^3\), a comprehensive video textual rectification framework designed to harmonize strict compliance with semantic intent preservation. By employing experience-driven data synthesis and curriculum reinforcement learning, \(\mathcal{R}^3\) achieves state-of-the-art gains in both compliance rate and qualified rectification rate on industrial benchmarks. Furthermore, online A/B testing validates its practical viability and superior advertiser adoption in real-world production environments.
Our system is optimized against a specific moderation system and a fixed set of policy guidelines used during training, which may reduce flexibility when the moderation system, decision boundary, or rule set changes over time. While our experience-driven data synthesis and curriculum reinforcement learning improve robustness within the covered policy scope, adapting to newly introduced or rapidly evolving rules may still require additional data regeneration and re-alignment. As future work, we plan to explore continual and modular policy alignment strategies that can rapidly incorporate rule updates with minimal re-training.
This research was conducted in strict adherence to ethical guidelines and data privacy regulations. The industrial dataset utilized in this study was derived from a production environment and was rigorously desensitized to ensure the anonymity of advertisers and users. The non-compliant advertisement examples presented herein are strictly for illustrative scientific analysis and do not reflect the views or values of the authors or the affiliated platform. All resources and methodologies are intended solely for academic research.
Figure 4 illustrates the distribution of the violation policies across our industrial dataset.


Figure 4: Distribution of violation policies in the training and test datasets..
We align our violation policies with the production moderation standards of the online platform. Table 2 presents desensitized definitions and illustrative examples, intended solely to capture the general linguistic characteristics of each violation policy.
| Policy | Definition | Examples |
|---|---|---|
| Quantitative Claims | Claims that cite specific data, statistics, or probability rates (e.g., success rates, reduction percentages). | Our course has successfully helped 5,000 students pass the exam. |
| Absolute Claims | The use of absolute or exclusive terms that imply a product is indispensable, universal, or has no alternatives. | This product is a cosmetic that is essential for every woman. |
| Superlative Claims | The use of highest-degree adjectives (e.g., "Best," "No.1," "Top") to describe a product’s quality or status. | We are the No.1 education app in the market. |
| Misleading Exaggeration |
Hyperbolic descriptions that distort the product’s actual efficacy. | Use this cream and look 20 years younger instantly. |
Figure 5 illustrates the standard prompt template used to guide the LLM in rectifying non-compliant text and generating structured outputs.
Figure 6 presents the prompt utilized by the Group-Relative Compliance Experience Extractor.
Figure 7 demonstrates a complete workflow of trajectory splitting and experience extraction, where the LLM performs three consecutive rounds of rewriting, incrementally resolving non-compliance based on the previous output. This continuous trajectory is split into contrastive pairs. The extractor then analyzes the semantic gap between these paired responses to extract specific compliance experiences.
The concrete hyperparameters for the GCEE data-synthesis stage are as follows: we run 3 epochs with batch size 10; for each sample, we generate 5 rollouts; and we extract at most 2 experiences per sample.
To ensure the rectified text maintains linguistic fluency and semantic intent, we employ Gemini3-Flash as an LLM-as-a-judge evaluator. We designed a rigorous three-level evaluation rubric to assess the quality of modifications, mapping each quality level to a specific scalar reward. To align the LLM’s judgment with human preferences, we include representative few-shot examples in the prompt to guide the evaluation. Table 3 details the specific criteria used by the evaluator.
| Label (Score) | Fluency (Linguistic Quality) | Semantic Intent Preservation |
|---|---|---|
| Improvement (1.0) | Repairs Flaws. The edit fixes pre-existing grammatical truncations or logical gaps, resulting in a flow that is significantly more natural than the original. | Clarifies Intent. The modification removes ambiguity or awkward phrasing in the original text, making the marketing message clearer and more impactful. |
| Neutral (1.0) | Maintains Status Quo. The sentence structure remains unchanged. Pre-existing typos or colloquialisms are tolerated as long as it is not exacerbated. | Consistent Intent. The core marketing message is fully preserved. Modifications are strictly limited to replacing non-compliant terms with compliant synonyms. |
| Degradation (0.0) | Introduces Errors. The edit creates new grammatical faults, awkward collocations, or disjointed connections that did not exist in the source text. | Distorts Meaning. The edit reverses the original meaning (e.g., positive to negative), introduces logical contradictions, or loses key product information. |
8pt
We build \(\mathcal{R}^3\) on top of Qwen3-8B. We perform SFT with LoRA (\(r{=}64\)) using a learning rate of \(1\times10^{-4}\), batch size 64, and train for 2 epochs. We then apply GRPO with the two-phase curriculum; each phase is trained for 1 epoch with a learning rate of \(1\times10^{-6}\), group size 8, and a KL coefficient of 0.01. All experiments are conducted on 8 NVIDIA H20 GPUs.