Pith. sign in

REVIEW 3 cited by

On Statistical Rates of Conditional Diffusion Transformers: Approximation, Estimation and Minimax Optimality

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

arxiv 2411.17522 v1 pith:WZO5S3VF submitted 2024-11-26 stat.ML cs.AIcs.CVcs.LG

classification stat.MLcs.AIcs.CVcs.LG
keywords conditionalditsapproximationlatentunderdiffusionestimationminimax
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We investigate the approximation and estimation rates of conditional diffusion transformers (DiTs) with classifier-free guidance. We present a comprehensive analysis for ``in-context'' conditional DiTs under four common data assumptions. We show that both conditional DiTs and their latent variants lead to the minimax optimality of unconditional DiTs under identified settings. Specifically, we discretize the input domains into infinitesimal grids and then perform a term-by-term Taylor expansion on the conditional diffusion score function under H\"older smooth data assumption. This enables fine-grained use of transformers' universal approximation through a more detailed piecewise constant approximation and hence obtains tighter bounds. Additionally, we extend our analysis to the latent setting under the linear latent subspace assumption. We not only show that latent conditional DiTs achieve lower bounds than conditional DiTs both in approximation and estimation, but also show the minimax optimality of latent unconditional DiTs. Our findings establish statistical limits for conditional and unconditional DiTs, and offer practical guidance toward developing more efficient and accurate DiT models.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Force Matching with Relativistic Constraints: A Physics-Inspired Approach to Stable and Efficient Generative Modeling

    cs.LG 2025-02 reject novelty 4.0 of 10

    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.

  2. Universal Approximation of Visual Autoregressive Transformers

    cs.LG 2025-02 reject novelty 4.0 of 10

    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.

  3. High-Order Matching for One-Step Shortcut Diffusion Models

    cs.CV 2025-02 reject novelty 4.0 of 10

    HOMO extends shortcut diffusion with acceleration and jerk supervision, but the proof of superior approximation is not supported and experiments lack error bars.

Pith tools