Fuzzing with Agents? Generators Are All You Need

• URL: http://arxiv.org/abs/2604.01442v1
• Date: Wed, 01 Apr 2026 22:28:52 GMT
• Title: Fuzzing with Agents? Generators Are All You Need
• Abstract summary: We investigate whether AI coding agents can automatically synthesize target-specific generators.<n>We evaluate three configurations of Gentoo against human-written generators on fuzz targets for 7 real-world Java libraries.
• Score: 1.743178097265341
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Modern generator-based fuzzing techniques combine lightweight input generators with coverage-guided mutation as a method of exploring deep execution paths in a target program. A complimentary approach in prior research focuses on creating highly customized, domain-specific generators that encode structural and semantic logic sufficient enough to reach deep program states; the challenge comes from the overhead of writing and testing these complex generators. We investigate whether AI coding agents can automatically synthesize such target-specific generators, and whether the resulting generators are strong enough to obviate the need for coverage guidance and mutation entirely. Our approach, Gentoo, is comprised of an LLM coding agent (provided terminal access and source code of the fuzz target and its library) instructed to iteratively synthesize and refine an input generator, and optionally provided fine-grained predicate-level coverage feedback. We evaluate three configurations of Gentoo against human-written generators on fuzz targets for 7 real-world Java libraries. Our findings show that agent-synthesized generators achieve statistically significantly higher branch coverage than human-written baseline generators on 4 of 7 benchmarks. Critically, the use of coverage guidance and mutation strategies is not statistically significantly beneficial for agent-synthesized generators, but is significant for all human-written generators, suggesting that structural and semantic logic encoded in the agent generators makes coverage guidance largely unnecessary.

Related papers

• LoRC: Detecting AI-Generated Images via Low-Rank Collapse in Semantic Residuals [50.157719466558696]
  We show that modern generators exhibit low-rank collapse in the semantic-residual subspace while preserving the dominant semantic direction.<n>We propose textbfLoRC, a framework that decouples semantic dominance to capture the collapsed residual geometry.<n>Our method improves accuracy by an average of 7.0% across multiple benchmarks and achieves 97.0% accuracy on 39 unseen generators.
  arXiv  Detail & Related papers  (2026-08-21T08:58:47Z)
• Where Detectors Fail: Probing Generative Space for Generalizable AI-Generated Image Detection [69.6123714120735]
  Detecting AI-generated images (AIGI) remains challenging because detectors often fail to generalize to unseen generators.<n>We propose PROBE, a framework that improves detector generalization by actively exploring challenging regions of the generative process.
  arXiv  Detail & Related papers  (2026-05-24T07:15:06Z)
• Next-Scale Generative Reranking: A Tree-based Generative Rerank Method at Meituan [19.27715432069165]
  We introduce a next-scale generator (NSG) that progressively expands a recommendation list from user interests in a coarse-to-fine manner.<n>NSGR has been successfully deployed on the Meituan food delivery platform.
  arXiv  Detail & Related papers  (2026-04-07T01:35:20Z)
• NLGR: Utilizing Neighbor Lists for Generative Rerank in Personalized Recommendation Systems [13.848284819312953]
  Neighbor Lists model for Generative Reranking aims to improve the performance of the generator in the space.<n>We propose a novel sampling-based non-autoregressive generation method, which allows the generator to jump flexibly from the current list to any neighbor list.<n>Experiments on public and industrial datasets validate NLGR's effectiveness and we have successfully deployed NLGR on the Meituan food delivery platform.
  arXiv  Detail & Related papers  (2025-02-10T02:06:17Z)
• Preference-Guided Refactored Tuning for Retrieval Augmented Code Generation [10.736876118242384]
  We propose RRG (Retrieve, Refactor, Generate), a novel framework for effective and efficient code generation. This framework introduces a code-auger module between the retriever and the generator to bridge them. RRG achieved significant performance improvements, with increases of up to 28% on EM, 13% on BLEU, and 6.8% on CodeBLEU.
  arXiv  Detail & Related papers  (2024-09-24T09:15:37Z)
• Genetic Instruct: Scaling up Synthetic Generation of Coding Instructions for Large Language Models [59.60208063956459]
  Large Language Models (LLMs) require high quality instruction data for effective alignment.<n>We present Genetic-Instruct, a scalable algorithm for synthesizing large-scale, high quality coding instructions.
  arXiv  Detail & Related papers  (2024-07-29T20:42:59Z)
• Generator-Based Fuzzers with Type-Based Targeted Mutation [1.4507298892594764]
  In previous work, coverage-guided fuzzers used a mix of static analysis, taint analysis, and constraint-solving approaches to address this problem.<n>In this paper, we introduce a type-based mutation, along with constant string lookup, for Java GBF.<n>Results compared to a baseline GBF tool show an almost 20% average improvement in application coverage, and larger improvements when third-party code is included.
  arXiv  Detail & Related papers  (2024-06-04T07:20:13Z)
• ATM: Adversarial Tuning Multi-agent System Makes a Robust Retrieval-Augmented Generator [22.81784849762196]
  Large language models (LLMs) are proven to benefit a lot from retrieval-augmented generation (RAG) We propose to optimize the retrieval-augmented Generator with an Adversarial Tuning Multi-agent system (ATM)
  arXiv  Detail & Related papers  (2024-05-28T12:18:50Z)
• Parameter-Efficient Detoxification with Contrastive Decoding [78.5124331048714]
  We introduce Detoxification Generator (DETOXIGEN), an inference-time algorithm that steers the generation away from unwanted styles. During the actual generation, we use the trained detoxifier to produce undesirable tokens for the generator to contrast against at each decoding step. We find that it significantly outperforms previous approaches in detoxification metrics while not compromising on the generation quality.
  arXiv  Detail & Related papers  (2024-01-13T01:46:20Z)
• Red Teaming Language Model Detectors with Language Models [114.36392560711022]
  Large language models (LLMs) present significant safety and ethical risks if exploited by malicious users. Recent works have proposed algorithms to detect LLM-generated text and protect LLMs. We study two types of attack strategies: 1) replacing certain words in an LLM's output with their synonyms given the context; 2) automatically searching for an instructional prompt to alter the writing style of the generation.
  arXiv  Detail & Related papers  (2023-05-31T10:08:37Z)
• Joint Generator-Ranker Learning for Natural Language Generation [99.16268050116717]
  JGR is a novel joint training algorithm that integrates the generator and the ranker in a single framework. By iteratively updating the generator and the ranker, JGR can effectively harmonize their learning and enhance their quality jointly.
  arXiv  Detail & Related papers  (2022-06-28T12:58:30Z)
• Revisiting Discriminator in GAN Compression: A Generator-discriminator Cooperative Compression Scheme [65.5405625485559]
  GAN compression aims to reduce tremendous computational overhead and memory usages when deploying GANs on resource-constrained edge devices. In this work, we revisit the role of discriminator in GAN compression and design a novel generator-discriminator cooperative compression scheme for GAN compression, termed GCC.
  arXiv  Detail & Related papers  (2021-10-27T13:54:55Z)
• Mode Penalty Generative Adversarial Network with adapted Auto-encoder [0.15229257192293197]
  We propose a mode penalty GAN combined with pre-trained auto encoder for explicit representation of generated and real data samples in encoded space. We demonstrate that applying the proposed method to GANs helps generator's optimization becoming more stable and having faster convergence through experimental evaluations.
  arXiv  Detail & Related papers  (2020-11-16T03:39:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.