AIarXiv

Ranked by formulaVerdict: Routine

AReA: Adaptive Receptive-Field Attention for Efficient High-Resolution Diffusion Transformers

Generating images beyond the training resolution of Diffusion Transformers (DiTs) remains challenging, as the number of tokens grows rapidly with resolution, full attention becomes expensive, and outputs often suffer…

By Rajabi, Roohi, Lindell +1

Score█████░░░░░5.2

Caveats

  • Preprint; not yet peer reviewed.

VerdictCompetent work. Briefs at most.

Read the originalPDFCode

Abstract

Generating images beyond the training resolution of Diffusion Transformers (DiTs) remains challenging, as the number of tokens grows rapidly with resolution, full attention becomes expensive, and outputs often suffer from structural distortions and degraded detail. We identify uniform full attention as the common source of both problems. Attending to all tokens at every step causes quadratic cost and exposes the model to more tokens and relative distances beyond the training range, pushing the model out of distribution. We observe that attention's effective receptive field narrows during denoising, from global in early steps that form structure to local in later steps that refine details. We propose AReA, a training-free attention mechanism whose receptive field evolves from coarse to fine, following the denoising progression. In early steps, AReA applies cross-scale coarse attention over downsampled keys and values, capturing global context, while in later steps it applies local attention within progressively shrinking windows. Without additional parameters or training, experiments show that AReA consistently outperforms state-of-the-art training-free baselines across target resolutions and different models, while also being faster and more efficient.

Javad Rajabi, Koorosh Roohi, David B. Lindell, Babak Taati

The editor's rubric

Heuristic review

DimensionLevelWeightWhat that level means
Leverage███░░ 324%A method or resource many groups across the field will adopt within a year.
Magnitude███░░ 318%Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
Evidence██░░░ 214%Limited: single setting, weak baselines, or an observational association presented as causal.
Novelty███░░ 316%A genuinely new approach to an open problem.
Trajectory███░░ 318%A clear path to scale.
Stakes██░░░ 210%Benefits a professional community (practitioners, clinicians, engineers).

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); gains (state of the art, outperforms); novelty (discovery); scale (scalable, efficient); stakes (global scale).

How the score was computed

rank-2026-10-07

Score█████░░░░░5.2

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Merit
4.5 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.2 / 10
Shrunk toward the desk prior by editor confidence (44%).
Attention
76%
Citations, upvotes, points, mentions.
Freshness
52%
Half-life decay since publication.
  • Hugging Face upvotes46 (reference 25, via hf-daily, Oct 15, 2026, 02:05 UTC)
  • GitHub stars13 (reference 250, via hf-daily, Oct 15, 2026, 02:05 UTC)

The record

  • Reviewed by heuristic-v6 on Oct 14, 2026, 13:49 UTC. Paper type: method.
  • Categories: cs.CV
  • BRIEF, No.2 in the Artificial Intelligence edition of October 15, 2026.