aiqbench analysis
JIVE addresses the persistent issue of mode collapse in generative models by introducing a training-free method that uses Jacobian geometry to maximize sample diversity without sacrificing quality. By leveraging matrix-free numerical linear algebra, this approach offers an efficient solution for improving both pixel and feature-level variation in few-step generation tasks. The technique represents a significant theoretical and practical advancement for stabilizing high-fidelity generative sampling across various benchmarks.
JIVE: Jacobian-Informed Volume Expansion for Diverse Generative Sampling
arXiv:2609.33906v1 Announce Type: new Abstract: Generative models often suffer from mode collapse and limited sample diversity. While prior works attempt to mitigate this by jointly generating a batch of samples and repelling their trajectories, these heuristics do not explicitly maximize the diversity of the resulting endpoints. We introduce JIVE, a training-free framework that enhances generative diversity by injecting velocity perturbations aligned with the leading right singular subspace of the generator's endpoint Jacobian. By leveraging this local geometric structure, JIVE provably maximizes endpoint diversity while preserving sample quality. To maintain practical efficiency, we compute these perturbation directions via matrix-free iterations rooted in classical numerical linear algebra, requiring only a small computational overhead. Across different benchmarks, JIVE boosts both pixel and feature-level diversity in few-step and one-step generation.
Abstract:Generative models often suffer from mode collapse and limited sample diversity. While prior works attempt to mitigate this by jointly generating a batch of samples and repelling their trajectories, these heuristics do not explicitly maximize the diversity of the resulting endpoints. We introduce JIVE, a training-free framework that enhances generative diversity by injecting velocity perturbations aligned with the leading right singular subspace of the generator's endpoint Jacobian. By leveraging this local geometric structure, JIVE provably maximizes endpoint diversity while preserving sample quality. To maintain practical efficiency, we compute these perturbation directions via matrix-free iterations rooted in classical numerical linear algebra, requiring only a small computational overhead. Across different benchmarks, JIVE boosts both pixel and feature-level diversity in few-step and one-step generation.
Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV)
arXiv:2609.33906 [cs.LG]
(or arXiv:2609.33906v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.33906 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 224 words
Related coverage

Build intelligent security for healthcare APIs with Amazon Bedrock
AWS · Aug 20, 2026

Coherent (COHR) Q4 2026 Earnings Call Transcript
fool.com · Aug 20, 2026

News
Quantum Computing Report · Jun 7, 2026

GEM Training: How Meta Doubled the Efficiency of Its LLM-Scale Ads Foundation Model
Meta Engineering · Aug 3, 2026