WeSearch

Distance Marching for Generative Modeling

·2 min read · 0 reactions · 0 comments · 42 views
Distance Marching for Generative Modeling
TL;DR · WeSearch summary

Distance Marching is a new time-unconditional approach for generative modeling inspired by distance field modeling, designed to improve denoising direction accuracy. It introduces principled inference methods and losses focused on closer targets, leading to better alignment with the data manifold. The method achieves superior performance on CIFAR-10 and ImageNet, with faster sampling and improved FID scores compared to flow matching.

Key facts
About this source

Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.

Original article
arXiv.org
Read full at arXiv.org →

Story provenance

Source · retrieval · rights · ranking — open for full record
inspect →

Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.

Record

Original publisherarXiv.org
Canonical URLhttps://arxiv.org/abs/2602.02928
Publication timeSat, 16 May 2026 19:17:12 +0000
Retrieval time2026-05-16T19:40:19.037Z
Last seen2026-05-16T19:40:19.037Z
Headline sourcePublisher (no WeSearch rewrite)
Excerpt sourcepublisher body
Excerpt methodFirst ~120 words (~800 chars) of extracted publisher body, fair-use limited.
SummaryWeSearch · cerebras-chat (WeSearch summarizer)
Summary source textcontentText
Citation coverageSummary is a WeSearch-generated derivative; primary citation is the original publisher URL.
Cluster3_RQP8wVzqBg
Cluster logicGrouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison.
Ranking reasonStory pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking.
Publisher visitYes — open original
Substitutes article?No — link-out required for full text

Rights status (four layers)

Publisher-declared
No publisher-confirmed rights record for this source yet.
Machine-readable
No source-specific machine-readable restriction detected beyond the public feed.
WeSearch interpretation
WeSearch declared handling (basis: Derived from the published RSS/Atom feed). This is WeSearch policy, not a legal grant on the publisher's behalf.
Unknown
Retrieval and training permissions are not asserted unless the publisher confirms them.

WeSearch handling by dimension

Indexing May the item be indexed (stored, ranked, made findable)? Allowed
Snippet May a short excerpt of the publisher's text be shown? Allowed
AI summary May WeSearch generate its own short summary of the article? Limited
Retrieval / RAG May the content be exposed for third-party retrieval-augmented generation? Not asserted
Model training May the content be used to train AI models? Not asserted
Commercial reuse May the content be reused commercially? Not permitted

Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.

Opening excerpt (first ~120 words) tap to expand

Computer Science > Machine Learning arXiv:2602.02928 (cs) [Submitted on 3 Feb 2026] Title:Distance Marching for Generative Modeling Authors:Zimo Wang, Ishit Mehta, Haolin Lu, Chung-En Sun, Ge Yan, Tsui-Wei Weng, Tzu-Mao Li View a PDF of the paper titled Distance Marching for Generative Modeling, by Zimo Wang and 6 other authors View PDF HTML (experimental) Abstract:Time-unconditional generative models learn time-independent denoising vector fields. But without time conditioning, the same noisy input may correspond to multiple noise levels and different denoising directions, which interferes with the supervision signal. Inspired by distance field modeling, we propose Distance Marching, a new time-unconditional approach with two principled inference methods.

Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv.org.

Anonymous · no account needed
Share 𝕏 Facebook Reddit LinkedIn Threads WhatsApp Bluesky Mastodon Email

Discussion

0 comments

More from arXiv.org