RAUM-Net: Regional Attention and Uncertainty-aware Mamba Network

Mingquan Liu

REVIEW 3 major objections 5 minor 25 references

RAUM-Net: Regional Attention and Uncertainty-aware Mamba Network

T0 review · 3 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Mamba plus uncertainty filtering hits 52.5% on occluded fine-grained birds

desk verdict Plausible engineering recipe for semi-supervised FGVC under occlusion, but the main accuracy claim is undermined by an unreported, test-set-selected uncertainty threshold and no error bars. read the letter →

arxiv 2506.21905 v1 pith:WPQMX4HH submitted 2025-06-27 cs.CV

Mingquan Liu This is my paper

classification cs.CV

keywords semi-supervisedlearningfine-grainedvisualclassificationMambaregionattentionBayesianuncertaintyMonteCarlodropoutpseudo-labelselectionocclusionrobustness

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

RAUM-Net claims that semi-supervised fine-grained classification can stay accurate under label scarcity and partial occlusion if a Mamba state-space backbone is paired with region attention and Bayesian-uncertainty pseudo-label filtering. The paper reports consistent top-1 accuracy gains over FixMatch, FlexMatch, and AnomalyMatch on CUB-200 and Stanford Cars with synthetic occlusion, with the largest gap 52.5% versus 45.3% on CUB at 50% labels and 40% occlusion. The proposed explanation is that region attention suppresses occluder features while Monte Carlo dropout variance filters out unstable pseudo-labels before they contaminate training. If the claim is right, occlusion-robust fine-grained recognition becomes practical without dense annotation, which matters for real-world settings where labels are costly and objects are partly hidden.

What carries the argument

The load-bearing object is the Regional Attention and Bayesian Uncertainty (RABU) module inserted into the pseudo-label generation stream. Its region-attention component computes $A = \sigma(\operatorname{Conv}_{3\times3}(\operatorname{ReLU}(\operatorname{Conv}_{1\times1}(F))))$ and applies it as $F_{\text{att}} = F \odot A$, forcing the classifier to rely on high-attention unobscured regions. Its Bayesian component keeps dropout active and computes $U_j = \operatorname{Tr}(\operatorname{Cov}(\{p_{j,t}\}_{t=1}^T))$ over repeated forward passes, with validity mask $M_j = \mathbb{I}(\max(\bar{p}_j) \ge \tau_c \land U_j \le \tau_u)$. The unsupervised loss is cross-entropy from the accepted pseudo-label to the strongly augmented prediction, normalized by the number of accepted samples in the batch; this pair of mechanisms carries the occlusion-robustness argument.

What would settle it

Run the CUB heavy-occlusion 50%-label comparison with the uncertainty cutoff fixed on a held-out validation split before any test result is seen, and report the cutoff's numeric value; if accuracy then sits near AnomalyMatch's 45.3% rather than 52.5%, the headline margin came from test-dependent threshold selection, and if it stays near 52.5%, the claim survives.

Watch

Extended reading notes

Core claim

On its own terms, the central discovery is that the unreliable pseudo-labels that limit semi-supervised fine-grained classification under occlusion can be made dependable through two complementary mechanisms. A lightweight convolutional attention map re-weights the Mamba feature map so classification leans on unobscured discriminative regions, and with dropout left active during pseudo-label generation, $T=10$ stochastic forward passes produce a mean prediction and an uncertainty estimate equal to the trace of the prediction covariance. A sample is allowed to supervise training only when its max mean probability is at least $\tau_c = 0.95$ and its uncertainty is at most $\tau_u$, a dual filter the paper argues avoids the overconfident toxic pseudo-labels produced by FixMatch-style softmax thresholds. This yields accuracy gains that widen as occlusion increases, culminating in a reported 52.5% versus 45.3% top-1 accuracy over AnomalyMatch on CUB-200 with 50% labels and 40% occlusion.

Load-bearing premise

