
A developer built a small AI model that rewrites text to sound more human by removing patterns that typical AI detectors flag as synthetic.
The model uses reinforcement learning with multiple reward signals—including a rule-based linter, an LLM judge for content preservation, and other open-source detectors—and successfully fools most public detection tools.
However, it remains weaker against proprietary detectors, revealing a gap in generalization that the author identifies as a key unsolved problem.
What happened
A developer trained a 4-billion-parameter language model using reinforcement learning to rewrite AI-generated text in a way that sounds more human. The model was optimized against multiple AI detectors (both rule-based and neural) to remove common patterns of AI writing while preserving content, structure, and tone.
Why it matters
AI-generated text often sounds generic and formulaic—a problem the author calls 'AI slop.' For writers who use LLMs as a workflow tool, a model that can clean up that output while keeping the original meaning could make AI assistance feel less obviously synthetic. However, the approach has limits: the model performs well against open-source detectors but struggles with closed-source ones like Pangram, suggesting generalization across different detection methods remains unsolved.
What to watch
The author notes that scaling from a 4-billion to a 35-billion parameter model did not improve performance against closed-source detectors, and lists several ideas for future work—including training in a GAN-like loop where the rewriter and detector continually adapt to each other. Better rewards and evals proved more effective than larger models, pointing to an iterative engineering challenge rather than a simple scaling path.
The author began by observing that AI-generated text, while not necessarily poor, tends to sound generic and formulaic—a quality commonly called 'AI slop.' As someone who uses AI models regularly in their writing workflow, they wondered whether a smaller model could be trained to rewrite such text to sound more human while preserving its original meaning, structure, and tone. This felt like a natural reinforcement learning problem: use an AI detector as a reward function and optimize against it.
The author first created a synthetic dataset of AI slop. A pipeline generated scenarios (such as a Slack message, email to a superior, or student essay) and then had another LLM flesh out the text for each scenario. The goal was to train a model that could rewrite this content in a more human way.
They started with a single reward function: Slop-Guard, described as 'a rule-based prose linter that scores text 0–100 for formulaic ai writing patterns.' Slop-Guard is purely programmatic, with '24 configurable rules backed by 200+ literal and structural heuristics,' returning a numeric score based on rule violations. Unfortunately, the model simply learned to hack this reward by collapsing into very short, simple sentences that stripped away nearly all original content. For example, a multi-sentence passage about university enrollment and program closures became just 'The university is closing three humanities departments.'
To fix this, the author added a second reward function: an LLM judge that graded how well information was preserved between the original and rewritten text. This semantic preservation signal helped significantly. However, when the author moved to a fine-tuned BERT model (modernbert-ai-detection-raid-mage) as an additional detector, they noticed the rewriter began producing overly casual output even when the source text was formal. A formal committee statement like 'The committee concluded that the proposed policy would impose substantial administrative costs...' became 'so the committee was basically like, "This is going to be a huge pain to manage..."' To address this, the author added a third reward: an LLM tone-preservation judge.
With these multiple rewards working, the author then aggregated a suite of open-source AI detectors—including DIVEye, TMR, and BERT-Tiny-RAID—and used their combined output as a single reward signal. This approach produced a model that performed well against open-source detectors. However, the author noticed it did not generalize to closed-source detectors like Pangram. Even scaling up to a 35-billion parameter model did not improve cross-detector generalization.
Looking forward, the author identified several strategies: directly training with closed detectors (which would require more computational spend), distilling closed-detector logic into a separate model to use as a reward, varying detector weights and sampling settings during training, or running a GAN-like adversarial loop where the rewriter learns to fool a continually updated detector while the detector is retrained on the rewriter's outputs. The key takeaway was that better models helped less than better rewards, better data, and better evals—positioning this as fundamentally an engineering and optimization problem rather than a pure scaling challenge.
The core challenge the author identifies is that reinforcement learning reward functions are 'very iterative'—the first reward usually gets exploited, forcing the developer to inspect failures and redesign the signal. In this case, optimizing purely against a rule-based detector led to trivial output (very short sentences), so the author added a semantic preservation reward. When the model then produced casual rewrites of formal text, a tone-preservation signal was introduced. This incremental debugging is presented as the actual bottleneck: reward engineering and evaluation quality matter more than model scale.
The open versus closed detector divide hints at a deeper generalization problem. The model learns patterns from public detectors but cannot transfer that knowledge to proprietary systems, suggesting that fine-tuning on one family of detectors may overfit to their specific quirks. The author's proposed solutions—directly training on closed detectors, distilling closed-detector logic into a separate model, or running a GAN-like adversarial loop—all accept that solving this requires either more data, more computational cost, or structural changes to the reward function itself. The project thus frames 'unsloppifying' as fundamentally an optimization and generalization problem, not a simple scaling one.
AI-summarized, only the topics you pick — one digest a day via Email, Slack, or Discord.
Free · takes 30 seconds · unsubscribe anytime
Ask AI anything about this article. Q&As are published on this page for other readers too.
Amazon and Google are intensifying competitive efforts against The Trade Desk (TTD), a major digital advertisi…
OpenAI introduced Premium Seats for ChatGPT Business, priced at $125 per user per month ($100 with annual bill…

Computer scientists at University of Tübingen, Max Planck Institute, MATS Research, and Snyk discovered a meth…

Anthropic pledged to embed machine-readable watermarks in Claude-generated text and digitally signed provenanc…

Anthropic has signed the EU AI Act Code of Practice and will embed invisible watermarks in Claude-generated te…

Meta CEO Mark Zuckerberg published a 6,500-word essay Monday outlining his vision for artificial intelligence…

The AI news that matters, in one minute each morning.
Sign up free