Search Beyond What Can Be Taught: Evolving the Knowledge Boundary in Agentic Visual Generation
Summary
This paper addresses the knowledge boundary problem in visual generation by introducing the SearchGen-20K benchmark and SearchGen-Corpus-1M, and proposes a teach-then-search co-training framework to handle evolving, long-tailed user requests beyond a generator's training data.
View Cached Full Text
Cached at: 07/15/26, 04:22 PM
Paper page - Search Beyond What Can Be Taught: Evolving the Knowledge Boundary in Agentic Visual Generation
Source: https://huggingface.co/papers/2607.05382 Authors:
,
,
,
,
,
,
,
,
,
Abstract
Visualgeneratorsexcelatrendering,buttheyconfidentlyfabricatewhattheydonotknow.Userrequestsareunbounded,evolving,anddeeplylong-tailed:newcharacters,trendingentities,post-cutoffevents,andmore.Thisworld-knowledgebottleneckisstructural:generatorsaretrainedonfixedcorpora,butthevisualworldisopen-ended.WeconstructSearchGen-20KandSearchGen-Bench,with20,839promptsspanningtwelvefailurecategoriesandtwenty-twodomains,pairedwithapre-executedmultimodalSearchGen-Corpus-1Mtosupportoffline,reproducibleresearch.OnSearchGen-Bench,frontieropengeneratorsscoreonly21to28outof100,a40-pointcollapseinvisibletoexistingbenchmarks.Thenaturalremedyistoemploysearchtools,enablingagenticvisualgeneration.However,wefindthatnaivesearchfails:itretrievesindiscriminately,injectingnoiseintopromptsthegeneratoralreadyhandles.Wetracetherootcausetoagenerator-specific,evolvingknowledgeboundary:thedividebetweenwhatageneratorcaninternalizethroughtrainingandwhatmustremaininexternalcontext.Althoughthisboundaryishardtospecifyinadvance,weshowthatitisdiscoverablethroughateach-then-searchco-trainingframework.Evenaminimalversionofthisco-trainingrecipeproducesmonotonicimprovement,layingthefoundationforrecursiveself-improvementinvisualgenerationthatcanmeetworld-knowledge-groundedrequests.Wereleasethefulldataset,co-trainingcorpus,andsearchcorpusasareplayableharnessfortool-augmented,world-knowledge-groundedvisualgeneration.
View arXiv pageView PDFProject pageGitHub6Add to collection
Get this paper in your agent:
hf papers read 2607\.05382
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2607.05382 in a model README.md to link it from this page.
Datasets citing this paper3
#### JasperHaozhe/SearchGen-20K Viewer• Updated3 days ago • 20.2k • 50 • 1 #### JasperHaozhe/SearchGen-Corpus-1M Viewer• Updated3 days ago • 1.74M • 32 #### JasperHaozhe/SearchGen-Bench Viewer• Updated3 days ago • 751 • 25
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2607.05382 in a Space README.md to link it from this page.
Collections including this paper1
Similar Articles
Self-Evolving Visual Questioner
This paper introduces a self-evolving framework for vision-language models to improve their question-generation capabilities without external supervision, enhancing both question quality and answerer performance.
Visual-Seeker: Towards Visual-Native Multimodal Agentic Search via Active Visual Reasoning
Visual-Seeker proposes a visual-native multimodal deep search agent that actively reasons over fine-grained visual details and synthesizes multimodal evidence, achieving state-of-the-art performance on five challenging multimodal search benchmarks.
GenEvolve: Self-Evolving Image Generation Agents via Tool-Orchestrated Visual Experience Distillation
GenEvolve is a self-evolving image generation framework that uses tool-orchestrated trajectories and visual experience distillation to iteratively improve generative capabilities, achieving state-of-the-art performance.
EvoBrowseComp: Benchmarking Search Agents on Evolving Knowledge
This paper introduces EvoBrowseComp, a dynamic benchmark of 400 English and 400 Chinese complex questions that are synthesized via live-web traversal to evaluate search agents without test-set contamination, ensuring robustness against parametric memorization.
Knowledge-Graph Paths as Intermediate Supervision for Self-Evolving Search Agents
This paper introduces a method using knowledge-graph paths as intermediate supervision to improve self-evolving search agents. It addresses bottlenecks in Search Self-Play by grounding question construction in relational context and introducing a Waypoint Coverage Reward for graded partial credit.