The reported accuracy margins depend on the uncertainty cutoff being chosen with knowledge of the test setting; if that cutoff were fixed before seeing test results, the margins could shrink.

Editorial extensions

If this is right

Under the paper's occlusion protocol, semi-supervised fine-grained accuracy degrades more gracefully: on CUB with 10% labels and 40% occlusion, RAUM-Net reports 14.1% versus 9.6% for AnomalyMatch.
The Mamba backbone contributes a meaningful share of the gain: in the hardest CUB ablation, replacing ResNet-50 with VMamba-S raises accuracy from 4.5% to 8.2%.
Regional attention and Bayesian uncertainty reinforce each other: the complete model gains 5.9 points over the Mamba baseline, which is more than the sum of the two individual component gains.
The robustness gain adds little overhead: about 0.1M parameters and 0.4G FLOPs over the base backbone, with inference speed close to the VMamba-S baseline.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The random gray-square occlusion used for training and testing probably overstates real-world gains, because real occluders carry texture and context that do not give the region-attention map such a clean shortcut.
The dual-criterion pseudo-label filter is not tied to Mamba, so an editorially inferred next step is attaching the same RABU-style filter to ViT or CNN backbones to test whether the robustness advantage transfers.
The sensitivity of accuracy to $\tau_u$ suggests that an adaptive threshold schedule, annealed from loose to strict during training, could remove the need for per-dataset tuning that the paper leaves open.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

First thing you should know: this is a plausible engineering paper, not a conceptual breakthrough. It combines a VMamba backbone, a learned spatial attention map, and an MC-dropout variance threshold to filter pseudo-labels for semi-supervised fine-grained classification under synthetic occlusion, and reports consistent gains over FixMatch, FlexMatch, and AnomalyMatch on CUB-200 and Stanford Cars. If the numbers hold, it is a useful recipe for a real problem.

What is genuinely good: the ablation is clean enough to show both the regional attention and the uncertainty filter each add a couple of points; using the same VMamba-S backbone for all baselines is fair; the efficiency table is helpful; and the occlusion protocol is clearly specified. The idea of explicitly steering the model toward unobscured regions during SSL is sensible.

The soft spot is load-bearing: the sensitivity analysis for the uncertainty threshold tau_u (Figure 2) is run on exactly the CUB 10%-label/40%-occlusion condition that appears in Table 1, and the chosen value of tau_u is never reported. There is no validation split, no fixed a-priori protocol, and the paper's own conclusion says adaptive thresholds are future work. So the 2–7 point margins over the baselines could partly come from selecting tau_u on the test set. This is not a fatal flaw in the method—it is a missing piece of experimental discipline—but it means the SOTA claim is not yet supported.

Smaller issues: no error bars or multiple seeds; Table 2's baseline uses ResNet-50 while Table 1's baselines use VMamba-S, which muddies the 'synergy' claim (the full model beats the sum of parts by 0.2 points); and the reference list has some mis-citations—[6] (DDPM) is cited for prototype learning, [19] is not Vim, and [25] is an image super-resolution paper, not an SSL method. The code link in the abstract also has a space in the repo name.

Verdict: worth a serious referee, but only after the authors report the tau_u protocol, add error bars, and clean up citations. The core combination is reasonable and the experiments are honest enough that I would want to see it fixed rather than desk-rejected. For your own work, do not cite the numbers until they are reproducible; keep the paper on your radar if you need a baseline for uncertainty-filtered SSL with a Mamba backbone.

Referee Report

3 major / 5 minor

Summary. The paper proposes RAUM-Net, a semi-supervised fine-grained visual classification (FGVC) method designed for scenarios with scarce labels and occluded images. The method uses a VMamba-S backbone, a regional attention module that reweights spatial features, and a Bayesian uncertainty module based on MC dropout that filters pseudo-labels using a confidence threshold tau_c and an uncertainty threshold tau_u. The total loss combines supervised cross-entropy with an unsupervised consistency loss applied only to pseudo-labels that pass the filter. Experiments on CUB-200-2011 and Stanford Cars with 10% and 50% labeled data under no, light, and heavy occlusion report accuracy gains over FixMatch, FlexMatch, and AnomalyMatch, with the largest margin being 52.5% vs 45.3% on CUB with 50% labels and heavy occlusion. Ablation studies and an efficiency comparison are also reported.

