Sign inGet started
Paper · arXiv

Learning Discriminative Geometry for Drifting Models

Recently proposed Drifting Models shift iterative distribution refinement from inference to training, enabling effective one-step generation. However, their performance on complex image datasets depends strongly on the representation used to construct the drifting field: pixel-space drifting performs poorly, whereas pretrained feature spaces substantially improve sample quality for reasons that remain unclear. We trace this gap to the discriminative geometry of the representation, which determines sample weighting in kernel density estimation (KDE) and, consequently drift. We introduce persistent representation learning, which continuously learns a more discriminative representation geome...

AuthorsDoudou Zhang, Wenwen Hou, Yilin Chen et al.
Primary categorycs.LG
Published3 October 2026
Last updated at source3 October 2026
cs.LGcs.CV
Embed this entry
<iframe src="https://silytics.si/embed/item/876347b8-be7e-4305-9295-4dffc9e97697" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.