Search arXiv⌕ Search

arXiv · 2610.00294

LENS-GRF: Permutation-Invariant Lesion Evidence Network with Gated Residual Fusion for Acne Severity Grading and Multi-Rater Clinical Oracle Analysis

Abstract

Localized lesion evidence may improve automated acne severity grading, but detector errors and differences in clinical grading criteria can limit generalization. We evaluated LENS-GRF, a lesion evidence network with permutation-invariant aggregation and gated residual fusion that combines a global Vision Transformer with lesion-region embeddings derived from YOLO11s proposals. Fully automated four-class grading was evaluated on 292 held-out ACNE04 images and, without external adaptation, on 200 PLSBRACNE01 participants represented by 600 facial views. Annotation-assisted inference used registered lesion boxes from three dermatologists in a matched subset of 148 participants. Performance measures included accuracy, macro-averaged precision, sensitivity, and one-versus-rest specificity. Paired comparisons used exact McNemar tests with Holm adjustment. On ACNE04, automated LENS-GRF achieved 80.82% accuracy, 78.80% macro precision, 78.92% sensitivity, and 92.78% specificity. With supplied lesion boxes, internal accuracy averaged 95.89% across three seeds. On the full external cohort, automated LENS-GRF achieved 35.00% accuracy, compared with 42.50% for an independently trained global baseline. External macro precision, sensitivity, and specificity for LENS-GRF were 50.52%, 34.31%, and 78.19%, respectively. In the matched subset, accuracy using Doctor A's lesion annotations was 47.97%, compared with 35.14% for automated inference (unadjusted $p = 0.0094$; Holm-adjusted $p = 0.0846$). Strong internal performance with supplied lesion annotations did not translate into reliable automated grading on the external cohort. More reliable lesion detection, modelling that accounts for differences in grading criteria, and independent validation are needed before clinical use.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muhammad Muhtasim Shahriar, M. F. Mridha, Md. Rakibul Islam. 2026-10-31. LENS-GRF: Permutation-Invariant Lesion Evidence Network with Gated Residual Fusion for Acne Severity Grading and Multi-Rater Clinical Oracle Analysis. https://arxiv.org/abs/2610.00294

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Graph-Aggregated Prototype Learning for Remote Sensing Semantic Change Detection

Semantic change detection (SCD) extends the binary change detection task to provide not only the change locations but also the detailed "from-to" categories in multi-temporal remote sensing data. Such detailed semantic insights into changes offer considerable advantages for a wide array of applications. However, since SCD involves the simultaneous optimization of multiple tasks, the model is prone to negative transfer due to task-specific learning difficulties and conflicting gradient flows. To address this issue, we propose Graph-Aggregated Prototype Learning for Remote Sensing Semantic Change Detection(GAPL-SCD). In this framework, a multi-task joint optimization method is designed to optimize the primary task of semantic segmentation and change detection, along with the auxiliary task of graph aggregation prototype learning. Adaptive weight allocation and gradient rotation methods are used to alleviate the conflict between training tasks and improve multi-task learning capabilities. Specifically, the graph aggregation prototype learning module constructs an interaction graph using high-level features. Prototypes serve as class proxies, enabling category-level domain alignment across time points and reducing interference from irrelevant changes. Additionally, the proposed self-query multi-level feature interaction and bi-temporal feature fusion modules further enhance multi-scale feature representation, improving performance in complex scenes. Experimental results on the SECOND and Landsat-SCD datasets demonstrate that our method achieves state-of-the-art performance, with significant improvements in accuracy and robustness for SCD task.

cs.CV↗

Compact Attention: Exploiting Structured Spatio-Temporal Sparsity for Fast Video Generation

The quadratic computational complexity of self-attention mechanisms imposes a critical constraint on transformer-based video generation, particularly for synthesizing ultra-long and high-definition sequences. While most sparse attention techniques employ fixed or heuristic patterns, they often struggle to accommodate the heterogeneous and layer-specific redundancies inherent in video diffusion transformers (VDiTs). We find that different attention heads consistently concentrate most of their attention mass in different coarse query-key regions, a behavior we call functional specialization. Although individual attention values vary with the generated content, these regions remain similar across prompts and random seeds. Leveraging these insights, we introduce Compact Attention, a hardware-aware sparse attention framework for efficient long-video synthesis. We quantify this stability and use it to construct searchable, reusable, head-specific masks. Based on the observation, we propose a deformable dual-window sparse pattern mechanism that flexibly approximates local and axial attention regions within one tile-aligned mask family. To avoid manually choosing a mask for each head, we develop a recall-driven offline auto-search algorithm that identifies high-quality sparse masks while leveraging temporal stability for mask reuse. Extensive evaluations on Wan2.1 (14B) and Hunyuan-Video demonstrate that Compact Attention achieves 2.25x/3.03x attention speedups over FlashAttention-2 and 1.20x/1.74x over FlashAttention-3, respectively, while maintaining visual quality and temporal consistency comparable to full-attention baselines. Project Page: https://yo-ava.github.io/Compact-Attention.github.io/

cs.CV↗

Backpropagation-Free Test-Time Adaptation via Probabilistic Gaussian Alignment

Test-time adaptation (TTA) enhances the zero-shot robustness under distribution shifts by leveraging unlabeled test data during inference. Despite notable advances, several challenges still limit its broader applicability. First, most methods rely on backpropagation or iterative optimization, which limits scalability and hinders real-time deployment. Second, they lack explicit modeling of class-conditional feature distributions. This modeling is crucial for producing reliable decision boundaries and calibrated predictions, but it remains underexplored due to the lack of both source data and supervision at test time. In this paper, we propose ADAPT, an Advanced Distribution-Aware and backPropagation-free Test-time adaptation method. We reframe TTA as a Gaussian probabilistic inference task by modeling class-conditional likelihoods using gradually updated class means and a shared covariance matrix. This enables closed-form, training-free inference. To correct potential likelihood bias, we introduce lightweight regularization guided by CLIP priors and a historical knowledge bank. ADAPT requires no source data, no gradient updates, and no full access to target data, supporting both online and transductive settings. Extensive experiments across diverse benchmarks demonstrate that our method achieves state-of-the-art performance under a wide range of distribution shifts with superior scalability and robustness.

cs.CV↗