Significance. If the reported results prove reproducible under a fixed experimental protocol, RAUM-Net would be a practically useful contribution to semi-supervised FGVC under occlusion, and the combination of a state-space backbone with uncertainty-aware pseudo-label filtering is a reasonable and lightweight design. The paper is clearly organized, and the public code link is a positive element for reproducibility. However, the central empirical claim is currently supported only by single-run accuracy numbers, and the main uncertainty threshold tau_u is selected on a Table 1 test condition via sensitivity analysis. These issues must be resolved before the state-of-the-art claim can be accepted.

major comments (3)

[Section 4.4 (Fig. 2) and Table 1] The uncertainty threshold tau_u is selected from a sensitivity analysis performed on the CUB-200 10%-label, 40%-heavy-occlusion condition, which is itself one of the headline test conditions reported in Table 1. The paper never reports the chosen numeric value of tau_u, nor whether a single value is carried over to the 50% label ratio, Stanford Cars, and the light/no-occlusion settings, nor whether any held-out validation split was used. Because the accuracy-versus-tau_u curve is computed on the very test distribution whose Table 1 numbers are then used to claim superiority, the reported margins (e.g., 52.5% vs 45.3% in the CUB 50% heavy-occlusion row) may partly be a test-selection artifact rather than an intrinsic property of the method. The authors' own Section 5 statement that adaptive thresholds are future work confirms tau_u is manually chosen. Please provide a fixed a-priori selection protocol, report tau_u numerically, and either add a validation split or report performance across the full threshold grid with multiple seeds.
[Section 4.1 and Table 1] All reported accuracies appear to be single runs with no standard deviations or number of seeds. In semi-supervised learning with 10% labels and randomly placed occlusion patches, run-to-run variance is typically nontrivial, and the claimed improvements are often only a few percentage points. The paper should report mean plus/minus standard deviation over at least three seeds and, for the test-time occlusion protocol, multiple random occlusion masks, before claiming consistent and significant superiority across all conditions.
[Section 4.2] The statement that baseline hyperparameters were 'meticulously searched' is not backed by search ranges, chosen values, or the search protocol. Since the paper's central claim is an empirical comparison against these baselines, the reader cannot judge whether the comparison was fair or whether the reported baseline accuracies are representative. Please provide the baseline hyperparameter values and search details, or use documented default settings with appropriate references.

minor comments (5)

[Table 2] The first row of Table 2 contains a typo ('suiek') in the Model Configuration column; please correct it.
[Section 4.2] The implementation details mention a 'warm-up period of 100 epochs for the teacher model,' but no teacher-student architecture is described anywhere in the method. Please clarify whether this is a typo or how the teacher model is defined and used.
[Section 3.3.2] The paper does not specify where dropout layers are located in VMamba-S. Since VMamba-S may not contain conventional dropout layers, please explain the MC Dropout implementation, for example whether dropout is inserted after specific blocks or applied through drop-path.
[Section 4.1] The occlusion protocol applies gray squares to unlabeled training data and all test data but not to labeled training data. This asymmetry should be stated explicitly as an intended protocol, and its effect on the comparison should be discussed.
[Section 4.4 and Table 2] The ablation section claims a positive synergy because the full model's gain over the Mamba baseline (5.9 points) exceeds the sum of the individual gains (3.3 + 2.4 = 5.7 points). This conclusion rests on a 0.2 percentage point difference and is not meaningful without variance estimates; please temper the claim or provide error bars.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the empirical accuracy comparisons are measured outcomes rather than quantities derived from fitted inputs; the tau_u sensitivity analysis is an evaluation-protocol concern, not a definitional reduction.

