REVIEW 8 cited by
Dolfin: Diffusion Layout Transformers without Autoencoder
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In this paper, we introduce a novel generative model, Diffusion Layout Transformers without Autoencoder (Dolfin), which significantly improves the modeling capability with reduced complexity compared to existing methods. Dolfin employs a Transformer-based diffusion process to model layout generation. In addition to an efficient bi-directional (non-causal joint) sequence representation, we further propose an autoregressive diffusion model (Dolfin-AR) that is especially adept at capturing rich semantic correlations for the neighboring objects, such as alignment, size, and overlap. When evaluated against standard generative layout benchmarks, Dolfin notably improves performance across various metrics (fid, alignment, overlap, MaxIoU and DocSim scores), enhancing transparency and interoperability in the process. Moreover, Dolfin's applications extend beyond layout generation, making it suitable for modeling geometric structures, such as line segments. Our experiments present both qualitative and quantitative results to demonstrate the advantages of Dolfin.
Forward citations
Cited by 8 Pith papers
-
T2VTextBench: A Human Evaluation Benchmark for Textual Control in Video Generation Models
T2VTextBench is a new 73-prompt human benchmark showing that ten leading text-to-video models score below 0.44/1.0 on on-screen text fidelity, exposing a consistent weakness in current generators.
-
LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers
LazyDiT learns small gates that decide when to reuse cached layer outputs, cutting diffusion transformer compute by up to half while matching or beating DDIM quality.
-
Force Matching with Relativistic Constraints: A Physics-Inspired Approach to Stable and Efficient Generative Modeling
Force Matching replaces velocity matching in flow-based generative models with a relativistic force objective, but the toy experiments are designed so the model class matches the data generator exactly.
-
Universal Approximation of Visual Autoregressive Transformers
The paper's headline claim that VAR transformers universally approximate all Lipschitz image maps is not supported, because the theorem restricts the target class and its key lemma has an invalid linearity step.
-
Dissecting Submission Limit in Desk-Rejections: A Mathematical Analysis of Fairness in AI Conference Policies
A proposed LP-based fair desk-rejection system is presented, but its central claims about linear-programming equivalence, NP-hardness, and expected fairness contain invalid steps.
-
High-Order Matching for One-Step Shortcut Diffusion Models
HOMO extends shortcut diffusion with acceleration and jerk supervision, but the proof of superior approximation is not supported and experiments lack error bars.
-
On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis
Under SETH, the paper claims VAR models cannot be approximated faster than O(n^4) when attention entries are Theta(sqrt(log n)), but can be approximated in O(n^{2+o(1)}) when entries are o(sqrt(log n)).
-
Circuit Complexity Bounds for Visual Autoregressive Model
The authors show that a simplified formalization of the VAR image generation model lies in DLOGTIME-uniform TC0, meaning it can be simulated by constant-depth threshold circuits with polynomial size and precision.
Discussion (0). Continue with ORCID to comment.