full rationale

RAUM-Net makes no first-principles derivation; its claims are benchmark accuracies from training and testing. The only potential circularity candidate is the uncertainty threshold tau_u: Section 4.4 and Figure 2 select tau_u by accuracy on the CUB 10%-label/40%-occlusion test condition, and Table 1 reports accuracy on that same condition. This is test-set hyperparameter tuning, which can inflate results and hurts reproducibility, but it is not circular in the derivation sense: tau_u is not defined in terms of the reported accuracies, no equation equates the reported score to the threshold choice, and the comparison to FixMatch/FlexMatch/AnomalyMatch is not forced by construction. The paper contains no self-citations that carry load, no author-imported uniqueness theorem, and no renaming of a known result. Ablations compare component configurations on the same benchmark; those comparisons are empirical, not tautological. The appropriate verdict is no significant circularity, with the caveat that the missing numeric tau_u and fixed validation protocol should be supplied for the empirical claim to be properly evaluated.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The central claim rests on hyperparameters (tau_c, tau_u, lambda, T) and on the validity of MC-dropout variance and spatial attention as mechanisms for filtering and focusing. No new physical entities or external mechanisms are introduced. The most consequential free parameter is tau_u, which is tuned on the test condition and not reported.

free parameters (4)

confidence threshold tau_c = 0.95
Fixed by hand in Section 4.2; controls whether the average MC-dropout confidence is high enough to accept a pseudo-label in mask Mj.
uncertainty threshold tau_u = Not reported; selected via sensitivity analysis in Figure 2 on the CUB 10%-label, 40%-occlusion test condition
High-impact hyperparameter in the pseudo-label filter; its value is not stated and no validation split is described, so the main results depend on test-set-derived selection.
unsupervised loss weight lambda = 1.0
Set manually in Section 4.2 to balance supervised and consistency losses.
MC dropout forward passes T = 10
Set manually in Section 4.2; determines the number of stochastic predictions used to compute mean and variance.

assumptions (4)

standard math Monte Carlo Dropout approximates Bayesian inference (Gal and Ghahramani, 2016)
Section 3.3.2 uses MC dropout variance as a measure of epistemic uncertainty without re-deriving the approximation or testing its validity on this fine-grained task.
domain assumption The trace of the covariance of MC-dropout softmax predictions is a valid measure of pseudo-label reliability
Section 3.3.2 defines Uj = Tr(Cov({p})) and uses it as the uncertainty criterion; no evidence is shown that high variance correlates with incorrect pseudo-labels under occlusion.
domain assumption A lightweight two-convolution spatial attention map can highlight unobscured discriminative regions
Section 3.3.1 assumes the learned attention weights suppress occluders and background; this is supported only indirectly by the ablation result.
domain assumption FixMatch-style weak-to-strong consistency regularization is an effective SSL prior
Section 3.1 builds the semi-supervised framework on consistency between weakly augmented pseudo-labels and strongly augmented predictions, adopting this assumption from [15] without questioning it for fine-grained tasks.

how reviews work

0 comments

Cite this review

Pith. "Pith review of RAUM-Net: Regional Attention and Uncertainty-aware Mamba Network." pith.science (2026). https://pith.science/paper/WPQMX4HH

@misc{pith2026250621905,
  author       = {Pith},
  title        = {Pith review of: RAUM-Net: Regional Attention and Uncertainty-aware Mamba Network},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WPQMX4HH}},
  note         = {Machine review of arXiv:2506.21905}
}

read the original abstract

Fine Grained Visual Categorization (FGVC) remains a challenging task in computer vision due to subtle inter class differences and fragile feature representations. Existing methods struggle in fine grained scenarios, especially when labeled data is scarce. We propose a semi supervised method combining Mamba based feature modeling, region attention, and Bayesian uncertainty. Our approach enhances local to global feature modeling while focusing on key areas during learning. Bayesian inference selects high quality pseudo labels for stability. Experiments show strong performance on FGVC benchmarks with occlusions, demonstrating robustness when labeled data is limited. Code is available at https://github.com/wxqnl/RAUM Net.

Figures

Figures reproduced from arXiv: 2506.21905 by the authors.

**Figure 1.** The overall framework of RAUM-Net. The supervised learning path utilizes labeled data for standard cross-entropy loss, while [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗

**Figure 2.** Sensitivity analysis of the uncertainty threshold ( [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

25 extracted references · 15 canonical work pages

[6]

Denoising dif- fusion probabilistic models

Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising dif- fusion probabilistic models. Advances in neural information processing systems, 33:6840–6851, 2020. 3

2020
[19]

Dynamic vision mamba

Mengxuan Wu, Zekai Li, Zhiyuan Liang, Moyang Li, Xu- anlei Zhao, Samir Khaki, Zheng Zhu, Xiaojiang Peng, Kon- stantinos N Plataniotis, Kai Wang, et al. Dynamic vision mamba. arXiv preprint arXiv:2504.04787, 2025. 3

arXiv 2025
[25]

Uncertainty-guided Perturbation for Image Super-Resolution Diffusion Model

Leheng Zhang, Weiyi You, Kexuan Shi, and Shuhang Gu. Uncertainty-guided perturbation for image super-resolution diffusion model. arXiv preprint arXiv:2503.18512, 2025. 4

work page Pith review arXiv 2025
[1]

Fet-fgvc: Feature-enhanced transformer for fine-grained visual classification

Huazhen Chen, Haimiao Zhang, Chang Liu, Jianpeng An, Zhongke Gao, and Jun Qiu. Fet-fgvc: Feature-enhanced transformer for fine-grained visual classification. Pattern Recognition, 149:110265, 2024. 1

work page 2024
[2]

An image is worth 16x16 words: Trans- formers for image recognition at scale

Alexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn, Xiaohua Zhai, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer, Georg Heigold, Syl- vain Gelly, et al. An image is worth 16x16 words: Trans- formers for image recognition at scale. arXiv preprint arXiv:2010.11929, 2020. 3

arXiv 2010
[3]

Dropout as a bayesian approximation: Representing model uncertainty in deep learning

Yarin Gal and Zoubin Ghahramani. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. In international conference on machine learning , pages 1050–1059. PMLR, 2016. 2

2016
[4]

AnomalyMatch: Discovering Rare Objects of Interest with Semi-supervised and Active Learning

Pablo G ´omez and David O’Ryan. Anomalymatch: Discov- ering rare objects of interest with semi-supervised and active learning. arXiv preprint arXiv:2505.03509, 2025. 4, 7

work page Pith review arXiv 2025
[5]

Mamba: Linear-time sequence modeling with selective state spaces

Albert Gu and Tri Dao. Mamba: Linear-time sequence modeling with selective state spaces. arXiv preprint arXiv:2312.00752, 2023. 2

arXiv 2023

Show all 25 references

[7]

Part- stacked cnn for fine-grained visual categorization

Shaoli Huang, Zhe Xu, Dacheng Tao, and Ya Zhang. Part- stacked cnn for fine-grained visual categorization. In Pro- ceedings of the IEEE conference on computer vision and pat- tern recognition, pages 1173–1182, 2016. 1

2016
[8]

Low-rank bilinear pool- ing for fine-grained classification

Shu Kong and Charless Fowlkes. Low-rank bilinear pool- ing for fine-grained classification. In Proceedings of the IEEE conference on computer vision and pattern recogni- tion, pages 365–374, 2017. 1

2017
[9]

Vmamba: Visual state space model

Yue Liu, Yunjie Tian, Yuzhong Zhao, Hongtian Yu, Lingxi Xie, Yaowei Wang, Qixiang Ye, Jianbin Jiao, and Yunfan Liu. Vmamba: Visual state space model. Advances in neural information processing systems, 37:103031–103063, 2024. 3

2024
[10]

Swin transformer v2: Scaling up capacity and resolution

Ze Liu, Han Hu, Yutong Lin, Zhuliang Yao, Zhenda Xie, Yixuan Wei, Jia Ning, Yue Cao, Zheng Zhang, Li Dong, et al. Swin transformer v2: Scaling up capacity and resolution. In Proceedings of the IEEE/CVF conference on computer vi- sion and pattern recognition, pages 12009–12019, 2022. 3

2022
[11]

Fine-grained adversarial semi- supervised learning

Daniele Mugnai, Federico Pernici, Francesco Turchini, and Alberto Del Bimbo. Fine-grained adversarial semi- supervised learning. ACM Transactions on Multimedia Com- puting, Communications, and Applications (TOMM), 18(1s): 1–19, 2022. 2

2022
[12]

An overview of deep semi-supervised learning

Yassine Ouali, C ´eline Hudelot, and Myriam Tami. An overview of deep semi-supervised learning. arXiv preprint arXiv:2006.05278, 2020. 1

2006 arXiv
[13]

A survey of recent advances in cnn-based fine-grained visual categorization

Chenyang Qiu and Wei Zhou. A survey of recent advances in cnn-based fine-grained visual categorization. In 2020 IEEE 20th International Conference on Communication Technol- ogy (ICCT), pages 1377–1384, 2020. 2

2020
[14]

In defense of pseudo-labeling: An uncertainty-aware pseudo-label selection framework for semi-supervised learning

Mamshad Nayeem Rizve, Kevin Duarte, Yogesh S Rawat, and Mubarak Shah. In defense of pseudo-labeling: An uncertainty-aware pseudo-label selection framework for semi-supervised learning. arXiv preprint arXiv:2101.06329,

arXiv
[15]

Fixmatch: Simplifying semi-supervised learning with consistency and confidence

Kihyuk Sohn, David Berthelot, Nicholas Carlini, Zizhao Zhang, Han Zhang, Colin A Raffel, Ekin Dogus Cubuk, Alexey Kurakin, and Chun-Liang Li. Fixmatch: Simplifying semi-supervised learning with consistency and confidence. Advances in neural information processing systems, 33:5...

2020
[16]

Find it if you can: end-to-end adversar- ial erasing for weakly-supervised semantic segmentation

Erik Stammes, Tom FH Runia, Michael Hofmann, and Mohsen Ghafoorian. Find it if you can: end-to-end adversar- ial erasing for weakly-supervised semantic segmentation. In Thirteenth International Conference on Digital Image Pro- cessing (ICDIP 2021), pages 610–619. SPIE, 2021. 3

2021
[17]

Learn- ing a discriminative filter bank within a cnn for fine-grained recognition

Yaming Wang, Vlad I Morariu, and Larry S Davis. Learn- ing a discriminative filter bank within a cnn for fine-grained recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 4148–4157,
[18]

Freematch: Self-adaptive thresholding for semi-supervised learning

Yidong Wang, Hao Chen, Qiang Heng, Wenxin Hou, Yue Fan, Zhen Wu, Jindong Wang, Marios Savvides, Takahiro Shinozaki, Bhiksha Raj, et al. Freematch: Self-adaptive thresholding for semi-supervised learning. arXiv preprint arXiv:2205.07246, 2022. 2

2022 arXiv
[20]

End-to- end semi-supervised object detection with soft teacher

Mengde Xu, Zheng Zhang, Han Hu, Jianfeng Wang, Lijuan Wang, Fangyun Wei, Xiang Bai, and Zicheng Liu. End-to- end semi-supervised object detection with soft teacher. In Proceedings of the IEEE/CVF international conference on computer vision, pages 3060–3069, 2021. 1

2021
[21]

Dfr: Deep feature re- construction for unsupervised anomaly segmentation

Jie Yang, Yong Shi, and Zhiquan Qi. Dfr: Deep feature re- construction for unsupervised anomaly segmentation. arXiv preprint arXiv:2012.07122, 2020. 3

2012 arXiv
[22]

Learning to navigate for fine-grained clas- sification

Ze Yang, Tiange Luo, Dong Wang, Zhiqiang Hu, Jun Gao, and Liwei Wang. Learning to navigate for fine-grained clas- sification. In Proceedings of the European conference on computer vision (ECCV), pages 420–435, 2018. 3

2018
[23]

A 1d-inception-resnet based global detection model for thin- skinned multifruit spectral quantitative analysis

Yan Yu, Jipeng Huang, Lianming Wang, and Shili Liang. A 1d-inception-resnet based global detection model for thin- skinned multifruit spectral quantitative analysis. Food Con- trol, 167:110823, 2025. 3

2025
[24]

Flexmatch: Boosting semi-supervised learning with curricu- lum pseudo labeling

Bowen Zhang, Yidong Wang, Wenxin Hou, Hao Wu, Jin- dong Wang, Manabu Okumura, and Takahiro Shinozaki. Flexmatch: Boosting semi-supervised learning with curricu- lum pseudo labeling. Advances in neural information pro- cessing systems, 34:18408–18419, 2021. 2, 7

2021

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.

[1] [6]

Denoising dif- fusion probabilistic models

Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising dif- fusion probabilistic models. Advances in neural information processing systems, 33:6840–6851, 2020. 3

2020

[2] [19]

Dynamic vision mamba

Mengxuan Wu, Zekai Li, Zhiyuan Liang, Moyang Li, Xu- anlei Zhao, Samir Khaki, Zheng Zhu, Xiaojiang Peng, Kon- stantinos N Plataniotis, Kai Wang, et al. Dynamic vision mamba. arXiv preprint arXiv:2504.04787, 2025. 3

arXiv 2025

[3] [25]

Uncertainty-guided Perturbation for Image Super-Resolution Diffusion Model

Leheng Zhang, Weiyi You, Kexuan Shi, and Shuhang Gu. Uncertainty-guided perturbation for image super-resolution diffusion model. arXiv preprint arXiv:2503.18512, 2025. 4

work page Pith review arXiv 2025

[4] [1]

Fet-fgvc: Feature-enhanced transformer for fine-grained visual classification

Huazhen Chen, Haimiao Zhang, Chang Liu, Jianpeng An, Zhongke Gao, and Jun Qiu. Fet-fgvc: Feature-enhanced transformer for fine-grained visual classification. Pattern Recognition, 149:110265, 2024. 1

work page 2024

[5] [2]

An image is worth 16x16 words: Trans- formers for image recognition at scale

Alexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn, Xiaohua Zhai, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer, Georg Heigold, Syl- vain Gelly, et al. An image is worth 16x16 words: Trans- formers for image recognition at scale. arXiv preprint arXiv:2010.11929, 2020. 3

arXiv 2010

[6] [3]

Dropout as a bayesian approximation: Representing model uncertainty in deep learning

Yarin Gal and Zoubin Ghahramani. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. In international conference on machine learning , pages 1050–1059. PMLR, 2016. 2

2016

[7] [4]

AnomalyMatch: Discovering Rare Objects of Interest with Semi-supervised and Active Learning

Pablo G ´omez and David O’Ryan. Anomalymatch: Discov- ering rare objects of interest with semi-supervised and active learning. arXiv preprint arXiv:2505.03509, 2025. 4, 7

work page Pith review arXiv 2025

[8] [5]

Mamba: Linear-time sequence modeling with selective state spaces

Albert Gu and Tri Dao. Mamba: Linear-time sequence modeling with selective state spaces. arXiv preprint arXiv:2312.00752, 2023. 2

arXiv 2023